Pages that link to "Item:Q1170893"
From MaRDI portal
The following pages link to Optimal off-line detection of repetitions in a string (Q1170893):
Displaying 50 items.
- Improved linear systolic algorithms for substring statistics (Q287010) (← links)
- The three squares lemma revisited (Q414439) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Efficient detection of quasiperiodicities in strings (Q688155) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- Optimal superprimitivity testing for strings (Q811134) (← links)
- A fast algorithm for finding the positions of all squares in a run-length encoded string (Q837185) (← links)
- An efficient algorithm for online square detection (Q860815) (← links)
- Maximal repetitions in strings (Q931723) (← links)
- Periodicity and repetitions in parameterized strings (Q947077) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- The smallest automaton recognizing the subwords of a text (Q1063423) (← links)
- Structural properties of the string statistics problem (Q1076522) (← links)
- Parallel construction of a suffix tree with applications (Q1104104) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198) (← links)
- Optimal parallel detection of squares in strings (Q1194333) (← links)
- String matching problems over free partially commutative monoids (Q1207940) (← links)
- Quasiperiodicity and string covering (Q1292493) (← links)
- A characterization of the squares in a Fibonacci string (Q1392029) (← links)
- Fibonacci arrays and their two-dimensional repetitions (Q1566729) (← links)
- Normal forms of quasiperiodic strings (Q1583537) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- On the maximum number of cubic subwords in a word (Q1761496) (← links)
- Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295) (← links)
- Transducers and repetitions (Q1820587) (← links)
- Detecting leftmost maximal periodicities (Q1825029) (← links)
- A linear time lower bound on McCreight and general updating algorithms for suffix trees (Q1879368) (← links)
- Speeding up the detection of evolutive tandem repeats (Q1884977) (← links)
- Detecting morphic images of a word: On the rank of a pattern (Q1899100) (← links)
- Data structures and algorithms for the string statistics problem (Q1913702) (← links)
- Covering a string (Q1924404) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Squares and primitivity in partial words (Q2341712) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- More results on overlapping squares (Q2376782) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
- Optimal discovery of repetitions in 2D (Q2573235) (← links)
- On shuffled-square-free words (Q2680851) (← links)
- Most pseudo-copy languages are not context-free (Q2695285) (← links)
- ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS (Q2909197) (← links)
- Computing Primitively-Rooted Squares and Runs in Partial Words (Q2946044) (← links)
- Large-scale detection of repetitions (Q2955637) (← links)
- (Q3332275) (← links)
- ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS (Q3434282) (← links)
- Optimal Parallel Searching an Array for Certain Repetitions (Q3438903) (← links)
