AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
From MaRDI portal
Publication:3532151
DOI10.1142/S0129054108005620zbMATH Open1169.68563OpenAlexW2003022262MaRDI QIDQ3532151FDOQ3532151
Publication date: 3 November 2008
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054108005620
Cites Work
Cited In (19)
- Title not available (Why is that?)
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
- On the maximal sum of exponents of runs in a string
- Title not available (Why is that?)
- How many runs can a string contain?
- The maximal number of cubic runs in a word
- Prefix frequency of lost positions
- On the average number of regularities in a word
- Lower bounds for the number of repetitions in 2D strings
- The “Runs” Theorem
- On the structure of run-maximal strings
- Repetitions in strings: algorithms and combinatorics
- On primary and secondary repetitions in words
- Computing primitively-rooted squares and runs in partial words
- Computing the number of cubic runs in standard Sturmian words
- The number of q-ary words with restrictions on the length of the maximal run
- Three overlapping squares: the general case characterized \& applications
- Bannai et al. method proves the \(d\)-step conjecture for strings
- On the Maximal Sum of Exponents of Runsin a String
This page was built for publication: AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3532151)
