The following pages link to (Q4934345):
Displaying 24 items.
- On del-robust primitive words (Q277635) (← links)
- A computational framework for determining run-maximal strings (Q396644) (← links)
- The three squares lemma revisited (Q414439) (← links)
- On the maximal sum of exponents of runs in a string (Q450542) (← links)
- Computing the number of cubic runs in standard Sturmian words (Q496558) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Space efficient search for maximal repetitions (Q557913) (← links)
- Maximal repetitions in strings (Q931723) (← links)
- How many runs can a string contain? (Q935160) (← links)
- On maximal repetitions of arbitrary exponent (Q991771) (← links)
- Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- On the maximum number of cubic subwords in a word (Q1761496) (← links)
- Computing the maximum exponent in a stream (Q2118207) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- Prefix frequency of lost positions (Q2358696) (← links)
- More results on overlapping squares (Q2376782) (← links)
- On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)
- Simple and flexible detection of contiguous repeats using a suffix tree (Q5958334) (← links)
