Detecting leftmost maximal periodicities
Discrete Applied Mathematics - Combinatorics and complexity
How many squares can a string contain?
Journal of Combinatorial Theory Series A
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Finding Maximal Repetitions in a Word in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
A simple proof that a word of length n has at most 2n distinct squares
Journal of Combinatorial Theory Series A
A note on the number of squares in a word
Theoretical Computer Science
The number of runs in a string: improved analysis of the linear upper bound
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
How many runs can a string contain?
Theoretical Computer Science
Towards a Solution to the "Runs" Conjecture
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Language and Automata Theory and Applications
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Asymptotic behavior of the numbers of runs and microruns
Information and Computation
Repetitions in strings: Algorithms and combinatorics
Theoretical Computer Science
Inclusion problems in trace monoids
Cybernetics and Systems Analysis
Distinct squares in run-length encoded strings
Theoretical Computer Science
Theoretical Computer Science
On the maximal sum of exponents of runs in a string
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Hunting redundancies in strings
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On the structure of run-maximal strings
Journal of Discrete Algorithms
On primary and secondary repetitions in words
Theoretical Computer Science
The three squares lemma revisited
Journal of Discrete Algorithms
On the maximal number of cubic runs in a string
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
On the maximal sum of exponents of runs in a string
Journal of Discrete Algorithms
The maximal number of cubic runs in a word
Journal of Computer and System Sciences
A comparison of index-based lempel-Ziv LZ77 factorization algorithms
ACM Computing Surveys (CSUR)
On the maximum number of cubic subwords in a word
European Journal of Combinatorics
Computing regularities in strings: A survey
European Journal of Combinatorics
Computing the maximal-exponent repeats of an overlap-free string in linear time
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
A computational framework for determining run-maximal strings
Journal of Discrete Algorithms
The total run length of a word
Theoretical Computer Science
| Hi-index | 0.01 |
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the most important part of the analysis of the running time of such algorithms is counting the number of runs. Kolpakov and Kucherov [R. Kolpakov, G. Kucherov, Finding maximal repetitions in a word in linear time, in: Proc. of FOCS'99, IEEE Computer Society Press, 1999, pp. 596-604] proved it to be cn but could not provide any value for c. Recently, Rytter [W. Rytter, The number of runs in a string: Improved analysis of the linear upper bound, in: B. Durand, W. Thomas (Eds.), Proc. of STACS'06, in: Lecture Notes in Comput. Sci., vol. 3884, Springer, Berlin, Heidelberg, 2006, pp. 184-195] proved that c=