Détermination de la Représentation Standard d'une Série Reconnaissable. - A. Cardon; Maxime Crochemore (RAIRO Theor. Informatics Appl., 1980)

An Optimal Algorithm for Computing the Repetitions in a Word. - Maxime Crochemore (Inf. Process. Lett., 1981)

Partitioning a Graph in O(|A| log2 |V|). - A. Cardon; Maxime Crochemore (Theor. Comput. Sci., 1982)

Sharp Characterizations of Squarefree Morphisms. - Maxime Crochemore (Theor. Comput. Sci., 1982)

An Optimal Test on Finite Unavoidable Sets of Words. - Maxime Crochemore; Michael Le Rest; Philippe Wender (Inf. Process. Lett., 1983)

Linear Searching for a Squre in a Word (Abstract). - Maxime Crochemore (ICALP, 1984)

Computing LCF in linear time. - Maxime Crochemore (Bull. EATCS, 1986)

Calcul de La Distance Par Les Sous-Mots. - Jean-Jacques Hébrard; Maxime Crochemore (RAIRO Theor. Informatics Appl., 1986)

Transducers and Repetitions. - Maxime Crochemore (Theor. Comput. Sci., 1986)

Data Compression with Substitution. - Maxime Crochemore (Electronic Dictionaries and Automata in Computational Linguistics, 1987)

Longest Common Factor of Two Words. - Maxime Crochemore (TAPSOFT, Vol.1, 1987)

Constant-Space String-Matching. - Maxime Crochemore (FSTTCS, 1988)

Algorithms and automata. - Maxime Crochemore (Formal Properties of Finite Automata and Applications, 1988)

String Matching with Constraints. - Maxime Crochemore (MFCS, 1988)

Critical factorizations of words. - Maxime Crochemore; Dominique Perrin (Bull. EATCS, 1988)

Thue-Morse sequence and p-adic topology for the free monoid. - Jean Berstel; Maxime Crochemore; Jean-Eric Pin (Discret. Math., 1989)

String-matching and periods. - Maxime Crochemore (Bull. EATCS, 1989)

Unitary Monoid with Two Generators: An Algorithmic Point of View. - Maxime Crochemore; Jean Néraud (CAAP, 1990)

Parallel Computations on Strings and Arrays. - Maxime Crochemore; Wojciech Rytter (STACS, 1990)

Parallel Construction of Minimal Suffix and Factor Automata. - Maxime Crochemore; Wojciech Rytter (Inf. Process. Lett., 1990)

Mutually Avoiding Ternary Words of Small Exponent. - Maxime Crochemore; Pavel Goralcik (Int. J. Algebra Comput., 1991)

Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings. - Maxime Crochemore; Wojciech Rytter (Inf. Process. Lett., 1991)

Two-Way String Matching. - Maxime Crochemore; Dominique Perrin (J. ACM, 1991)

On the Parallel Recognition of Unambiguous Context-Free Languages. - Michal Chytil; Maxime Crochemore; Burkhard Monien; Wojciech Rytter (Theor. Comput. Sci., 1991)

Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays. - Maxime Crochemore; Wojciech Rytter (Theor. Comput. Sci., 1991)

Optimal Canonization of All Substrings of a String - Alberto Apostolico; Maxime Crochemore (Inf. Comput., 1991)

Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. - Maxime Crochemore; Wojciech Rytter (ICPIA, 1992)

String-Matching on Ordered Alphabets. - Maxime Crochemore (Theor. Comput. Sci., 1992)

A String-Matching Interpretation of the Equation xmyn = zp. - Jean Néraud; Maxime Crochemore (Theor. Comput. Sci., 1992)

Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions - Richard Cole 001; Maxime Crochemore; Zvi Galil; Leszek Gasieniec; Ramesh Hariharan; S. Muthukrishnan 001; Kunsoo Park; Wojciech Rytter (FOCS, 1993)

Two-Dimensional Pattern Matching by Sampling. - Maxime Crochemore; Leszek Gasieniec; Wojciech Rytter (Inf. Process. Lett., 1993)

Text Algorithms - Maxime Crochemore; Wojciech Rytter (Oxford University Press, 1994)

Speeding Up Two String-Matching Algorithms. - Maxime Crochemore; Artur Czumaj; Leszek Gasieniec; Stefan Jarominek; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (Algorithmica, 1994)

On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. - Maxime Crochemore; Wojciech Rytter (Theor. Comput. Sci., 1994)

On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. - Maxime Crochemore; Wojciech Rytter (LATIN, 1995)

Two-Dimensional Pattern Matching in Linear Time and Small Space. - Maxime Crochemore; Leszek Gasieniec; Wojciech Plandowski; Wojciech Rytter (STACS, 1995)

Squares, Cubes, and Time-Space Efficient String Searching. - Maxime Crochemore; Wojciech Rytter (Algorithmica, 1995)

Fast Parallel Lyndon Factorization with Applications. - Alberto Apostolico; Maxime Crochemore (Math. Syst. Theory, 1995)

Boyer-Moore Strategy to Efficient Approximate String Matching. - Nadia El-Mabrouk; Maxime Crochemore (CPM, 1996)

Pattern-Matching and Text-Compression Algorithms. - Maxime Crochemore; Thierry Lecroq (ACM Comput. Surv., 1996)

Pattern Matching and Text Compression Algorithms. - Maxime Crochemore; Thierry Lecroq (The Computer Science and Engineering Handbook, 1997)

Off-line serial exact string searching. - Maxime Crochemore (Pattern Matching Algorithms, 1997)

On Compact Directed Acyclic Word Graphs. - Maxime Crochemore; Renaud Vérin (Structures in Logic and Computer Science, 1997)

Direct Construction of Compact Directed Acyclic Word Graphs. - Maxime Crochemore; Renaud Vérin (CPM, 1997)

Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm. - Maxime Crochemore; Thierry Lecroq (Inf. Process. Lett., 1997)

Constant-Time Randomized Parallel String Matching. - Maxime Crochemore; Zvi Galil; Leszek Gasieniec; Kunsoo Park; Wojciech Rytter (SIAM J. Comput., 1997)

Automata for Matching Patterns. - Maxime Crochemore; Christophe Hancart (Handbook of Formal Languages (2), 1997)

Minimal Forbidden Words and Factor Automata. - Maxime Crochemore; Filippo Mignosi; Antonio Restivo (MFCS, 1998)

Two-Dimensional Prefix String Matching and Covering on Square Matrices. - Maxime Crochemore; Costas S. Iliopoulos; Maureen Korda (Algorithmica, 1998)

Automata and Forbidden Words. - Maxime Crochemore; Filippo Mignosi; Antonio Restivo (Inf. Process. Lett., 1998)

A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. - Maxime Crochemore; Leszek Gasieniec; Ramesh Hariharan; S. Muthukrishnan 001; Wojciech Rytter (SIAM J. Comput., 1998)

Pattern Matching in Strings. - Maxime Crochemore; Christophe Hancart (Algorithms and Theory of Computation Handbook, 1999)

Text Data Compression Algorithms. - Maxime Crochemore; Thierry Lecroq (Algorithms and Theory of Computation Handbook, 1999)

Text Compression Using Antidictionaries. - Maxime Crochemore; Filippo Mignosi; Antonio Restivo; Sergio Salemi (ICALP, 1999)

Factor Oracle: A New Structure for Pattern Matching. - Cyril Allauzen; Maxime Crochemore; Mathieu Raffinot (SOFSEM, 1999)

Zones of Low Entropy in Genomic Sequences. - Maxime Crochemore; Renaud Vérin (Comput. Chem., 1999)

Fast Practical Multi-Pattern Matching. - Maxime Crochemore; Artur Czumaj; Leszek Gasieniec; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (Inf. Process. Lett., 1999)

Constant-Space String-Matching in Sublinear Average Time. - Maxime Crochemore; Leszek Gasieniec; Wojciech Rytter (Theor. Comput. Sci., 1999)

Finding Motifs with Gaps. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón (ISMIR, 2000)

Fast Evolutionary Chains. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón (SOFSEM, 2000)

Data compression using antidictionaries. - Maxime Crochemore; Filippo Mignosi; Antonio Restivo; Sergio Salemi (Proc. IEEE, 2000)

Efficient Experimental String Matching by Weak Factor Recognition. - Cyril Allauzen; Maxime Crochemore; Mathieu Raffinot (CPM, 2001)

Approximate String Matching in Musical Sequences. - Maxime Crochemore; Costas S. Iliopoulos; Thierry Lecroq; Yoan J. Pinzón (Stringology, 2001)

Computing Evolutionary Chains in Musical Sequences. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón (Electron. J. Comb., 2001)

A fast and practical bit-vector algorithm for the Longest Common Subsequence problem. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón; James F. Reid (Inf. Process. Lett., 2001)

Jewels of stringology. - Maxime Crochemore; Wojciech Rytter (World Scientific, 2002)

Three Heuristics for delta-Matching: delta-BM Algorithms. - Maxime Crochemore; Costas S. Iliopoulos; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (CPM, 2002)

Improved Antidictionary Based Compression. - Maxime Crochemore; Gonzalo Navarro 001 (SCCC, 2002)

A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. - Maxime Crochemore; Gad M. Landau; Michal Ziv-Ukelson (SODA, 2002)

On the Size of DASG for Multiple Texts. - Maxime Crochemore; Zdenek Tronícek (SPIRE, 2002)

On the Implementation of Compact DAWG's. - Jan Holub 001; Maxime Crochemore (CIAA, 2002)

Algorithms for Computing Approximate Repetitions in Musical Sequences. - Emilios Cambouropoulos; Maxime Crochemore; Costas S. Iliopoulos; Laurent Mouchard; Yoan J. Pinzón (Int. J. Comput. Math., 2002)

Approximate String Matching with Gaps. - Maxime Crochemore; Costas S. Iliopoulos; Christos Makris 001; Wojciech Rytter; Athanasios K. Tsakalidis; Kostas Tsichlas (Nord. J. Comput., 2002)

A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. - Nadia Pisanti; Maxime Crochemore; Roberto Grossi; Marie-France Sagot (MFCS, 2003)

A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. - Maxime Crochemore; Costas S. Iliopoulos; Gonzalo Navarro 001; Yoan J. Pinzón (SPIRE, 2003)

Computing forbidden words of regular languages. - Marie-Pierre Béal; Maxime Crochemore; Filippo Mignosi; Antonio Restivo; Marinella Sciortino (Fundam. Informaticae, 2003)

Occurrence and Substring Heuristics for i-Matching. - Maxime Crochemore; Costas S. Iliopoulos; Thierry Lecroq (Fundam. Informaticae, 2003)

Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón (Fundam. Informaticae, 2003)

Waiting time and complexity for matching patterns with automata. - Maxime Crochemore; Valery T. Stefanov (Inf. Process. Lett., 2003)

A unifying look at the Apostolico-Giancarlo string-matching algorithm. - Maxime Crochemore; Christophe Hancart; Thierry Lecroq (J. Discrete Algorithms, 2003)

Directed acyclic subsequence graph - Overview. - Maxime Crochemore; Borivoj Melichar; Zdenek Tronícek (J. Discrete Algorithms, 2003)

A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices. - Maxime Crochemore; Gad M. Landau; Michal Ziv-Ukelson (SIAM J. Comput., 2003)

Reducing space for index implementation. - Maxime Crochemore (Theor. Comput. Sci., 2003)

A Trie-Based Approach for Compacting Automata. - Maxime Crochemore; Chiara Epifanio; Roberto Grossi; Filippo Mignosi (CPM, 2004)

Longest Repeats with a Block of Don't Cares. - Maxime Crochemore; Costas S. Iliopoulos; Manal Mohamed 001; Marie-France Sagot (LATIN, 2004)

Longest Motifs with a Functionally Equivalent Central Block. - Maxime Crochemore; Raffaele Giancarlo; Marie-France Sagot (SPIRE, 2004)

Two-dimensional pattern matching with rotations. - Amihood Amir; Ayelet Butman; Maxime Crochemore; Gad M. Landau; Malka Schaps (Theor. Comput. Sci., 2004)

Approximating the 2-Interval Pattern Problem. - Maxime Crochemore; Danny Hermelin; Gad M. Landau; Stéphane Vialette (ESA, 2005)

A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories. - Emilios Cambouropoulos; Maxime Crochemore; Costas S. Iliopoulos; Manal Mohamed 001; Marie-France Sagot (ISMIR, 2005)

A note on the Burrows-Wheeler transformation - Maxime Crochemore; Jacques Désarménien; Dominique Perrin (CoRR, 2005)

Foreword. - Ricardo A. Baeza-Yates; Maxime Crochemore (J. Discrete Algorithms, 2005)

Bit-parallel (delta, gamma)-matching and suffix automata. - Maxime Crochemore; Costas S. Iliopoulos; Gonzalo Navarro 001; Yoan J. Pinzón; Alejandro Salinger (J. Discrete Algorithms, 2005)

Bases of Motifs for Generating Repeated Patterns with Wild Cards. - Nadia Pisanti; Maxime Crochemore; Roberto Grossi; Marie-France Sagot (IEEE ACM Trans. Comput. Biol. Bioinform., 2005)

A note on the Burrows - CWheeler transformation. - Maxime Crochemore; Jacques Désarménien; Dominique Perrin (Theor. Comput. Sci., 2005)

Presentations of constrained systems with unconstrained positions. - Marie-Pierre Béal; Maxime Crochemore; Gabriele Fici (IEEE Trans. Inf. Theory, 2005)

Factor Oracles. - Maxime Crochemore; Lucian Ilie; Emine Seid-Hilmi (CIAA, 2006)

Longest repeats with a block of k don't cares. - Maxime Crochemore; Costas S. Iliopoulos; Manal Mohamed 001; Marie-France Sagot (Theor. Comput. Sci., 2006)

Text Searching and Indexing. - Maxime Crochemore; Thierry Lecroq (Recent Advances in Formal Languages and Applications, 2006)

Algorithms on strings. - Maxime Crochemore; Christophe Hancart; Thierry Lecroq (Cambridge University Press, 2007)

Minimizing local automata. - Marie-Pierre Béal; Maxime Crochemore (ISIT, 2007)

Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. - Pavlos Antoniou; Maxime Crochemore; Costas S. Iliopoulos; Pierre Peterlongo (LATA, 2007)

Analysis of Maximal Repetitions in Strings. - Maxime Crochemore; Lucian Ilie (MFCS, 2007)

Finding Patterns in Given Intervals. - Maxime Crochemore; Costas S. Iliopoulos; M. Sohel Rahman (MFCS, 2007)

On the Suffix Automaton with Mismatches. - Maxime Crochemore; Chiara Epifanio; Alessandra Gabriele; Filippo Mignosi (CIAA, 2007)

The Structure of Factor Oracles. - Maxime Crochemore; Lucian Ilie; Emine Seid-Hilmi (Int. J. Found. Comput. Sci., 2007)

All maximal-pairs in step-leap representation of melodic sequence. - Emilios Cambouropoulos; Maxime Crochemore; Costas S. Iliopoulos; Manal Mohamed 001; Marie-France Sagot (Inf. Sci., 2007)

Computing a Longest Increasing Subsequence of Length k in Time O(n log log k). - Maxime Crochemore; Ely Porat (BCS Int. Acad. Conf., 2008)

Towards a Solution to the "Runs" Conjecture. - Maxime Crochemore; Lucian Ilie; Liviu Tinta (CPM, 2008)

A Simple Algorithm for Computing the Lempel Ziv Factorization. - Maxime Crochemore; Lucian Ilie; William F. Smyth (DCC, 2008)

Bounds on Powers in Strings. - Maxime Crochemore; Szilárd Zsolt Fazekas; Costas S. Iliopoulos; Inuka Jayasekera (Developments in Language Theory, 2008)

On the Longest Common Factor Problem. - Maxime Crochemore; Alessandra Gabriele; Filippo Mignosi; Mauriana Pesaresi (IFIP TCS, 2008)

Understanding Maximal Repetitions in Strings. - Maxime Crochemore; Lucian Ilie (STACS, 2008)

Improved Algorithms for the Range Next Value Problem and Applications. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Mohammad Sohel Rahman; Tomasz Walen (STACS, 2008)

Conservative String Covering of Indeterminate Strings. - Pavlos Antoniou; Maxime Crochemore; Costas S. Iliopoulos; Inuka Jayasekera; Gad M. Landau (Stringology, 2008)

External Memory Algorithms for String Problems. - Kangho Roh; Maxime Crochemore; Costas S. Iliopoulos; Kunsoo Park (Fundam. Informaticae, 2008)

Computing Longest Previous Factor in linear time and applications. - Maxime Crochemore; Lucian Ilie (Inf. Process. Lett., 2008)

Optimal prefix and suffix queries on texts. - Maxime Crochemore; Costas S. Iliopoulos; Mohammad Sohel Rahman (Inf. Process. Lett., 2008)

Maximal repetitions in strings. - Maxime Crochemore; Lucian Ilie (J. Comput. Syst. Sci., 2008)

Foreword. - Joseph Wun-Tat Chan; Maxime Crochemore (Math. Comput. Sci., 2008)

Approximating the 2-interval pattern problem. - Maxime Crochemore; Danny Hermelin; Gad M. Landau; Dror Rawitz; Stéphane Vialette (Theor. Comput. Sci., 2008)

Sequential Exact String Matching. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Algorithms, 2008)

Sequential Multiple String Matching. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Algorithms, 2008)

Squares and Repetitions. - Maxime Crochemore; Wojciech Rytter (Encyclopedia of Algorithms, 2008)

Alignments and Approximate String Matching. - Maxime Crochemore; Thierry Lecroq (New Developments in Formal Languages and Applications, 2008)

LPF Computation Revisited. - Maxime Crochemore; Lucian Ilie; Costas S. Iliopoulos; Marcin Kubica 001; Wojciech Rytter; Tomasz Walen (IWOCA, 2009)

Reverse Engineering Prefix Tables. - Julien Clément 001; Maxime Crochemore; Giuseppina Rindone (STACS, 2009)

On-line Construction of a Small Automaton for a Finite Set of Words. - Maxime Crochemore; Laura Giambruno (Stringology, 2009)

On the maximal number of highly periodic runs in a string - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CoRR, 2009)

From Nerode's congruence to suffix automata with mismatches. - Maxime Crochemore; Chiara Epifanio; Alessandra Gabriele; Filippo Mignosi (Theor. Comput. Sci., 2009)

Repetitions in strings: Algorithms and combinatorics. - Maxime Crochemore; Lucian Ilie; Wojciech Rytter (Theor. Comput. Sci., 2009)

Suffix Tree. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Database Systems, 2009)

Trie. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Database Systems, 2009)

A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches. - Maxime Crochemore; Costas S. Iliopoulos; Solon P. Pissis (Algorithms and Applications, 2010)

Algorithms for Three Versions of the Shortest Common Superstring Problem. - Maxime Crochemore; Marek Cygan; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CPM, 2010)

Cover Array String Reconstruction. - Maxime Crochemore; Costas S. Iliopoulos; Solon P. Pissis; German Tischler (CPM, 2010)

On the Maximal Sum of Exponents of Runsin a String. - Maxime Crochemore; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (IWOCA, 2010)

On the Maximal Number of Cubic Runs in a String. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (LATA, 2010)

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Wojciech Rytter; Tomasz Walen (SOFSEM, 2010)

Extracting Powers and Periods in a String from Its Runs Structure. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2010)

The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching. - Maxime Crochemore; German Tischler (SPIRE, 2010)

Bounded Number of Squares in Infinite Repetition-Constrained Binary Words. - Golnaz Badkobeh; Maxime Crochemore (Stringology, 2010)

Reactive Links to Save Automata States. - Maxime Crochemore; Dov M. Gabbay (Stringology, 2010)

Finding Patterns In Given Intervals. - Maxime Crochemore; Marcin Kubica 001; Tomasz Walen; Costas S. Iliopoulos; M. Sohel Rahman (Fundam. Informaticae, 2010)

Fast computation of a longest increasing subsequence and application. - Maxime Crochemore; Ely Porat (Inf. Comput., 2010)

Number of Occurrences of powers in Strings. - Maxime Crochemore; Szilárd Zsolt Fazekas; Costas S. Iliopoulos; Inuka Jayasekera (Int. J. Found. Comput. Sci., 2010)

On the Right-Seed Array of a String. - Michalis Christou; Maxime Crochemore; Ondrej Guth; Costas S. Iliopoulos; Solon P. Pissis (COCOON, 2011)

Efficient Seeds Computation Revisited. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (CPM, 2011)

Hunting Redundancies in Strings. - Golnaz Badkobeh; Supaporn Chairungsee; Maxime Crochemore (Developments in Language Theory, 2011)

Computing All Subtree Repeats in Ordered Ranked Trees. - Michalis Christou; Maxime Crochemore; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (SPIRE, 2011)

Building Phylogeny with Minimal Absent Words. - Supaporn Chairungsee; Maxime Crochemore (CIAA, 2011)

Finite-Repetition threshold for infinite ternary words - Golnaz Badkobeh; Maxime Crochemore (WORDS, 2011)

Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081). - Maxime Crochemore; Lila Kari; Mehryar Mohri; Dirk Nowotka (Dagstuhl Reports, 2011)

Reactive automata. - Maxime Crochemore; Dov M. Gabbay (Inf. Comput., 2011)

Computing Longest Previous non-overlapping Factors. - Maxime Crochemore; German Tischler (Inf. Process. Lett., 2011)

The "runs" conjecture. - Maxime Crochemore; Lucian Ilie; Liviu Tinta (Theor. Comput. Sci., 2011)

Periodic-Finite-Type Shift Spaces. - Marie-Pierre Béal; Maxime Crochemore; Bruce E. Moision; Paul H. Siegel (IEEE Trans. Inf. Theory, 2011)

The Maximum Number of Squares in a Tree. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Wojciech Tyczynski; Tomasz Walen (CPM, 2012)

Lyndon fountains and the Burrows-Wheeler transform. - Ali Alatabbi; Maxime Crochemore; Jacqueline W. Daykin; Laurent Mouchard (CUBE, 2012)

Overlapping repetitions in weighted sequence. - Ali Alatabbi; Maxime Crochemore; Costas S. Iliopoulos; Tewogboye A. Okanlawon (CUBE, 2012)

Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time. - Golnaz Badkobeh; Maxime Crochemore; Chalita Toopsuwan (SPIRE, 2012)

A comparison of index-based lempel-Ziv LZ77 factorization algorithms. - Anisa Al-Hafeedh; Maxime Crochemore; Lucian Ilie; Evguenia Kopylova; William F. Smyth; German Tischler; Munina Yusufu (ACM Comput. Surv., 2012)

Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos (Int. J. Found. Comput. Sci., 2012)

On-Line Construction of a Small Automaton for a Finite Set of Words. - Maxime Crochemore; Laura Giambruno; Alessio Langiu (Int. J. Found. Comput. Sci., 2012)

Computing all subtree repeats in ordered trees. - Michalis Christou; Maxime Crochemore; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (Inf. Process. Lett., 2012)

Fewest repetitions in infinite binary words. - Golnaz Badkobeh; Maxime Crochemore (RAIRO Theor. Informatics Appl., 2012)

The maximal number of cubic runs in a word. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (J. Comput. Syst. Sci., 2012)

On left and right seeds of a string. - Michalis Christou; Maxime Crochemore; Ondrej Guth; Costas S. Iliopoulos; Solon P. Pissis (J. Discrete Algorithms, 2012)

Dictionary-symbolwise flexible parsing. - Maxime Crochemore; Laura Giambruno; Alessio Langiu; Filippo Mignosi; Antonio Restivo (J. Discrete Algorithms, 2012)

Efficient algorithms for three variants of the LPF table. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Wojciech Rytter; Tomasz Walen (J. Discrete Algorithms, 2012)

On the maximal sum of exponents of runs in a string. - Maxime Crochemore; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (J. Discrete Algorithms, 2012)

Using minimal absent words to build phylogeny. - Supaporn Chairungsee; Maxime Crochemore (Theor. Comput. Sci., 2012)

Improved algorithms for the range next value problem and applications. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; M. Sohel Rahman; German Tischler; Tomasz Walen (Theor. Comput. Sci., 2012)

Locating All Maximal Approximate Runs in a String. - Mika Amit; Maxime Crochemore; Gad M. Landau (CPM, 2013)

Forty Years of Text Indexing. - Alberto Apostolico; Maxime Crochemore; Martin Farach-Colton; Zvi Galil; S. Muthukrishnan 001 (CPM, 2013)

A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. - Maxime Crochemore; Roberto Grossi; Juha Kärkkäinen; Gad M. Landau (CPM, 2013)

The Rightmost Equal-Cost Position Problem. - Maxime Crochemore; Alessio Langiu; Filippo Mignosi (DCC, 2013)

Suffix Tree of Alignment: An Efficient Index for Similar Data. - Joong Chae Na; Heejin Park; Maxime Crochemore; Jan Holub 001; Costas S. Iliopoulos; Laurent Mouchard; Kunsoo Park (IWOCA, 2013)

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2013)

Overlapping factors in words. - Manolis Christodoulakis; Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos (Australas. J Comb., 2013)

Order-Preserving Suffix Trees and Their Algorithmic Applications - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CoRR, 2013)

Computing the Longest Previous Factor. - Maxime Crochemore; Lucian Ilie; Costas S. Iliopoulos; Marcin Kubica 001; Wojciech Rytter; Tomasz Walen (Eur. J. Comb., 2013)

A note on efficient computation of all Abelian periods in a string. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Jakub Pachocki; Jakub Radoszewski; Wojciech Rytter; Wojciech Tyczynski; Tomasz Walen (Inf. Process. Lett., 2013)

StringMasters 2011 Special Issue. - Maxime Crochemore; Jacqueline W. Daykin (J. Discrete Algorithms, 2013)

Efficient seed computation revisited. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (Theor. Comput. Sci., 2013)

Pattern Matching and Text Compression Algorithms. - Maxime Crochemore; Thierry Lecroq (Computing Handbook, 3rd ed. (1), 2014)

Maximal anti-exponent of gapped palindromes. - Golnaz Badkobeh; Maxime Crochemore; Chalita Toopsuwan (DICTAP, 2014)

Fewer runs than word length. - Maxime Crochemore; Robert Mercas (CoRR, 2014)

Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111). - Maxime Crochemore; James D. Currie; Gregory Kucherov; Dirk Nowotka (Dagstuhl Reports, 2014)

Abelian borders in binary words. - Manolis Christodoulakis; Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos (Discret. Appl. Math., 2014)

New simple efficient algorithms computing powers and runs in strings. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Krzysztof Stencel; Tomasz Walen (Discret. Appl. Math., 2014)

Finite repetition threshold for large alphabets. - Golnaz Badkobeh; Maxime Crochemore; Michaël Rao (RAIRO Theor. Informatics Appl., 2014)

StringMasters 2012 & 2013 special issue - volume 1. - Maxime Crochemore; Jacqueline W. Daykin; Zsuzsanna Lipták (J. Discrete Algorithms, 2014)

On the average number of regularities in a word. - Manolis Christodoulakis; Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos (Theor. Comput. Sci., 2014)

Extracting powers and periods in a word from its runs structure. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2014)

Note on the greedy parsing optimality for dictionary-based text compression. - Maxime Crochemore; Alessio Langiu; Filippo Mignosi (Theor. Comput. Sci., 2014)

Optimal searching of gapped repeats in a word. - Maxime Crochemore; Roman Kolpakov; Gregory Kucherov (CoRR, 2015)

Infinite binary words containing repetitions of odd period. - Golnaz Badkobeh; Maxime Crochemore (Inf. Process. Lett., 2015)

StringMasters 2012 & 2013 special issue - volume 2. - Maxime Crochemore; Jacqueline W. Daykin; Zsuzsanna Lipták (J. Discrete Algorithms, 2015)

Computing the Burrows-Wheeler transform in place and in small space. - Maxime Crochemore; Roberto Grossi; Juha Kärkkäinen; Gad M. Landau (J. Discrete Algorithms, 2015)

A note on the longest common compatible prefix problem for partial words. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (J. Discrete Algorithms, 2015)

Optimal Bounds for Computing alpha α -gapped Repeats. - Maxime Crochemore; Roman Kolpakov; Gregory Kucherov (LATA, 2016)

Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. - Maxime Crochemore; Gabriele Fici; Robert Mercas; Solon P. Pissis (LATIN, 2016)

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Ritu Kundu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2016)

Quasiperiodicities in Fibonacci strings. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos (Ars Comb., 2016)

40 years of suffix trees. - Alberto Apostolico; Maxime Crochemore; Martin Farach-Colton; Zvi Galil; S. Muthukrishnan 001 (Commun. ACM, 2016)

Linear algorithm for conservative degenerate pattern matching. - Maxime Crochemore; Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001; Fatima Vayani (Eng. Appl. Artif. Intell., 2016)

Computing maximal-exponent factors in an overlap-free word. - Golnaz Badkobeh; Maxime Crochemore (J. Comput. Syst. Sci., 2016)

Efficient computation of maximal anti-exponent in palindrome-free strings. - Golnaz Badkobeh; Maxime Crochemore; Manal Mohamed 001; Chalita Toopsuwan (Theor. Comput. Sci., 2016)

Linear-size suffix tries. - Maxime Crochemore; Chiara Epifanio; Roberto Grossi; Filippo Mignosi (Theor. Comput. Sci., 2016)

Order-preserving indexing. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2016)

On the density of Lyndon roots in factors. - Maxime Crochemore; Robert Mercas (Theor. Comput. Sci., 2016)

Multiple String Matching. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Algorithms, 2016)

String Matching. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Algorithms, 2016)

Squares and Repetitions. - Maxime Crochemore; Wojciech Rytter (Encyclopedia of Algorithms, 2016)

Longest Previous Non-overlapping Factors Table Computation. - Supaporn Chairungsee; Maxime Crochemore (COCOA (2), 2017)

Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching. - Maxime Crochemore; Alice Héliou; Gregory Kucherov; Laurent Mouchard; Solon P. Pissis; Yann Ramusat (FCT, 2017)

Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time. - Maxime Crochemore; Alexandre P. Francisco; Solon P. Pissis; Cátia Vaz (WABI, 2017)

Cartesian trees and Lyndon trees. - Maxime Crochemore; Luís M. S. Russo (CoRR, 2017)

The longest common substring problem. - Maxime Crochemore; Costas S. Iliopoulos; Alessio Langiu; Filippo Mignosi (Math. Struct. Comput. Sci., 2017)

Locating maximal approximate runs in a string. - Mika Amit; Maxime Crochemore; Gad M. Landau; Dina Sokol (Theor. Comput. Sci., 2017)

Counting maximal-exponent factors in words. - Golnaz Badkobeh; Maxime Crochemore; Robert Mercas (Theor. Comput. Sci., 2017)

Covering problems for partial words and for indeterminate strings. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2017)

Linear-Time Algorithm for Long LCF with k Mismatches. - Panagiotis Charalampopoulos; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CPM, 2018)

How Much Different Are Two Words with Different Shortest Periods. - Mai Alzamel; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Ritu Kundu; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (AIAI (Workshops), 2018)

On Extended Special Factors of a Word. - Panagiotis Charalampopoulos; Maxime Crochemore; Solon P. Pissis (SPIRE, 2018)

Fast phylogenetic inference from typing data. - João A. Carriço; Maxime Crochemore; Alexandre P. Francisco; Solon P. Pissis; Bruno Ribeiro-Gonçalves; Cátia Vaz (Algorithms Mol. Biol., 2018)

Preface. - Panagiotis Charalampopoulos; Maxime Crochemore; Solon P. Pissis (Fundam. Informaticae, 2018)

Alignment-free sequence comparison using absent words. - Panagiotis Charalampopoulos; Maxime Crochemore; Gabriele Fici; Robert Mercas; Solon P. Pissis (Inf. Comput., 2018)

Advances in Algorithms & Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos). - Maxime Crochemore; Solon P. Pissis (Theor. Comput. Sci., 2018)

Suffix Tree. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Database Systems (2nd ed.), 2018)

Trie. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Database Systems (2nd ed.), 2018)

Quasi-Linear-Time Algorithm for Longest Common Circular Factor. - Mai Alzamel; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (CPM, 2019)

k-Abelian Pattern Matching: Revisited, Corrected, and Extended. - Golnaz Badkobeh; Hideo Bannai; Maxime Crochemore; Tomohiro I; Shunsuke Inenaga; Shiho Sugimoto (Stringology, 2019)

Optimal bounds for computing α-gapped repeats. - Maxime Crochemore; Roman Kolpakov; Gregory Kucherov (Inf. Comput., 2019)

Efficient enumeration of non-equivalent squares in partial words with few holes. - Panagiotis Charalampopoulos; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (J. Comb. Optim., 2019)

Special issue in honor of the 70th birthday of Prof. Wojciech Rytter. - Maxime Crochemore; Jakub Radoszewski (Theor. Comput. Sci., 2019)

Internal Quasiperiod Queries. - Maxime Crochemore; Costas S. Iliopoulos; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (SPIRE, 2020)

Left Lyndon Tree Construction. - Golnaz Badkobeh; Maxime Crochemore (Stringology, 2020)

Absent words in a sliding window with applications. - Maxime Crochemore; Alice Héliou; Gregory Kucherov; Laurent Mouchard; Solon P. Pissis; Yann Ramusat (Inf. Comput., 2020)

Cartesian and Lyndon trees. - Maxime Crochemore; Luís M. S. Russo (Theor. Comput. Sci., 2020)

Shortest covers of all cyclic shifts of a string. - Maxime Crochemore; Costas S. Iliopoulos; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (Theor. Comput. Sci., 2021)

Back-To-Front Online Lyndon Forest Construction. - Golnaz Badkobeh; Maxime Crochemore; Jonas Ellert; Cyril Nicaud (CPM, 2022)

Linear-Time Computation of Shortest Covers of All Rotations of a String. - Maxime Crochemore; Costas S. Iliopoulos; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (CPM, 2022)

Linear construction of a left Lyndon tree. - Golnaz Badkobeh; Maxime Crochemore (Inf. Comput., 2022)

Checking whether a word is Hamming-isometric in linear time. - Marie-Pierre Béal; Maxime Crochemore (Theor. Comput. Sci., 2022)

Fast Detection of Specific Fragments Against a Set of Sequences. - Marie-Pierre Béal; Maxime Crochemore (DLT, 2023)

Specific Patterns Against Reference Sequences. - Marie-Pierre Béal; Maxime Crochemore (From Strings to Graphs, and Back Again, 2025)

25 Additional Problems - Extension to the Book "125 Problems in Text Algorithms". - Maxime Crochemore; Thierry Lecroq; Wojciech Rytter (CoRR, 2025)