Optimal off-line detection of repetitions in a string
- 28 February 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 22 (3), 297-315
- https://doi.org/10.1016/0304-3975(83)90109-3
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Linear pattern matching algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973
- Uniqueness theorems for periodic functionsProceedings of the American Mathematical Society, 1965
- The equation $a^M=b^Nc^P$ in a free group.The Michigan Mathematical Journal, 1962