More results on overlapping squares
From MaRDI portal
Publication:2376782
DOI10.1016/J.JDA.2012.03.003zbMATH Open1281.68169OpenAlexW1992800733MaRDI QIDQ2376782FDOQ2376782
Authors: Frantisek Franek, Robert Fullér, W. F. Smyth, Jamie Simpson
Publication date: 24 June 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.03.003
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorics on words (68R15) Algorithms on strings (68W32)
Cites Work
- Title not available (Why is that?)
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- Uniqueness Theorems for Periodic Functions
- Squares, cubes, and time-space efficient string searching
- An O(n log n) algorithm for finding all repetitions in a string
- Intersecting periodic words
- The three squares lemma revisited
- A New Periodicity Lemma
- Detecting leftmost maximal periodicities
- Fast and Practical Algorithms for Computing All the Runs in a String
Cited In (7)
- Constructing words with high distinct square densities
- Computing regularities in strings: a survey
- Distinct squares in circular words
- The new periodicity lemma revisited
- Large-scale detection of repetitions
- How many double squares can a string contain?
- Three overlapping squares: the general case characterized \& applications
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)