Maxime Crochemore

Maxime Crochemore
Born (1947-10-25) October 25, 1947
Fécamp, France
Residence  France
 United Kingdom
Citizenship  France
Alma mater University of Rouen
Scientific career
Fields String algorithms, automata theory
Institutions King's College London
Paris Diderot University
University of Marne-la-Vallée
Paris 13 University
Doctoral advisor Dominique Perrin

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

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.

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

Research contributions

Crochemore published over 100 journal papers on string algorithms. He in particular introduced new algorithms for pattern matching,[3] string indexing[4] and text compression.[5] 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),[6] "Jewels of Stringology" (2002, jointly with Wojciech Rytter),[7] and "Algorithms on Strings" (2007, jointly with Christophe Hancart and Thierry Lecroq).[8]

References

  1. ↑ "Professor Maxime Crochemore conferred Doctor Honoris Causa | Department of Computer Science". cs.helsinki.fi. Retrieved 2017-03-26.
  2. ↑ 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.
  3. ↑ 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.
  4. ↑ Clément, Julien; Crochemore, Maxime; Rindone, Giuseppina. Reverse Engineering Prefix Tables. doi:10.4230/LIPIcs.STACS.2009.1825.
  5. ↑ Crochemore, M.; Mignosi, F.; Restivo, A.; Salemi, S. (1999). "Text Compression Using Antidictionaries". Lecture Notes in Computer Science. 1644: 261–270. doi:10.1007/3-540-48523-6_23. ISBN 978-3-540-66224-2. ISSN 0302-9743.
  6. ↑ Crochemore, Maxime; Rytter, Wojciech (1994). Text Algorithms. Oxford University Press. ISBN 978-0-195-08609-6.
  7. ↑ Crochemore, Maxime; Rytter, Wojciech (2002). Jewels of Stringology. World Scientific. ISBN 978-9-810-24782-9.
  8. ↑ Crochemore, Maxime; Hancart, Christophe; Lecroq, Thierry (2007). Algorithms on Strings. Cambridge University Press. ISBN 978-0-521-84899-2.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.