✦ LIBER ✦

Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)

✍ Scribed by Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Erratum: An $O(n\log \log n)$-Time Algor

✍ Tarjan, Robert E.; Van Wyk, Christopher J. 📂 Article 📅 1988 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 60 KB

Bounded ordered dictionaries in O(log lo

✍ Kurt Mehlhorn; Stefan Näher 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 456 KB

Sorting in Average Time $o(\log \,n)$

✍ Ajtai, M.; Karabeg, D.; Komlós, J.; Szemerédi, E. 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 991 KB

Matching Nuts and Bolts in O(n log n) Ti

✍ Komlós, János; Ma, Yuan; Szemerédi, Endre 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 454 KB

Finding neighbors on bincode-based image

✍ Kuo-Liang Chung; Chi-Yen Huang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Ranking arborescences in O(Km log n) tim

✍ Paolo M. Camerini; Luigi Fratta; Francesco Maffioli 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 761 KB