An optimal algorithm for computing the repetitions in a word

Aho, 1974, The Design and Analysis of Computer Algorithms, 157 A. Cardon and M. Crochemore, Partitioning a graph in O(⋎A⋎log2⋎V⋎), Theoret. Comput. Sci., to appear. A. Ehrenfeucht and G. Rosenburg, On the separating power of EOL systems, RAIRO, to appear. Harrison, 1978 Knuth, 1977, Fast patternmatching in strings, SIAM J. Comput., 6, 323, 10.1137/0206024 Lentin, 1969, A combinatorial problem in the theory of free monoids, 128 Ross, 1981