✦ LIBER ✦

Ranking arborescences in O(Km log n) time

✍ Scribed by Paolo M. Camerini; Luigi Fratta; Francesco Maffioli

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Finding neighbors on bincode-based image

✍ Kuo-Liang Chung; Chi-Yen Huang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 440 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

An Optimal $O(\log\log n)$ Time Parallel

✍ Breslauer, Dany; Galil, Zvi 📂 Article 📅 1990 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 960 KB

Computing Minimal Triangulations in Time

✍ Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 205 KB