The following pages link to Maxime Crochemore (Q200906):
Displaying 50 items.
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- Automata and forbidden words (Q293331) (← links)
- Order-preserving indexing (Q294954) (← links)
- Linear-size suffix tries (Q294967) (← links)
- (Q389937) (redirect page) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- Improved algorithms for the range next value problem and applications (Q428870) (← links)
- Using minimal absent words to build phylogeny (Q442159) (← links)
- On the maximal sum of exponents of runs in a string (Q450542) (← links)
- Dictionary-symbolwise flexible parsing (Q450551) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- On the density of Lyndon roots in factors (Q507403) (← links)
- Efficient computation of maximal anti-exponent in palindrome-free strings (Q507406) (← links)
- The ``runs'' conjecture (Q544875) (← links)
- Two-dimensional pattern matching by sampling (Q685522) (← links)
- Reactive automata (Q716325) (← links)
- Counting maximal-exponent factors in words (Q728262) (← links)
- On the parallel recognition of unambiguous context-free languages (Q808269) (← links)
- From Nerode's congruence to suffix automata with mismatches (Q840766) (← links)
- A unifying look at the Apostolico--Giancarlo string-matching algorithm (Q876692) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- Parallel construction of minimal suffix and factor automata (Q911778) (← links)
- Maximal repetitions in strings (Q931723) (← links)
- Approximating the 2-interval pattern problem (Q932323) (← links)
- Computing longest previous factor in linear time and applications (Q963336) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- Waiting time and complexity for matching patterns with automata (Q1014407) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Thue-Morse sequence and p-adic topology for the free monoid (Q1121888) (← links)
- An optimal algorithm for computing the repetitions in a word (Q1155963) (← links)
- (Q1162826) (redirect page) (← links)
- Sharp characterizations of squarefree morphisms (Q1162827) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198) (← links)
- Optimal canonization of all substrings of a string (Q1183603) (← links)
- String-matching on ordered alphabets (Q1190451) (← links)
- A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) (Q1190459) (← links)
- Constant-space string-matching in sublinear average time (Q1292492) (← links)
- On two-dimensional pattern matching by optimal parallel algorithms (Q1334677) (← links)
- Speeding up two string-matching algorithms (Q1336956) (← links)
- Two-dimensional prefix string matching and covering on square matrices (Q1386343) (← links)
- Fast practical multi-pattern matching (Q1606976) (← links)
- A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Minimal absent words in a sliding window and applications to on-line pattern matching (Q1679968) (← links)
- Longest previous non-overlapping factors table computation (Q1708645) (← links)
- The maximal number of cubic runs in a word (Q1757839) (← links)
