Pages that link to "Item:Q1170893"
From MaRDI portal
The following pages link to Optimal off-line detection of repetitions in a string (Q1170893):
Displayed 16 items.
- Bounds on Powers in Strings (Q3533012) (← links)
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS (Q3586403) (← links)
- Un réseau linéaire pour la reconnaissance des mots sans carré (Q3789096) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Detecting the morphic images of a word : improving the general algorithm (Q4348237) (← links)
- Algorithms For Computing Approximate Repetitions In Musical Sequences (Q4780537) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- Repetition Detection in a Dynamic String (Q5075738) (← links)
- Optimal parallel algorithms for periods, palindromes and squares (Q5204325) (← links)
- Generalized approximate regularities in strings (Q5451457) (← links)
- WORD COMPLEXITY AND REPETITIONS IN WORDS (Q5696964) (← links)
- Optimal parallel suffix tree construction (Q5906825) (← links)
- Range LCP (Q5920340) (← links)
- Approximate periods of strings (Q5958136) (← links)
- Simple and flexible detection of contiguous repeats using a suffix tree (Q5958334) (← links)