✦ LIBER ✦

An $O(N \cdot \log N)$ Algorithm for a Class of Matching Problems

✍ Scribed by Megiddo, Nimrod; Tamir, Arie

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n log n log log n) parallel maximum

✍ Taenam Kim; Kyung-Yong Chwa 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 170 KB

An O(n log n) algorithm for the convex b

✍ G. Gallo 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 197 KB

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

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

An O(n log n) algorithm for a maxmin loc

✍ C.Pandu Rangan; Ramesh Govindan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 257 KB

An O(n log m) algorithm for the Josephus

✍ Errol L Lloyd 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 458 KB

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