-
Maxime Crochemore (born 1947) is a
French computer scientist known for his
numerous contributions to
algorithms on strings. He is currently[when?] a professor...
-
acyclic word graphs, and
factor automata (Allauzen,
Crochemore, Raffinot, 1999). In 1999, Allauzen,
Crochemore, and Raffinot,
presented the
factor oracle algorithm...
-
Schloss Dagstuhl. doi:10.4230/LIPIcs.CPM.2022.20. Here:
Theorem 1, p.20:2.
Crochemore &
Rytter (1991), Apostolico,
Breslauer &
Galil (1995).
Palindrome tree...
- 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”...
- 1609–1616. doi:10.1093/bioinformatics/btp275. PMC 2732316. PMID 19389736.
Crochemore, Maxime; Perrin,
Dominique (1 July 1991). "Two-way string-matching" (PDF)...
- 1007/s00018-008-8265-1. PMC 11131741. PMID 18791850. S2CID 29569626.
Crochemore, Maxime; Rytter,
Wojciech (2003), "8.1
Searching for
symmetric words"...
- Revisited". SIAM
Journal on Computing. 15: 98–105. doi:10.1137/0215007.
Crochemore, Maxime; Lecroq,
Thierry (1997). "Tight
bounds on the
complexity of the...
-
pattern matching in
strings and
related problems. It was
written by
Maxime Crochemore and
Wojciech Rytter, and
published by
World Scientific in 2003. The first...
- 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...
-
invented the
terms 'stringology,'
which is a
subfield of
string algorithms,
Crochemore,
Maxime (2002).
Jewels of stringology. Singapore. p. v. ISBN 981-02-4782-6...
