Bounds on Powers in Strings
From MaRDI portal
Publication:3533012
DOI10.1007/978-3-540-85780-8_16zbMATH Open1159.68014OpenAlexW1706995980MaRDI QIDQ3533012FDOQ3533012
Authors: Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera 
Publication date: 30 October 2008
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_16
Recommendations
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
- Squares, cubes, and time-space efficient string searching
- An O(n log n) algorithm for finding all repetitions in a string
- Detecting leftmost maximal periodicities
- Not So Many Runs in Strings
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
- How many runs can a string contain?
- A characterization of the squares in a Fibonacci string
- The number of runs in a string
- Analysis of Maximal Repetitions in Strings
Cited In (8)
- New simple efficient algorithms computing powers and runs in strings
- String powers in trees
- On the average number of regularities in a word
- A note on the maximum number of \(k\)-powers in a finite word
- Repetitions in strings: algorithms and combinatorics
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS
- On string replacement exponentiation
- String Powers in Trees
This page was built for publication: Bounds on Powers in Strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533012)
