Space efficient search for maximal repetitions

Leszek Ga̧sieniec, Roman Kolpakov, Igor Potapov

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


We study here a problem of finding all maximal repetitions in a string of length n. We show that the problem can be solved in time O(nlogn) in the presence of constant extra space and general (unbounded) alphabets. Subsequently we show that in the model with a constant size alphabet the problem can be solved in time O(n) with a help of o(n) extra space. Previously best known algorithms require linear additional space in both models.

Original languageEnglish (US)
Pages (from-to)35-48
Number of pages14
JournalTheoretical Computer Science
Issue number1
StatePublished - Jun 11 2005
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Space efficient search for maximal repetitions'. Together they form a unique fingerprint.

Cite this