Pages that link to "Item:Q3506932"
From MaRDI portal
The following pages link to Fast and Practical Algorithms for Computing All the Runs in a String (Q3506932):
Displaying 16 items.
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- The three squares lemma revisited (Q414439) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- Computing longest previous factor in linear time and applications (Q963336) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Faster online computation of the succinct longest previous factor array (Q2106621) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- More results on overlapping squares (Q2376782) (← links)
- Speeding up the detection of tandem repeats over the edit distance (Q2437752) (← links)
- Faster semi-external suffix sorting (Q2445902) (← links)
- An Online Algorithm for Finding the Longest Previous Factors (Q3541131) (← links)
- The “Runs” Theorem (Q5359492) (← links)
