B. Chazelle, A Functional Approach to Data Structures and Its Use in Multidimensional Searching, SIAM Journal on Computing, vol.17, issue.3, pp.427-462, 1988.
DOI : 10.1137/0217026

G. Chen, S. J. Puglisi, and W. F. Smyth, Fast and Practical Algorithms for Computing All the Runs in a String, Lecture Notes in Computer Science, vol.4580, pp.307-315, 2007.
DOI : 10.1007/978-3-540-73437-6_31

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, L. Ilie, and W. Rytter, Repetitions in strings: Algorithms and combinatorics, Theoretical Computer Science, vol.410, issue.50, pp.5227-5235, 2009.
DOI : 10.1016/j.tcs.2009.08.024

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

M. Crochemore and W. Rytter, Jewels of Stringology, World Scientific, 2003.
DOI : 10.1142/4838

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

J. Duval, R. Kolpakov, G. Kucherov, T. Lecroq, and A. Lefebvre, Linear-time computation of local periods, Theor. Comput. Sci, vol.326, pp.1-3229, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00099598

J. Fischer and V. Heun, A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array, Lecture Notes in Computer Science, vol.4614, pp.459-470, 2007.
DOI : 10.1007/978-3-540-74450-4_41

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

H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.246-251, 1983.
DOI : 10.1145/800061.808753

D. Gusfield and J. Stoye, Linear time algorithms for finding and representing all the tandem repeats in a string, Journal of Computer and System Sciences, vol.69, issue.4, pp.525-546, 2004.
DOI : 10.1016/j.jcss.2004.03.004

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

R. M. Kolpakov and G. Kucherov, On maximal repetitions in words, J. of Discr. Alg, vol.1, pp.159-186, 1999.
DOI : 10.1007/3-540-48321-7_31

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

M. Kubica, J. Radoszewski, W. Rytter, and T. Walen, On the Maximal Number of Cubic Subwords in a String, Lecture Notes in Computer Science, vol.5874, pp.345-355, 2009.
DOI : 10.1007/978-3-642-10217-2_34

K. Sadakane, Succinct data structures for flexible text retrieval systems, Journal of Discrete Algorithms, vol.5, issue.1, pp.12-22, 2007.
DOI : 10.1016/j.jda.2006.03.011

URL : http://doi.org/10.1016/j.jda.2006.03.011