Not So Many Runs in Strings
From MaRDI portal
Publication:3540112
DOI10.1007/978-3-540-88282-4_22zbMATH Open1156.68511OpenAlexW1529898278MaRDI QIDQ3540112FDOQ3540112
Authors: Mathieu Giraud 
Publication date: 20 November 2008
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_22
Recommendations
Cites Work
Cited In (29)
- The total run length of a word
- Title not available (Why is that?)
- On the maximal sum of exponents of runs in a string
- The ``runs conjecture
- The maximal number of cubic runs in a word
- Average value of sum of exponents of runs in a string
- Some results on the number of periodic factors in words
- Computing regularities in strings: a survey
- Bounds on Powers in Strings
- Prefix frequency of lost positions
- On the average number of regularities in a word
- Lower bounds for the number of repetitions in 2D strings
- A computational framework for determining run-maximal strings
- On the structure of run-maximal strings
- The three squares lemma revisited
- Repetitions in strings: algorithms and combinatorics
- On primary and secondary repetitions in words
- Computing primitively-rooted squares and runs in partial words
- Asymptotic behavior of the numbers of runs and microruns
- A Series of Run-Rich Strings
- A different proof of the Crochemore-Ilie lemma concerning microruns
- The ``runs theorem
- Towards a Solution to the “Runs” Conjecture
- AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
- The number of runs in a string
- On the maximum number of cubic subwords in a word
- 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: Not So Many Runs in Strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540112)
