✦ LIBER ✦

Bounded ordered dictionaries in O(log log N) time and O(n) space

✍ Scribed by Kurt Mehlhorn; Stefan Näher

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Variable abstraction in O(n log n) space

✍ J.R. Kennaway; M.R. Sleep 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 604 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

Translation of Turner Combinators in O(n

✍ Kohei Noshita 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 265 KB

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

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