Maxime Crochemore

Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen: Computing the Longest Previous Factor. Eur. J. Comb. 34(1): 15-26 (2013)

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

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

Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan: Forty Years of Text Indexing. CPM 2013: 1-10

Mika Amit, Maxime Crochemore, Gad M. Landau: Locating All Maximal Approximate Runs in a String. CPM 2013: 13-27

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

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

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

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

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

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

Golnaz Badkobeh, Maxime Crochemore: Fewest repetitions in infinite binary words. RAIRO - Theor. Inf. and Applic. 46(1): 17-31 (2012)

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

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

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

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

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

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

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

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

Ali Alatabbi, Maxime Crochemore, Costas S. Iliopoulos, Tewogboye A. Okanlawon: Overlapping repetitions in weighted sequence. CUBE 2012: 435-440

Ali Alatabbi, Maxime Crochemore, Jacqueline W. Daykin, Laurent Mouchard: Lyndon fountains and the Burrows-Wheeler transform. CUBE 2012: 441-446

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

Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos: Quasiperiodicities in Fibonacci strings. CoRR abs/1201.6162 (2012)

Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos: Identifying all abelian periods of a string in quadratic time and relevant problems. CoRR abs/1207.1307 (2012)

Golnaz Badkobeh, Maxime Crochemore: Fewest repetitions in infinite binary words. CoRR abs/1207.5723 (2012)

Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen: A Note on Efficient Computation of All Abelian Periods in a String. CoRR abs/1208.3313 (2012)

Maxime Crochemore, Alessio Langiu, Filippo Mignosi: The Rightmost Equal-Cost Position Problem. CoRR abs/1211.5108 (2012)

Maxime Crochemore, Alessio Langiu, Filippo Mignosi: Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression. CoRR abs/1211.5350 (2012)

Maxime Crochemore, Dov M. Gabbay: Reactive automata. Inf. Comput. 209(4): 692-704 (2011)

Maxime Crochemore, German Tischler: Computing Longest Previous non-overlapping Factors. Inf. Process. Lett. 111(6): 291-295 (2011)

Maxime Crochemore, Lucian Ilie, Liviu Tinta: The "runs" conjecture. Theor. Comput. Sci. 412(27): 2931-2941 (2011)

Marie-Pierre Béal, Maxime Crochemore, Bruce E. Moision, Paul H. Siegel: Periodic-Finite-Type Shift Spaces. IEEE Transactions on Information Theory 57(6): 3677-3691 (2011)

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

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

Golnaz Badkobeh, Supaporn Chairungsee, Maxime Crochemore: Hunting Redundancies in Strings. Developments in Language Theory 2011: 1-14

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

Supaporn Chairungsee, Maxime Crochemore: Building Phylogeny with Minimal Absent Words. CIAA 2011: 100-109

Golnaz Badkobeh, Maxime Crochemore: Finite-Repetition threshold for infinite ternary words. WORDS 2011: 37-43

Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen: Efficient Seeds Computation Revisited. CoRR abs/1104.3153 (2011)

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

Maxime Crochemore, Marcin Kubica, Tomasz Walen, Costas S. Iliopoulos, M. Sohel Rahman: Finding Patterns In Given Intervals. Fundam. Inform. 101(3): 173-186 (2010)

Maxime Crochemore, Ely Porat: Fast computation of a longest increasing subsequence and application. Inf. Comput. 208(9): 1054-1059 (2010)

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

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

Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler: Cover Array String Reconstruction. CPM 2010: 251-259

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

Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen: On the Maximal Sum of Exponents of Runsin a String. IWOCA 2010: 10-19

Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo: Dictionary-Symbolwise Flexible Parsing. IWOCA 2010: 390-403

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

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

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

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

Maxime Crochemore, Dov M. Gabbay: Reactive Links to Save Automata States. Stringology 2010: 1-8

Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen: New Simple Efficient Algorithms Computing Powers and Runs in Strings. Stringology 2010: 138-149

Golnaz Badkobeh, Maxime Crochemore: Bounded Number of Squares in Infinite Repetition-Constrained Binary Words. Stringology 2010: 161-166

Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen: On the maximal sum of exponents of runs in a string. CoRR abs/1003.4866 (2010)

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

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

Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen: LPF Computation Revisited. IWOCA 2009: 158-169

Julien Clément, Maxime Crochemore, Giuseppina Rindone: Reverse Engineering Prefix Tables. STACS 2009: 289-300

Maxime Crochemore, Laura Giambruno: On-line Construction of a Small Automaton for a Finite Set of Words. Stringology 2009: 15-28

Maxime Crochemore, Thierry Lecroq: Suffix Tree. Encyclopedia of Database Systems 2009: 2876-2880

Maxime Crochemore, Thierry Lecroq: Trie. Encyclopedia of Database Systems 2009: 3179-3182

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

Kangho Roh, Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park: External Memory Algorithms for String Problems. Fundam. Inform. 84(1): 17-32 (2008)

Maxime Crochemore, Lucian Ilie: Computing Longest Previous Factor in linear time and applications. Inf. Process. Lett. 106(2): 75-80 (2008)

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

Maxime Crochemore, Lucian Ilie: Maximal repetitions in strings. J. Comput. Syst. Sci. 74(5): 796-807 (2008)

Joseph Wun-Tat Chan, Maxime Crochemore: Foreword. Mathematics in Computer Science 1(4): 541-542 (2008)

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

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

Maxime Crochemore, Lucian Ilie, Liviu Tinta: Towards a Solution to the "Runs" Conjecture. CPM 2008: 290-302

Maxime Crochemore, Lucian Ilie, William F. Smyth: A Simple Algorithm for Computing the Lempel Ziv Factorization. DCC 2008: 482-488

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

Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi: On the Longest Common Factor Problem. IFIP TCS 2008: 143-155

Maxime Crochemore, Lucian Ilie: Understanding Maximal Repetitions in Strings. STACS 2008: 11-16

Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen: Improved Algorithms for the Range Next Value Problem and Applications. STACS 2008: 205-216

Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau: Conservative String Covering of Indeterminate Strings. Stringology 2008: 108-115

Maxime Crochemore, Thierry Lecroq: Alignments and Approximate String Matching. New Developments in Formal Languages and Applications 2008: 59-93

Maxime Crochemore, Thierry Lecroq: Sequential Exact String Matching. Encyclopedia of Algorithms 2008

Maxime Crochemore, Thierry Lecroq: Sequential Multiple String Matching. Encyclopedia of Algorithms 2008

Maxime Crochemore, Wojciech Rytter: Squares and Repetitions. Encyclopedia of Algorithms 2008

Maxime Crochemore, Lucian Ilie: Understanding maximal repetitions in strings. CoRR abs/0802.2829 (2008)

Maxime Crochemore, Christophe Hancart, Thierry Lecroq: Algorithms on strings. Cambridge University Press 2007, isbn 978-0-521-84899-2, pp. I-VIII, 1-383

Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi: The Structure of Factor Oracles. Int. J. Found. Comput. Sci. 18(4): 781-797 (2007)

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

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

Maxime Crochemore, Lucian Ilie: Analysis of Maximal Repetitions in Strings. MFCS 2007: 465-476

Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman: Finding Patterns in Given Intervals. MFCS 2007: 645-656

Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi: On the Suffix Automaton with Mismatches. CIAA 2007: 144-156

Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot: Longest repeats with a block of k don't cares. Theor. Comput. Sci. 362(1-3): 248-254 (2006)

Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi: Factor Oracles. CIAA 2006: 78-89

Maxime Crochemore, Thierry Lecroq: Text Searching and Indexing. Recent Advances in Formal Languages and Applications 2006: 43-80

Ricardo A. Baeza-Yates, Maxime Crochemore: Foreword. J. Discrete Algorithms 3(2-4): 125 (2005)

Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon, Alejandro Salinger: Bit-parallel (delta, gamma)-matching and suffix automata. J. Discrete Algorithms 3(2-4): 198-214 (2005)

Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot: Bases of Motifs for Generating Repeated Patterns with Wild Cards. IEEE/ACM Trans. Comput. Biology Bioinform. 2(1): 40-50 (2005)

Maxime Crochemore, Jacques Désarménien, Dominique Perrin: A note on the Burrows - CWheeler transformation. Theor. Comput. Sci. 332(1-3): 567-572 (2005)

Marie-Pierre Béal, Maxime Crochemore, Gabriele Fici: Presentations of constrained systems with unconstrained positions. IEEE Transactions on Information Theory 51(5): 1891-1900 (2005)

Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette: Approximating the 2-Interval Pattern Problem. ESA 2005: 426-437

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

Alberto Apostolico, Maxime Crochemore, Kunsoo Park (Eds.): Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings. Lecture Notes in Computer Science 3537, Springer 2005, isbn 3-540-26201-6

Maxime Crochemore, Jacques Désarménien, Dominique Perrin: A note on the Burrows-Wheeler transformation. CoRR abs/cs/0502073 (2005)

Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps: Two-dimensional pattern matching with rotations. Theor. Comput. Sci. 314(1-2): 173-187 (2004)

Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi: A Trie-Based Approach for Compacting Automata. CPM 2004: 145-158

Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot: Longest Repeats with a Block of Don't Cares. LATIN 2004: 271-278

Maxime Crochemore, Raffaele Giancarlo, Marie-France Sagot: Longest Motifs with a Functionally Equivalent Central Block. SPIRE 2004: 298-209

Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq: Occurrence and Substring Heuristics for i-Matching. Fundam. Inform. 56(1-2): 1-21 (2003)

Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon: Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. Fundam. Inform. 56(1-2): 89-103 (2003)

Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino: Computing forbidden words of regular languages. Fundam. Inform. 56(1-2): 121-135 (2003)

Maxime Crochemore, Valery T. Stefanov: Waiting time and complexity for matching patterns with automata. Inf. Process. Lett. 87(3): 119-125 (2003)

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

Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek: Directed acyclic subsequence graph - Overview. J. Discrete Algorithms 1(3-4): 255-280 (2003)

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

Maxime Crochemore: Reducing space for index implementation. Theor. Comput. Sci. 292(1): 185-197 (2003)

Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps: Two-Dimensional Pattern Matching with Rotations. CPM 2003: 17-31

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

Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon: A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. SPIRE 2003: 211-223

Ricardo A. Baeza-Yates, Edgar Chávez, Maxime Crochemore (Eds.): Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings. Lecture Notes in Computer Science 2676, Springer 2003, isbn 3-540-40311-6

Maxime Crochemore, Wojciech Rytter: Jewels of stringology. World Scientific 2002, isbn 978-981-02-4782-9, pp. I-X, 1-310

Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzon: Algorithms for Computing Approximate Repetitions in Musical Sequences. Int. J. Comput. Math. 79(11): 1135-1148 (2002)

Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, T. Tsichlas: Approximate String Matching with Gaps. Nord. J. Comput. 9(1): 54-65 (2002)

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

Maxime Crochemore, Gonzalo Navarro: Improved Antidictionary Based Compression. SCCC 2002: 7-13

Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson: A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. SODA 2002: 679-688

Maxime Crochemore, Zdenek Tronícek: On the Size of DASG for Multiple Texts. SPIRE 2002: 58-64

Jan Holub, Maxime Crochemore: On the Implementation of Compact DAWG's. CIAA 2002: 289-294

Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon: Computing Evolutionary Chains in Musical Sequences. Electr. J. Comb. 8(2) (2001)

Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot: Efficient Experimental String Matching by Weak Factor Recognition. CPM 2001: 51-72

Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon: Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. SPIRE 2001: 59-67

Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzon: Approximate String Matching in Musical Sequences. Stringology 2001: 26-36

Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon: Finding Motifs with Gaps. ISMIR 2000

Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon: Fast Evolutionary Chains. SOFSEM 2000: 307-318

Maxime Crochemore, Renaud Vérin: Zones of Low Entropy in Genomic Sequences. Computers & Chemistry 23(3-4): 275-282 (1999)

Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter: Fast Practical Multi-Pattern Matching. Inf. Process. Lett. 71(3-4): 107-113 (1999)

Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter: Constant-Space String-Matching in Sublinear Average Time. Theor. Comput. Sci. 218(1): 197-203 (1999)

Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi: Text Compression Using Antidictionaries. ICALP 1999: 261-270

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

Maxime Crochemore, Mike Paterson (Eds.): Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings. Lecture Notes in Computer Science 1645, Springer 1999, isbn 3-540-66278-2

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

Maxime Crochemore, Filippo Mignosi, Antonio Restivo: Automata and Forbidden Words. Inf. Process. Lett. 67(3): 111-117 (1998)

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

Maxime Crochemore, Filippo Mignosi, Antonio Restivo: Minimal Forbidden Words and Factor Automata. MFCS 1998: 665-673

Maxime Crochemore, Thierry Lecroq: Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm. Inf. Process. Lett. 63(4): 195-203 (1997)

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

Maxime Crochemore, Thierry Lecroq: Pattern Matching and Text Compression Algorithms. The Computer Science and Engineering Handbook 1997: 161-202

Maxime Crochemore, Renaud Vérin: On Compact Directed Acyclic Word Graphs. Structures in Logic and Computer Science 1997: 192-211

Maxime Crochemore, Renaud Vérin: Direct Construction of Compact Directed Acyclic Word Graphs. CPM 1997: 116-129

Maxime Crochemore, Thierry Lecroq: Pattern-Matching and Text-Compression Algorithms. ACM Comput. Surv. 28(1): 39-41 (1996)

Nadia El-Mabrouk, Maxime Crochemore: Boyer-Moore Strategy to Efficient Approximate String Matching. CPM 1996: 24-38

Maxime Crochemore, Wojciech Rytter: Sqares, Cubes, and Time-Space Efficient String Searching. Algorithmica 13(5): 405-425 (1995)

Alberto Apostolico, Maxime Crochemore: Fast Parallel Lyndon Factorization with Applications. Mathematical Systems Theory 28(2): 89-108 (1995)

Maxime Crochemore, Wojciech Rytter: On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. LATIN 1995: 220-229

Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter: Two-Dimensional Pattern Matching in Linear Time and Small Space. STACS 1995: 181-192

Maxime Crochemore, Wojciech Rytter: Text Algorithms. Oxford University Press 1994, isbn 0-19-508609-0

Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter: Speeding Up Two String-Matching Algorithms. Algorithmica 12(4/5): 247-267 (1994)

Maxime Crochemore, Wojciech Rytter: On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. Theor. Comput. Sci. 132(2): 403-414 (1994)

Maxime Crochemore, Dan Gusfield (Eds.): Combinatorial Pattern Matching, 5th Annual Symposium, CPM 94, Asilomar, California, USA, June 5-8, 1994, Proceedings. Lecture Notes in Computer Science 807, Springer 1994, isbn 3-540-58094-8

Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter: Two-Dimensional Pattern Matching by Sampling. Inf. Process. Lett. 46(4): 159-162 (1993)

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

Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber (Eds.): Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings. Lecture Notes in Computer Science 684, Springer 1993, isbn 3-540-56764-X

Maxime Crochemore: String-Matching on Ordered Alphabets. Theor. Comput. Sci. 92(1): 33-47 (1992)

Jean Neraud, Maxime Crochemore: A String-Matching Interpretation of the Equation xmyn = zp. Theor. Comput. Sci. 92(1): 145-164 (1992)

Maxime Crochemore, Wojciech Rytter: Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. ICPIA 1992: 100-112

Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter: Speeding Up Two String-Matching Algorithms. STACS 1992: 589-600

Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber (Eds.): Combinatorial Pattern Matching, Third Annual Symposium, CPM 92, Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings. Lecture Notes in Computer Science 644, Springer 1992, isbn 3-540-56024-6

Alberto Apostolico, Maxime Crochemore: Optimal Canonization of All Substrings of a String. Inf. Comput. 95(1): 76-95 (1991)

Maxime Crochemore, Wojciech Rytter: Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings. Inf. Process. Lett. 38(2): 57-60 (1991)

Maxime Crochemore, Dominique Perrin: Two-Way String Matching. J. ACM 38(3): 651-675 (1991)

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

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

Maxime Crochemore, Wojciech Rytter: Parallel Construction of Minimal Suffix and Factor Automata. Inf. Process. Lett. 35(3): 121-128 (1990)

Maxime Crochemore, Jean Neraud: Unitary Monoid with Two Generators: An Algorithmic Point of View. CAAP 1990: 117-131

Maxime Crochemore, Wojciech Rytter: Parallel Construction of Minimal Suffix and Factor Automata. MFCS 1990: 217-223

Maxime Crochemore, Wojciech Rytter: Parallel Computations on Strings and Arrays. STACS 1990: 109-125

Jean Berstel, Maxime Crochemore, Jean-Eric Pin: Thue-Morse sequence and p-adic topology for the free monoid. Discrete Mathematics 76(2): 89-94 (1989)

Maxime Crochemore: String-matching and periods. Bulletin of the EATCS 39: 149-153 (1989)

Maxime Crochemore, Dominique Perrin: Critical factorizations of words. Bulletin of the EATCS 34: 47-51 (1988)

Maxime Crochemore: Constant-Space String-Matching. FSTTCS 1988: 80-87

Maxime Crochemore: Algorithms and automata. Formal Properties of Finite Automata and Applications 1988: 166-175

Maxime Crochemore: String Matching with Constraints. MFCS 1988: 44-58

Maxime Crochemore: Data Compression with Substitution. Electronic Dictionaries and Automata in Computational Linguistics 1987: 1-16

Maxime Crochemore: Longest Common Factor of Two Words. TAPSOFT, Vol.1 1987: 26-36

Maxime Crochemore: Computing LCF in linear time. Bulletin of the EATCS 30: 57-60 (1986)

Jean-Jacques Hébrard, Maxime Crochemore: Calcul de La Distance Par Les Sous-Mots. ITA 20(4): 441-456 (1986)

Maxime Crochemore: Transducers and Repetitions. Theor. Comput. Sci. 45(1): 63-86 (1986)

Maxime Crochemore: Linear Searching for a Squre in a Word (Abstract). ICALP 1984: 137

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

Maxime Crochemore: Sharp Characterizations of Squarefree Morphisms. Theor. Comput. Sci. 18: 221-226 (1982)

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

Maxime Crochemore: An Optimal Algorithm for Computing the Repetitions in a Word. Inf. Process. Lett. 12(5): 244-250 (1981)

A. Cardon, Maxime Crochemore: Détermination de la Représentation Standard d'une Série Reconnaissable. ITA 14(4): 371-379 (1980)