@InProceedings{crochemore_et_al:LIPIcs.STACS.2008.1344,
  author =	{Crochemore, Maxime and Ilie, Lucian},
  title =	{{Understanding Maximal Repetitions in Strings}},
  booktitle =	{25th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{11--16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-06-4},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{1},
  editor =	{Albers, Susanne and Weil, Pascal},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1344},
  URN =		{urn:nbn:de:0030-drops-13442},
  doi =		{10.4230/LIPIcs.STACS.2008.1344},
  annote =	{Keywords: Combinatorics on words, repetitions in strings, runs, maximal repetitions, maximal periodicities, sum of exponents}
}