✦ LIBER ✦

An O(n log n) algorithm for finding all repetitions in a string

✍ Scribed by Michael G Main; Richard J Lorentz

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n log n) unidirectional distributed

✍ Danny Dolev; Maria Klawe; Michael Rodeh 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 997 KB

A randomized algorithm for finding maxim

✍ Hing F. Ting; Andrew C. Yao 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 410 KB

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

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

An O(n log m) algorithm for the Josephus

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

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

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

An O(n log n) feasibility algorithm for

✍ Mohan Ahuja; Yahui Zhu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 494 KB