✦ LIBER ✦

Finding neighbors on bincode-based images in O (n log log n) time

✍ Scribed by Kuo-Liang Chung; Chi-Yen Huang

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

Finding the upper envelope of n line seg

✍ John Hershberger 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 897 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

Ranking arborescences in O(Km log n) tim

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

Stabbing isothetic boxes and rectangles

✍ Michael E. Hohmeyer; Seth J. Teller 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 420 KB