H. Bannai, T. I. , S. Inenaga, Y. Nakashima, M. Takeda et al., A new characterization of maximal repetitions by Lyndon trees, 26th SODA, pp.562-571, 2015.
DOI : 10.1137/1.9781611973730.38

H. Bannai, T. I. , S. Inenaga, Y. Nakashima, M. Takeda et al., The " runs " theorem. CoRR, abs, 1406.
DOI : 10.1137/15m1011032

M. Crochemore, Repeats in strings. Keynote talk at the 25th CPM, 2014.

M. Crochemore and L. Ilie, Maximal repetitions in strings, Journal of Computer and System Sciences, vol.74, issue.5, pp.796-807, 2008.
DOI : 10.1016/j.jcss.2007.09.003

URL : https://hal.archives-ouvertes.fr/hal-00619712

M. Crochemore, L. Ilie, and L. Tinta, The ???runs??? conjecture, Theoretical Computer Science, vol.412, issue.27, pp.2931-2941, 2011.
DOI : 10.1016/j.tcs.2010.06.019

URL : https://hal.archives-ouvertes.fr/hal-00742052

M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter et al., The maximal number of cubic runs in a word, Journal of Computer and System Sciences, vol.78, issue.6, pp.1828-1836, 2012.
DOI : 10.1016/j.jcss.2011.12.005

URL : https://hal.archives-ouvertes.fr/hal-00836960

M. Crochemore and D. Perrin, Two-way string-matching, Journal of the ACM, vol.38, issue.3, pp.651-675, 1991.
DOI : 10.1145/116825.116845

URL : https://hal.archives-ouvertes.fr/hal-00619582

A. Deza and F. Franek, -step approach to the maximum number of distinct squares and runs in strings, Discrete Applied Mathematics, vol.163, issue.3, pp.268-274, 2014.
DOI : 10.1016/j.dam.2013.10.021

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

M. Lothaire, Combinatorics on Words, 1997.
DOI : 10.1017/CBO9780511566097

URL : https://hal.archives-ouvertes.fr/hal-00620609

S. J. Puglisi, J. Simpson, and W. F. Smyth, How many runs can a string contain? Theoretical Computer Science, pp.165-171, 2008.
DOI : 10.1016/j.tcs.2008.04.020

URL : https://doi.org/10.1016/j.tcs.2008.04.020

W. Rytter, The Number of Runs in a String: Improved Analysis of the Linear Upper Bound, 23rd STACS, pp.184-195, 2006.
DOI : 10.1016/S0304-3975(00)00067-0

W. Rytter, The number of runs in a string, Information and Computation, vol.205, issue.9, pp.1459-1469, 2007.
DOI : 10.1016/j.ic.2007.01.007

URL : https://hal.archives-ouvertes.fr/hal-00742037