A. Apostolico and F. 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, A simple proof that the number of runs in a word is linear, manuscript, 2006.

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

A. S. Fraenkel and J. Simpson, How Many Squares Can a String Contain?, Journal of Combinatorial Theory, Series A, vol.82, issue.1, pp.82-112, 1998.
DOI : 10.1006/jcta.1997.2843
URL : http://doi.org/10.1006/jcta.1997.2843

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.

L. Ilie, A simple proof that a word of length n has at most <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:math> distinct squares, Journal of Combinatorial Theory, Series A, vol.112, issue.1, pp.163-164, 2005.
DOI : 10.1016/j.jcta.2005.01.006

L. Ilie, A note on the number of squares in a word, Theoretical Computer Science, vol.380, issue.3, pp.373-376, 2007.
DOI : 10.1016/j.tcs.2007.03.025

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, On the sum of exponents of maximal repetitions in a word, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00098792

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. Discrete 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

M. Lothaire, Algebraic Combinatorics on Words, 2002.
DOI : 10.1017/CBO9781107326019
URL : https://hal.archives-ouvertes.fr/hal-00620608

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

S. J. Puglisi, J. Simpson, and B. Smyth, How many runs can a string contain?, submitted, 2006.

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

W. Rytter, The number of runs in a string, submitted, 2006.

J. Stoye and D. Gusfield, Simple and flexible detection of contiguous repeats using a suffix tree, Proc. of the 9th CPM, pp.140-152, 1448.
DOI : 10.1016/S0304-3975(01)00121-9