1. Computing the maximal-exponent repeats of an overlap-free string in linear time;Badkobeh,2012
2. The “runs” theorem;Bannai;SIAM J. Comput.,2017
3. Finding maximal pairs with bounded gap;Brodal;J. Discrete Algorithms,2000
4. An optimal algorithm for computing the repetitions in a word;Crochemore;Inform. Process. Lett.,1981
5. Squares, cubes, and time–space efficient string searching;Crochemore;Algorithmica,1995