✦ LIBER ✦

An O(N) algorithm for finding periodicity of a sequence using hash coding

✍ Scribed by Teruo Hikita; Eiichi Goto

Book ID: 113161951
Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 342 KB
Volume: 6
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(77)90085-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal O(n) algorithm for identifyin

An optimal O(n) algorithm for identifying line segments from a sequence of chain codes

✍ Jianxing Yuan; Ching Y. Suen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 883 KB

An O(n log n) algorithm for finding all

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

✍ Michael G Main; Richard J Lorentz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 602 KB

An algorithm for computing the error seq

An algorithm for computing the error sequence of(p^{n})-periodic binary sequences

✍ Tang, Miao 📂 Article 📅 2014 🏛 Springer 🌐 English ⚖ 196 KB

An n-gram hash and skip algorithm for fi

An n-gram hash and skip algorithm for finding large numbers of keywords in continuous text streams

✍ Jonathan D. Cohen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 407 KB 👁 1 views

A method of full-text scanning for matches in a large dictionary of keywords is described, suitable for Selective Dissemination of Information (SDI). The method is applicable to large dictionaries (say 10 4 to 10 5 entries), and to arbitrary byte streams for both patterns and data samples. The appro

An O(n log n) unidirectional distributed

An O(n log n) unidirectional distributed algorithm for extrema finding in a circle

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

An O(n3) algorithm for finding the minim

An O(n3) algorithm for finding the minimal opaque forest of a convex polygon

✍ Pratul Dublish 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 131 KB