Computation of squares in a string
- 1 January 1994
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 146-150
- https://doi.org/10.1007/3-540-58094-8_13
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Approximate string matching in sublinear expected timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Transducers and repetitionsTheoretical Computer Science, 1986
- Efficient and Elegant Subword-Tree ConstructionPublished by Springer Nature ,1985
- Discovering Repetitions in StringsPublished by Springer Nature ,1985
- Linear Time Recognition of Squarefree StringsPublished by Springer Nature ,1985
- An O(n log n) algorithm for finding all repetitions in a stringJournal of Algorithms, 1984
- Optimal off-line detection of repetitions in a stringTheoretical Computer Science, 1983
- Detection of periodicities and string-matching in real timeJournal of Mathematical Sciences, 1983
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976