An O(n log n) algorithm for finding all repetitions in a string
- 30 September 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (3) , 422-432
- https://doi.org/10.1016/0196-6774(84)90021-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Avoidable patterns in strings of symbolsPacific Journal of Mathematics, 1979
- A Linear-Time On-Line Recognition Algorithm for ``Palstar''Journal of the ACM, 1978
- Real-time recognition of substring repetition and reversalTheory of Computing Systems, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Bounded AFLsJournal of Computer and System Sciences, 1976
- A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a StringJournal of the ACM, 1975
- Généralisation du théorème de van der waerden sur les semi-groupes répétitifsJournal of Combinatorial Theory, Series A, 1972
- Classification of noncounting eventsJournal of Computer and System Sciences, 1971
- 2726. A problem on strings of beadsThe Mathematical Gazette, 1957
- Unending chess, symbolic dynamics and a problem in semigroupsDuke Mathematical Journal, 1944