✦ LIBER ✦

Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

✍ Scribed by Tarjan, Robert E.; Van Wyk, Christopher J.

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(log n) time parallel algorithm for

✍ Cao An Wang; Yung H. Tsin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 439 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 + m log log n) maximum weig

✍ Wei-Kuan Shih; Wen-Lian Hsu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 852 KB

A simple algorithm for learning O(log n)

✍ Eyal Kushilevitz 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 319 KB

An O(n-log-log-n) Time Algorithm for Con

✍ T. Asano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB