The following pages link to (Q4820869):
Displaying 7 items.
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Fast, practical algorithms for computing all the repeats in a string (Q626893) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Longest repeats with a block of \(k\) don't cares (Q2508981) (← links)
- The geometric properties of an infinitary line and plane languages (Q5036684) (← links)