Maxime Crochemore

Maxime Crochemore is a French computer scientist born in 1947 in Fécamp, France, who has made significant contributions to string algorithms and automata theory. His research has advanced the fields of pattern matching, string indexing, and text compression, with over 100 published journal papers to his name. After completing his doctorate at the University of Rouen in 1978 and his Doctorat d'état in 1983, Crochemore held professorships at several prestigious institutions. His academic career includes positions at Paris 13 University, Paris Diderot University, and King's College London, where he currently serves as a professor while maintaining emeritus status at the University of Marne-la-Vallée. The scientific community has recognized Crochemore's contributions through various honors, including an honorary doctorate from the University of Helsinki in 2014. A special issue of Theoretical Computer Science was published as a festschrift in his honor in 2009, highlighting his influence in the field of computer science.

There are limited public reader reviews available for Maxime Crochemore's works, as most are academic textbooks in computer science and algorithms. What readers liked: - Clear explanations of complex string algorithms and data structures - Practical examples that help illustrate theoretical concepts - Comprehensive coverage of pattern matching and text processing - Detailed pseudocode and implementation notes What readers disliked: - Dense mathematical notation that can be difficult to follow - Some translations from French contain awkward phrasing - High price point for textbooks - Limited worked examples in some chapters Ratings and Reviews: Goodreads: - Jewels of Stringology: 3.67/5 (3 ratings) - Text Algorithms: 4.0/5 (2 ratings) Amazon: - String Matching Algorithms: 3.5/5 (2 reviews) - Most titles have no customer reviews The small number of public reviews makes it difficult to draw broader conclusions about reader reception.

Jewels of Stringology (2002) A comprehensive textbook covering fundamental string algorithms and data structures, including pattern matching, text indexing, and string comparisons with detailed mathematical foundations and pseudocode implementations.

Text Algorithms (1994) A technical reference that systematically presents algorithms for text processing, covering topics from basic string manipulation to advanced pattern matching techniques.

Algorithmique du Texte (2001) A French-language text presenting core concepts and algorithms for text processing, pattern matching, and string analysis with practical applications.

Pattern Matching and Text Compression Algorithms (1997) A detailed examination of string pattern matching techniques and text compression methods, including theoretical foundations and practical implementations.

Donald Knuth developed fundamental algorithms and wrote the comprehensive "The Art of Computer Programming" series that covers similar algorithmic concepts. His work on pattern matching and string processing aligns with Crochemore's research interests.

Alfred Aho pioneered string matching algorithms and co-authored "The Design and Analysis of Computer Algorithms." His contributions to compiler design and string processing complement Crochemore's work in pattern matching.

Robert Tarjan created fundamental data structure algorithms and earned the Turing Award for his contributions to algorithm design. His work on efficient data structures intersects with Crochemore's research on text indexing and pattern matching.

Derick Wood focused on formal languages, automata theory, and text algorithms throughout his career. His research on string processing and text algorithms shares common ground with Crochemore's contributions to pattern matching.

Zvi Galil specialized in string matching and graph algorithms, developing efficient pattern matching techniques. His work on string algorithms and computational complexity directly relates to Crochemore's research areas.