Maxime Crochemore

Maxime Crochemore
Born (1947-10-25) October 25, 1947 (age 77)
Fécamp, France
Citizenship France
Alma materUniversity of Rouen
Scientific career
FieldsString algorithms, automata theory
InstitutionsKing's College London
Paris Diderot University
University of Marne-la-Vallée
Paris 13 University
Doctoral advisorDominique Perrin[1]
Doctoral studentsMarie-France Sagot[1]

Maxime Crochemore (born 1947) is a French computer scientist known for his numerous contributions to algorithms on strings. He is currently[when?] a professor at King's College London.[2][3][1]

Biography

Crochemore earned his doctorate (PhD) in 1978 and his Doctorat d'état (DSc) in 1983 from the University of Rouen. He was a professor at Paris 13 University in 1985–1989, and moved to a professorship at Paris Diderot University in 1989. In 2002–2007, Crochemore was a senior research fellow at King's College London, where he is a professor since 2007. Since 2007, he is also a professor emeritus at the University of Marne-la-Vallée.[citation needed]

Crochemore holds an honorary doctorate (2014) from the University of Helsinki.[4] A festschrift in his honour was published in 2009 as a special issue of Theoretical Computer Science.[5]

Research contributions

Crochemore published over 100 journal papers on string algorithms. He in particular introduced new algorithms for pattern matching,[6] string indexing[7] and text compression.[8] His work received a significant number of academic citations.

Crochemore has co-authored three well-known scientific monographs on the design of algorithms for string processing: "Text Algorithms" (1994; jointly with Wojciech Rytter),[9] "Jewels of Stringology" (2002, jointly with Wojciech Rytter),[10] and "Algorithms on Strings" (2007, jointly with Christophe Hancart and Thierry Lecroq).[11]

References

  1. ^ a b c Maxime Crochemore at the Mathematics Genealogy Project Edit this at Wikidata
  2. ^ Official website Edit this at Wikidata
  3. ^ Maxime Crochemore at DBLP Bibliography Server Edit this at Wikidata
  4. ^ "Professor Maxime Crochemore conferred Doctor Honoris Causa | Department of Computer Science". cs.helsinki.fi. Retrieved 2017-03-26.
  5. ^ Iliopoulos, Costas; Rytter, Wojciech (2009). "Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore". Theoretical Computer Science. 410 (43): 4293–4294. doi:10.1016/j.tcs.2009.07.012. ISSN 0304-3975.
  6. ^ Crochemore, M.; Czumaj, A.; Gasieniec, L.; Jarominek, S.; Lecroq, T.; Plandowski, W.; Rytter, W. (1994). "Speeding up two string-matching algorithms". Algorithmica. 12 (4–5): 247–267. doi:10.1007/BF01185427. ISSN 0178-4617. S2CID 2170630.
  7. ^ Clément, Julien; Crochemore, Maxime; Rindone, Giuseppina (2009). Reverse Engineering Prefix Tables. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.STACS.2009.1825.
  8. ^ Crochemore, M.; Mignosi, F.; Restivo, A.; Salemi, S. (1999). Text Compression Using Antidictionaries. Lecture Notes in Computer Science. Vol. 1644. pp. 261–270. CiteSeerX 10.1.1.56.5248. doi:10.1007/3-540-48523-6_23. ISBN 978-3-540-66224-2. ISSN 0302-9743.
  9. ^ Crochemore, Maxime; Rytter, Wojciech (1994). Text Algorithms. Oxford University Press. ISBN 978-0-195-08609-6.
  10. ^ Crochemore, Maxime; Rytter, Wojciech (2002). Jewels of Stringology. World Scientific. ISBN 978-9-810-24782-9.
  11. ^ Crochemore, Maxime; Hancart, Christophe; Lecroq, Thierry (2007). Algorithms on Strings. Cambridge University Press. ISBN 978-0-521-84899-2.