More results on overlapping squares
From MaRDI portal
Publication:2376782
Recommendations
Cites work
- A New Periodicity Lemma
- An O(n log n) algorithm for finding all repetitions in a string
- An optimal algorithm for computing the repetitions in a word
- Detecting leftmost maximal periodicities
- Fast and Practical Algorithms for Computing All the Runs in a String
- scientific article; zbMATH DE number 1390079 (Why is no real title available?)
- Intersecting periodic words
- Optimal off-line detection of repetitions in a string
- Squares, cubes, and time-space efficient string searching
- The three squares lemma revisited
- Uniqueness Theorems for Periodic Functions
Cited in
(7)- Computing regularities in strings: a survey
- Three overlapping squares: the general case characterized \& applications
- Large-scale detection of repetitions
- The new periodicity lemma revisited
- How many double squares can a string contain?
- Constructing words with high distinct square densities
- Distinct squares in circular words
This page was built for publication: More results on overlapping squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376782)