-
Maxime Crochemore (born 1947) is a
French computer scientist known for his
numerous contributions to
algorithms on strings. He is currently[when?] a professor...
-
Schloss Dagstuhl. doi:10.4230/LIPIcs.CPM.2022.20. Here:
Theorem 1, p.20:2.
Crochemore &
Rytter (1991), Apostolico,
Breslauer &
Galil (1995).
Palindrome tree...
- 1007/s00018-008-8265-1. PMC 11131741. PMID 18791850. S2CID 29569626.
Crochemore, Maxime; Rytter,
Wojciech (2003), "8.1
Searching for
symmetric words"...
- 1609–1616. doi:10.1093/bioinformatics/btp275. PMC 2732316. PMID 19389736.
Crochemore, Maxime; Perrin,
Dominique (1 July 1991). "Two-way string-matching" (PDF)...
- string-matching
algorithm is a string-searching algorithm,
discovered by
Maxime Crochemore and
Dominique Perrin in 1991. It
takes a
pattern of size m,
called a “needle”...
- Jean-Eric Pin, "Syntactic semigroups",
Chapter 10 in Vol. 1, pp. 679–746 M.
Crochemore and C. Hancart, "Automata for
matching patterns",
Chapter 9 in Vol. 2...
-
acyclic word graphs, and
factor automata (Allauzen,
Crochemore, Raffinot, 1999). In 1999, Allauzen,
Crochemore, and Raffinot,
presented the
factor oracle algorithm...
-
Archived from the
original on 14
February 2022.
Retrieved 17
April 2022.
Crochemore, Maxime; Lecroq,
Thierry (2009). "Trie".
Encyclopedia of
Database Systems...
- Revisited". SIAM
Journal on Computing. 15: 98–105. doi:10.1137/0215007.
Crochemore, Maxime; Lecroq,
Thierry (1997). "Tight
bounds on the
complexity of the...
- 1175–1202, doi:10.1007/s00224-017-9803-8, hdl:10012/12499, S2CID 2238325
Crochemore, Maxime; et al. (2009), "From Nerode's
congruence to
suffix automata with...
