✦ LIBER ✦

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

✍ Scribed by Ajtai, M.; Karabeg, D.; Komlós, J.; Szemerédi, E.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Insertion Sort is O(n log n)

✍ Michael A. Bender; Martin Farach-Colton; Miguel A. Mosteiro 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 162 KB

Sorting Stably, in Place, with O(n log n

✍ Gianni Franceschini 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 299 KB

Bounded ordered dictionaries in O(log lo

✍ Kurt Mehlhorn; Stefan Näher 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 456 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

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