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

H. Barcelo, On the action of the symmetric group on the Free Lie Algebra and the partition lattice, Journal of Combinatorial Theory, Series A, vol.55, issue.1, pp.93-129, 1990.
DOI : 10.1016/0097-3165(90)90050-7

G. S. Brodal and R. Fagerberg, Dynamic Representations of Sparse Graphs, Algorithms and Data Structures, WADS 1999, pp.342-351, 1999.
DOI : 10.1007/3-540-48447-7_34

URL : http://www.brics.dk/~gerth/Papers/wads99.ps.gz

M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings, 2007.
DOI : 10.1017/CBO9780511546853

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

M. Crochemore and L. Ilie, Analysis of Maximal Repetitions in Strings, Mathematical Foundations of Computer Science, MFCS 2007, pp.465-476, 2007.
DOI : 10.1007/978-3-540-74456-6_42

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

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, Towards a Solution to the ???Runs??? Conjecture, Combinatorial Pattern Matching, CPM 2008, pp.290-302, 2008.
DOI : 10.1007/978-3-540-69068-9_27

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

M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter et al., Extracting powers and periods in a word from its runs structure, Theoretical Computer Science, vol.521, pp.29-41, 2014.
DOI : 10.1016/j.tcs.2013.11.018

J. Fischer, S. Holub, I. , T. Lewenstein, and M. , Beyond the Runs Theorem, String Processing and Information Retrieval, SPIRE 2015, pp.277-286, 2015.
DOI : 10.1007/978-3-319-23826-5_27

P. Gawrychowski, T. Kociumaka, W. Rytter, and T. Wale?, Faster longest common extension queries in strings over general alphabets, Combinatorial Pattern Matching, CPM 2016. LIPIcs, Schloss Dagstuhl? Leibniz-Zentrum für Informatik, 2016.

M. Giraud, Not so many runs in strings Language and Automata Theory and Applications, LATA 2008, pp.232-239, 2008.
DOI : 10.1007/978-3-540-88282-4_22

C. Hohlweg and C. Reutenauer, Lyndon words, permutations and trees, Theoretical Computer Science, vol.307, issue.1, pp.173-178, 2003.
DOI : 10.1016/S0304-3975(03)00099-9

URL : https://doi.org/10.1016/s0304-3975(03)00099-9

T. Kociumaka, J. Radoszewski, W. Rytter, and T. Wale?, Internal Pattern Matching Queries in a Text and Applications, 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.532-551, 2015.
DOI : 10.1137/1.9781611973730.36

URL : http://arxiv.org/pdf/1311.6235.pdf

R. M. 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. M. Kolpakov and G. Kucherov, On maximal repetitions in words, In: Journal of Discrete Algorithms, Special Issue of Matching Patterns, pp.159-186, 2000.
DOI : 10.1007/3-540-48321-7_31

URL : https://hal.archives-ouvertes.fr/inria-00099092

D. Kosolobov, Computing runs on a general alphabet, Information Processing Letters, vol.116, issue.3, pp.241-244, 2016.
DOI : 10.1016/j.ipl.2015.11.016

URL : http://arxiv.org/pdf/1507.01231

C. S. Nash-williams, Decomposition of Finite Graphs Into Forests, Journal of the London Mathematical Society, vol.1, issue.1, p.12, 1964.
DOI : 10.1112/jlms/s1-39.1.12

S. J. Puglisi, J. Simpson, and W. F. Smyth, How many runs can a string contain? Theor, Comput. Sci, vol.401, pp.1-3, 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, Symposium on Theoretical Aspects of Computer Science STACS 2006, 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