A. Apostolico and F. P. Preparata, Optimal off-line detection of repetitions in a string, Theoretical Computer Science, vol.22, issue.3, pp.297-315, 1983.
DOI : 10.1016/0304-3975(83)90109-3

M. Crochemore, An optimal algorithm for computing the repetitions in a word, Information Processing Letters, vol.12, issue.5, pp.244-250, 1981.
DOI : 10.1016/0020-0190(81)90024-7
URL : https://hal.archives-ouvertes.fr/hal-00619551

M. Crochemore and L. Ilie, Maximal repetitions in strings, Journal of Computer and System Sciences, vol.74, issue.5, 2007.
DOI : 10.1016/j.jcss.2007.09.003
URL : https://hal.archives-ouvertes.fr/hal-00619712

M. Crochemore, L. Ilie, and L. Tinta, Towards a Solution to the ???Runs??? Conjecture, Combinatorial Pattern Matching, 2008.
DOI : 10.1007/978-3-540-69068-9_27
URL : https://hal.archives-ouvertes.fr/hal-00620277

M. Crochemore and W. Rytter, Squares, cubes, and time-space efficient string searching, Algorithmica, vol.67, issue.3, pp.405-425, 1995.
DOI : 10.1007/BF01190846
URL : https://hal.archives-ouvertes.fr/hal-00619583

F. Franek, R. J. Simpson, and W. F. Smyth, The maximum number of runs in a string, Proc. 14th Australasian Workshop on Combinatorial Algorithms, pp.26-35, 2003.

M. Giraud, Not So Many Runs in Strings, 2nd International Conference on Language and Automata Theory and Applications, 2008.
DOI : 10.1007/978-3-540-88282-4_22
URL : https://hal.archives-ouvertes.fr/inria-00271630

C. S. Iliopoulos, D. Moore, and W. F. Smyth, A characterization of the squares in a Fibonacci string, Theoretical Computer Science, vol.172, issue.1-2, pp.281-291, 1997.
DOI : 10.1016/S0304-3975(96)00141-7

R. Kolpakov and G. Kucherov, Finding maximal repetitions in a word in linear time, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.596-604, 1999.
DOI : 10.1109/SFFCS.1999.814634
URL : https://hal.archives-ouvertes.fr/inria-00098853

R. Kolpakov and G. Kucherov, On maximal repetitions in words, J. Discret. Algorithms, vol.1, issue.1, pp.159-186, 2000.
DOI : 10.1007/3-540-48321-7_31
URL : https://hal.archives-ouvertes.fr/inria-00098852

K. Kusano, W. Matsubara, A. Ishino, H. Bannai, and A. Shinohara, New lower bounds for the maximum number of runs in a string, p.1214, 2008.

M. Lothaire, Applied Combinatorics on Words, 2005.
DOI : 10.1017/CBO9781107341005
URL : https://hal.archives-ouvertes.fr/hal-00620607

M. G. Main, Detecting leftmost maximal periodicities, Discrete Applied Mathematics, vol.25, issue.1-2, pp.145-153, 1989.
DOI : 10.1016/0166-218X(89)90051-6
URL : http://doi.org/10.1016/0166-218x(89)90051-6

M. G. Main and R. J. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, Journal of Algorithms, vol.5, issue.3, pp.422-432, 1984.
DOI : 10.1016/0196-6774(84)90021-X

S. J. Puglisi, J. Simpson, and W. F. Smyth, How many runs can a string contain?, Theoretical Computer Science, vol.401, issue.1-3, 2007.
DOI : 10.1016/j.tcs.2008.04.020

W. Rytter, The Number of Runs in a String: Improved Analysis of the Linear Upper Bound, STACS, pp.184-195, 2006.
DOI : 10.1007/11672142_14

W. Rytter, The number of runs in a string, Information and Computation, vol.205, issue.9, pp.1459-14691, 1906.
DOI : 10.1016/j.ic.2007.01.007
URL : https://hal.archives-ouvertes.fr/hal-00742037