Maxime Crochemore

288 papers A* 4A 7B 42C 28Misc 9Journal 156Unranked 21

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Internal quasiperiod queries. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2025	J	`jnl`	25 Additional Problems - Extension to the Book "125 Problems in Text Algorithms". CoRR Maxime Crochemore, Thierry Lecroq, Wojciech Rytter
2025	J	`jnl`	Checking and producing word attractors. CoRR Marie-Pierre Béal, Maxime Crochemore, Giuseppe Romana
2025	—	`conf`	Specific Patterns Against Reference Sequences. From Strings to Graphs, and Back Again Marie-Pierre Béal, Maxime Crochemore
2023	C	`conf`	Fast Detection of Specific Fragments Against a Set of Sequences. DLT Marie-Pierre Béal, Maxime Crochemore
2022	B	`conf`	Back-To-Front Online Lyndon Forest Construction. CPM Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud
2022	J	`jnl`	Checking whether a word is Hamming-isometric in linear time. Theor. Comput. Sci. Marie-Pierre Béal, Maxime Crochemore
2022	J	`jnl`	Fast detection of specific fragments against a set of sequences. CoRR Marie-Pierre Béal, Maxime Crochemore
2022	J	`jnl`	Linear construction of a left Lyndon tree. Inf. Comput. Golnaz Badkobeh, Maxime Crochemore
2022	B	`conf`	Linear-Time Computation of Shortest Covers of All Rotations of a String. CPM Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2021	J	`jnl`	Checking whether a word is Hamming-isometric in linear time. CoRR Marie-Pierre Béal, Maxime Crochemore
2021	J	`jnl`	Shortest covers of all cyclic shifts of a string. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020	J	`jnl`	Absent words in a sliding window with applications. Inf. Comput. Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat
2020	J	`jnl`	Cartesian and Lyndon trees. Theor. Comput. Sci. Maxime Crochemore, Luís M. S. Russo
2020	C	`conf`	Internal Quasiperiod Queries. SPIRE Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020	J	`jnl`	Internal Quasiperiod Queries. CoRR Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020	Misc	`conf`	Left Lyndon Tree Construction. PSC Golnaz Badkobeh, Maxime Crochemore
2020	J	`jnl`	Left Lyndon tree construction. CoRR Golnaz Badkobeh, Maxime Crochemore
2020	B	`conf`	Shortest Covers of All Cyclic Shifts of a String. WALCOM Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	J	`jnl`	Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2019	J	`jnl`	Optimal bounds for computing Inf. Comput. Maxime Crochemore, Roman Kolpakov, Gregory Kucherov
2019	B	`conf`	Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	J	`jnl`	Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CoRR Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	J	`jnl`	Special issue in honor of the 70th birthday of Prof. Wojciech Rytter. Theor. Comput. Sci. Maxime Crochemore, Jakub Radoszewski
2018	J	`jnl`	Advances in Algorithms & Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos). Theor. Comput. Sci. Maxime Crochemore, Solon P. Pissis
2018	J	`jnl`	Alignment-free sequence comparison using absent words. CoRR Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
2018	J	`jnl`	Alignment-free sequence comparison using absent words. Inf. Comput. Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
2018	J	`jnl`	Fast phylogenetic inference from typing data. Algorithms Mol. Biol. João A. Carriço, Maxime Crochemore, Alexandre P. Francisco, Solon P. Pissis, Bruno Ribeiro-Gonçalves, Cátia Vaz
2018	—	`conf`	How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	B	`conf`	Linear-Time Algorithm for Long LCF with k Mismatches. CPM Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	J	`jnl`	Linear-Time Algorithm for Long LCF with k Mismatches. CoRR Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2018	C	`conf`	On Extended Special Factors of a Word. SPIRE Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis
2018	J	`jnl`	Preface. Fundam. Informaticae Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis
2018	—	`ch.`	Suffix Tree. Encyclopedia of Database Systems (2nd ed.) Maxime Crochemore, Thierry Lecroq
2018	—	`ch.`	Trie. Encyclopedia of Database Systems (2nd ed.) Maxime Crochemore, Thierry Lecroq
2017	J	`jnl`	Cartesian trees and Lyndon trees. CoRR Maxime Crochemore, Luís M. S. Russo
2017	J	`jnl`	Counting maximal-exponent factors in words. Theor. Comput. Sci. Golnaz Badkobeh, Maxime Crochemore, Robert Mercas
2017	J	`jnl`	Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2017	Misc	`conf`	Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2017	J	`jnl`	Locating maximal approximate runs in a string. Theor. Comput. Sci. Mika Amit, Maxime Crochemore, Gad M. Landau, Dina Sokol
2017	—	`conf`	Longest Previous Non-overlapping Factors Table Computation. COCOA (2) Supaporn Chairungsee, Maxime Crochemore
2017	B	`conf`	Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching. FCT Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat
2017	J	`jnl`	The longest common substring problem. Math. Struct. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Alessio Langiu, Filippo Mignosi
2017	C	`conf`	Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time. WABI Maxime Crochemore, Alexandre P. Francisco, Solon P. Pissis, Cátia Vaz
2016	J	`jnl`	40 years of suffix trees. Commun. ACM Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan
2016	J	`jnl`	Computing maximal-exponent factors in an overlap-free word. J. Comput. Syst. Sci. Golnaz Badkobeh, Maxime Crochemore
2016	J	`jnl`	Efficient computation of maximal anti-exponent in palindrome-free strings. Theor. Comput. Sci. Golnaz Badkobeh, Maxime Crochemore, Manal Mohamed, Chalita Toopsuwan
2016	J	`jnl`	Linear algorithm for conservative degenerate pattern matching. Eng. Appl. Artif. Intell. Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani
2016	B	`conf`	Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. LATIN Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
2016	J	`jnl`	Linear-size suffix tries. Theor. Comput. Sci. Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi
2016	—	`ch.`	Multiple String Matching. Encyclopedia of Algorithms Maxime Crochemore, Thierry Lecroq
2016	C	`conf`	Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	On the density of Lyndon roots in factors. Theor. Comput. Sci. Maxime Crochemore, Robert Mercas
2016	C	`conf`	Optimal Bounds for Computing \alpha α -gapped Repeats. LATA Maxime Crochemore, Roman Kolpakov, Gregory Kucherov
2016	J	`jnl`	Order-preserving indexing. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2016	J	`jnl`	Quasiperiodicities in Fibonacci strings. Ars Comb. Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2016	—	`ch.`	Squares and Repetitions. Encyclopedia of Algorithms Maxime Crochemore, Wojciech Rytter
2016	—	`ch.`	String Matching. Encyclopedia of Algorithms Maxime Crochemore, Thierry Lecroq
2015	J	`jnl`	A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2015	J	`jnl`	Computing the Burrows-Wheeler transform in place and in small space. J. Discrete Algorithms Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
2015	J	`jnl`	Infinite binary words containing repetitions of odd period. Inf. Process. Lett. Golnaz Badkobeh, Maxime Crochemore
2015	J	`jnl`	Linear Algorithm for Conservative Degenerate Pattern Matching. CoRR Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani
2015	J	`jnl`	Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. CoRR Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
2015	J	`jnl`	Optimal searching of gapped repeats in a word. CoRR Maxime Crochemore, Roman Kolpakov, Gregory Kucherov
2015	J	`jnl`	StringMasters 2012 & 2013 special issue - volume 2. J. Discrete Algorithms Maxime Crochemore, Jacqueline W. Daykin, Zsuzsanna Lipták
2014	J	`jnl`	Abelian borders in binary words. Discret. Appl. Math. Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2014	J	`jnl`	Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111). Dagstuhl Reports Maxime Crochemore, James D. Currie, Gregory Kucherov, Dirk Nowotka
2014	B	`conf`	Covering Problems for Partial Words and for Indeterminate Strings. ISAAC Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	Covering Problems for Partial Words and for Indeterminate Strings. CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014	J	`jnl`	Fewer runs than word length. CoRR Maxime Crochemore, Robert Mercas
2014	J	`jnl`	Finite repetition threshold for large alphabets. RAIRO Theor. Informatics Appl. Golnaz Badkobeh, Maxime Crochemore, Michaël Rao
2014	—	`conf`	Maximal anti-exponent of gapped palindromes. DICTAP Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan
2014	J	`jnl`	New simple efficient algorithms computing powers and runs in strings. Discret. Appl. Math. Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen
2014	J	`jnl`	Note on the greedy parsing optimality for dictionary-based text compression. Theor. Comput. Sci. Maxime Crochemore, Alessio Langiu, Filippo Mignosi
2014	J	`jnl`	On the average number of regularities in a word. Theor. Comput. Sci. Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2014	—	`ch.`	Pattern Matching and Text Compression Algorithms. Computing Handbook, 3rd ed. (1) Maxime Crochemore, Thierry Lecroq
2014	C	`ed.`	String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings SPIRE Edleno Silva de Moura, Maxime Crochemore
2014	J	`jnl`	StringMasters 2012 & 2013 special issue - volume 1. J. Discrete Algorithms Maxime Crochemore, Jacqueline W. Daykin, Zsuzsanna Lipták
2013	B	`conf`	A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. CPM Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
2013	J	`jnl`	A Note on the Longest Common Compatible Prefix Problem for Partial Words. CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2013	J	`jnl`	A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2013	J	`jnl`	Computing the Longest Previous Factor. Eur. J. Comb. Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2013	J	`jnl`	Efficient seed computation revisited. Theor. Comput. Sci. Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2013	B	`conf`	Forty Years of Text Indexing. CPM Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan
2013	B	`conf`	Locating All Maximal Approximate Runs in a String. CPM Mika Amit, Maxime Crochemore, Gad M. Landau
2013	C	`conf`	Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	J	`jnl`	Order-Preserving Suffix Trees and Their Algorithmic Applications CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2013	J	`jnl`	Overlapping factors in words. Australas. J Comb. Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2013	J	`jnl`	StringMasters 2011 Special Issue. J. Discrete Algorithms Maxime Crochemore, Jacqueline W. Daykin
2013	J	`jnl`	Suffix Tree of Alignment: An Efficient Index for Similar Data CoRR Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park
2013	C	`conf`	Suffix Tree of Alignment: An Efficient Index for Similar Data. IWOCA Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park
2013	B	`conf`	The Rightmost Equal-Cost Position Problem. DCC Maxime Crochemore, Alessio Langiu, Filippo Mignosi
2012	J	`jnl`	A Note on Efficient Computation of All Abelian Periods in a String CoRR Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2012	J	`jnl`	A comparison of index-based lempel-Ziv LZ77 factorization algorithms. ACM Comput. Surv. Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Evguenia Kopylova, William F. Smyth, German Tischler, Munina Yusufu
2012	J	`jnl`	Computing all subtree repeats in ordered trees. Inf. Process. Lett. Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
2012	C	`conf`	Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time. SPIRE Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan
2012	J	`jnl`	Dictionary-symbolwise flexible parsing. J. Discrete Algorithms Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo
2012	J	`jnl`	Efficient algorithms for three variants of the LPF table. J. Discrete Algorithms Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2012	J	`jnl`	Fewest repetitions in infinite binary words CoRR Golnaz Badkobeh, Maxime Crochemore
2012	J	`jnl`	Fewest repetitions in infinite binary words. RAIRO Theor. Informatics Appl. Golnaz Badkobeh, Maxime Crochemore
2012	J	`jnl`	Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems. Int. J. Found. Comput. Sci. Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2012	J	`jnl`	Identifying all abelian periods of a string in quadratic time and relevant problems CoRR Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2012	J	`jnl`	Improved algorithms for the range next value problem and applications. Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler, Tomasz Walen
2012	—	`conf`	Lyndon fountains and the Burrows-Wheeler transform. CUBE Ali Alatabbi, Maxime Crochemore, Jacqueline W. Daykin, Laurent Mouchard
2012	J	`jnl`	Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression CoRR Maxime Crochemore, Alessio Langiu, Filippo Mignosi
2012	J	`jnl`	On left and right seeds of a string. J. Discrete Algorithms Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis
2012	J	`jnl`	On the maximal sum of exponents of runs in a string. J. Discrete Algorithms Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012	J	`jnl`	On-Line Construction of a Small Automaton for a Finite Set of Words. Int. J. Found. Comput. Sci. Maxime Crochemore, Laura Giambruno, Alessio Langiu
2012	—	`conf`	Overlapping repetitions in weighted sequence. CUBE Ali Alatabbi, Maxime Crochemore, Costas S. Iliopoulos, Tewogboye A. Okanlawon
2012	J	`jnl`	Quasiperiodicities in Fibonacci strings CoRR Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
2012	B	`conf`	The Maximum Number of Squares in a Tree. CPM Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
2012	J	`jnl`	The Rightmost Equal-Cost Position Problem CoRR Maxime Crochemore, Alessio Langiu, Filippo Mignosi
2012	J	`jnl`	The maximal number of cubic runs in a word. J. Comput. Syst. Sci. Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2012	J	`jnl`	Using minimal absent words to build phylogeny. Theor. Comput. Sci. Supaporn Chairungsee, Maxime Crochemore
2011	C	`conf`	Building Phylogeny with Minimal Absent Words. CIAA Supaporn Chairungsee, Maxime Crochemore
2011	J	`jnl`	Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081). Dagstuhl Reports Maxime Crochemore, Lila Kari, Mehryar Mohri, Dirk Nowotka
2011	C	`conf`	Computing All Subtree Repeats in Ordered Ranked Trees. SPIRE Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
2011	J	`jnl`	Computing Longest Previous non-overlapping Factors. Inf. Process. Lett. Maxime Crochemore, German Tischler
2011	J	`jnl`	Efficient Seeds Computation Revisited CoRR Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2011	B	`conf`	Efficient Seeds Computation Revisited. CPM Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
2011	—	`conf`	Finite-Repetition threshold for infinite ternary words WORDS Golnaz Badkobeh, Maxime Crochemore
2011	C	`conf`	Hunting Redundancies in Strings. Developments in Language Theory Golnaz Badkobeh, Supaporn Chairungsee, Maxime Crochemore
2011	Misc	`conf`	On the Right-Seed Array of a String. COCOON Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis
2011	J	`jnl`	Periodic-Finite-Type Shift Spaces. IEEE Trans. Inf. Theory Marie-Pierre Béal, Maxime Crochemore, Bruce E. Moision, Paul H. Siegel
2011	J	`jnl`	Reactive automata. Inf. Comput. Maxime Crochemore, Dov M. Gabbay
2011	J	`jnl`	The "runs" conjecture. Theor. Comput. Sci. Maxime Crochemore, Lucian Ilie, Liviu Tinta
2010	—	`conf`	A Parallel Algorithm for Fixed-Length Approximate String-Matching with Algorithms and Applications Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis
2010	B	`conf`	Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010	Misc	`conf`	Bounded Number of Squares in Infinite Repetition-Constrained Binary Words. PSC Golnaz Badkobeh, Maxime Crochemore
2010	B	`conf`	Cover Array String Reconstruction. CPM Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler
2010	C	`conf`	Dictionary-Symbolwise Flexible Parsing. IWOCA Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo
2010	B	`conf`	Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. SOFSEM Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2010	C	`conf`	Extracting Powers and Periods in a String from Its Runs Structure. SPIRE Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010	J	`jnl`	Fast computation of a longest increasing subsequence and application. Inf. Comput. Maxime Crochemore, Ely Porat
2010	J	`jnl`	Finding Patterns In Given Intervals. Fundam. Informaticae Maxime Crochemore, Marcin Kubica, Tomasz Walen, Costas S. Iliopoulos, M. Sohel Rahman
2010	Misc	`conf`	New Simple Efficient Algorithms Computing Powers and Runs in Strings. PSC Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen
2010	J	`jnl`	Number of Occurrences of powers in Strings. Int. J. Found. Comput. Sci. Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera
2010	C	`conf`	On the Maximal Number of Cubic Runs in a String. LATA Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010	C	`conf`	On the Maximal Sum of Exponents of Runsin a String. IWOCA Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010	J	`jnl`	On the maximal sum of exponents of runs in a string CoRR Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2010	Misc	`conf`	Reactive Links to Save Automata States. PSC Maxime Crochemore, Dov M. Gabbay
2010	C	`conf`	The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching. SPIRE Maxime Crochemore, German Tischler
2009	J	`jnl`	From Nerode's congruence to suffix automata with mismatches. Theor. Comput. Sci. Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi
2009	C	`conf`	LPF Computation Revisited. IWOCA Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
2009	J	`jnl`	On the maximal number of highly periodic runs in a string CoRR Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2009	Misc	`conf`	On-line Construction of a Small Automaton for a Finite Set of Words. PSC Maxime Crochemore, Laura Giambruno
2009	J	`jnl`	Repetitions in strings: Algorithms and combinatorics. Theor. Comput. Sci. Maxime Crochemore, Lucian Ilie, Wojciech Rytter
2009	A	`conf`	Reverse Engineering Prefix Tables. STACS Julien Clément, Maxime Crochemore, Giuseppina Rindone
2009	—	`ch.`	Suffix Tree. Encyclopedia of Database Systems Maxime Crochemore, Thierry Lecroq
2009	—	`ch.`	Trie. Encyclopedia of Database Systems Maxime Crochemore, Thierry Lecroq
2008	B	`conf`	A Simple Algorithm for Computing the Lempel Ziv Factorization. DCC Maxime Crochemore, Lucian Ilie, William F. Smyth
2008	—	`ch.`	Alignments and Approximate String Matching. New Developments in Formal Languages and Applications Maxime Crochemore, Thierry Lecroq
2008	J	`jnl`	Approximating the 2-interval pattern problem. Theor. Comput. Sci. Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette
2008	C	`conf`	Bounds on Powers in Strings. Developments in Language Theory Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera
2008	J	`jnl`	Computing Longest Previous Factor in linear time and applications. Inf. Process. Lett. Maxime Crochemore, Lucian Ilie
2008	—	`conf`	Computing a Longest Increasing Subsequence of Length k in Time O(n log log k). BCS Int. Acad. Conf. Maxime Crochemore, Ely Porat
2008	Misc	`conf`	Conservative String Covering of Indeterminate Strings. PSC Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau
2008	J	`jnl`	External Memory Algorithms for String Problems. Fundam. Informaticae Kangho Roh, Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park
2008	J	`jnl`	Foreword. Math. Comput. Sci. Joseph Wun-Tat Chan, Maxime Crochemore
2008	A	`conf`	Improved Algorithms for the Range Next Value Problem and Applications. STACS Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen
2008	J	`jnl`	Maximal repetitions in strings. J. Comput. Syst. Sci. Maxime Crochemore, Lucian Ilie
2008	—	`conf`	On the Longest Common Factor Problem. IFIP TCS Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi
2008	J	`jnl`	Optimal prefix and suffix queries on texts. Inf. Process. Lett. Maxime Crochemore, Costas S. Iliopoulos, Mohammad Sohel Rahman
2008	—	`ch.`	Sequential Exact String Matching. Encyclopedia of Algorithms Maxime Crochemore, Thierry Lecroq
2008	—	`ch.`	Sequential Multiple String Matching. Encyclopedia of Algorithms Maxime Crochemore, Thierry Lecroq
2008	—	`ch.`	Squares and Repetitions. Encyclopedia of Algorithms Maxime Crochemore, Wojciech Rytter
2008	B	`conf`	Towards a Solution to the "Runs" Conjecture. CPM Maxime Crochemore, Lucian Ilie, Liviu Tinta
2008	A	`conf`	Understanding Maximal Repetitions in Strings. STACS Maxime Crochemore, Lucian Ilie
2008	J	`jnl`	Understanding maximal repetitions in strings CoRR Maxime Crochemore, Lucian Ilie
2007	—	`book`	Algorithms on strings. Maxime Crochemore, Christophe Hancart, Thierry Lecroq
2007	J	`jnl`	All maximal-pairs in step-leap representation of melodic sequence. Inf. Sci. Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
2007	B	`conf`	Analysis of Maximal Repetitions in Strings. MFCS Maxime Crochemore, Lucian Ilie
2007	C	`conf`	Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. LATA Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo
2007	B	`conf`	Finding Patterns in Given Intervals. MFCS Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman
2007	B	`conf`	Minimizing local automata. ISIT Marie-Pierre Béal, Maxime Crochemore
2007	C	`conf`	On the Suffix Automaton with Mismatches. CIAA Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi
2007	J	`jnl`	The Structure of Factor Oracles. Int. J. Found. Comput. Sci. Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi
2006	C	`conf`	Factor Oracles. CIAA Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi
2006	J	`jnl`	Longest repeats with a block of Theor. Comput. Sci. Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
2006	—	`ch.`	Text Searching and Indexing. Recent Advances in Formal Languages and Applications Maxime Crochemore, Thierry Lecroq
2005	—	`conf`	A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories. ISMIR Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
2005	J	`jnl`	A note on the Burrows - CWheeler transformation. Theor. Comput. Sci. Maxime Crochemore, Jacques Désarménien, Dominique Perrin
2005	J	`jnl`	A note on the Burrows-Wheeler transformation CoRR Maxime Crochemore, Jacques Désarménien, Dominique Perrin
2005	A	`conf`	Approximating the 2-Interval Pattern Problem. ESA Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette
2005	J	`jnl`	Bases of Motifs for Generating Repeated Patterns with Wild Cards. IEEE ACM Trans. Comput. Biol. Bioinform. Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
2005	J	`jnl`	Bit-parallel ( J. Discrete Algorithms Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzón, Alejandro Salinger
2005	B	`ed.`	Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings CPM Alberto Apostolico, Maxime Crochemore, Kunsoo Park
2005	J	`jnl`	Foreword. J. Discrete Algorithms Ricardo A. Baeza-Yates, Maxime Crochemore
2005	J	`jnl`	Presentations of constrained systems with unconstrained positions. IEEE Trans. Inf. Theory Marie-Pierre Béal, Maxime Crochemore, Gabriele Fici
2004	B	`conf`	A Trie-Based Approach for Compacting Automata. CPM Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi
2004	C	`conf`	Longest Motifs with a Functionally Equivalent Central Block. SPIRE Maxime Crochemore, Raffaele Giancarlo, Marie-France Sagot
2004	B	`conf`	Longest Repeats with a Block of Don't Cares. LATIN Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
2004	J	`jnl`	Two-dimensional pattern matching with rotations. Theor. Comput. Sci. Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps
2003	B	`conf`	A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. MFCS Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
2003	C	`conf`	A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. SPIRE Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzón
2003	J	`jnl`	A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices. SIAM J. Comput. Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson
2003	J	`jnl`	A unifying look at the Apostolico-Giancarlo string-matching algorithm. J. Discrete Algorithms Maxime Crochemore, Christophe Hancart, Thierry Lecroq
2003	B	`ed.`	Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings CPM Ricardo A. Baeza-Yates, Edgar Chávez, Maxime Crochemore
2003	J	`jnl`	Computing forbidden words of regular languages. Fundam. Informaticae Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino
2003	J	`jnl`	Directed acyclic subsequence graph - Overview. J. Discrete Algorithms Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek
2003	J	`jnl`	Occurrence and Substring Heuristics for i-Matching. Fundam. Informaticae Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq
2003	J	`jnl`	Reducing space for index implementation. Theor. Comput. Sci. Maxime Crochemore
2003	J	`jnl`	Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. Fundam. Informaticae Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
2003	B	`conf`	Two-Dimensional Pattern Matching with Rotations. CPM Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps
2003	J	`jnl`	Waiting time and complexity for matching patterns with automata. Inf. Process. Lett. Maxime Crochemore, Valery T. Stefanov
2002	A*	`conf`	A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. SODA Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson
2002	J	`jnl`	Algorithms for Computing Approximate Repetitions in Musical Sequences. Int. J. Comput. Math. Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzón
2002	J	`jnl`	Approximate String Matching with Gaps. Nord. J. Comput. Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, Kostas Tsichlas
2002	—	`conf`	Improved Antidictionary Based Compression. SCCC Maxime Crochemore, Gonzalo Navarro
2002	—	`book`	Jewels of stringology. Maxime Crochemore, Wojciech Rytter
2002	C	`conf`	On the Implementation of Compact DAWG's. CIAA Jan Holub, Maxime Crochemore
2002	C	`conf`	On the Size of DASG for Multiple Texts. SPIRE Maxime Crochemore, Zdenek Tronícek
2002	B	`conf`	Three Heuristics for delta-Matching: delta-BM Algorithms. CPM Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
2001	J	`jnl`	A fast and practical bit-vector algorithm for the Longest Common Subsequence problem. Inf. Process. Lett. Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón, James F. Reid
2001	Misc	`conf`	Approximate String Matching in Musical Sequences. PSC Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzón
2001	J	`jnl`	Computing Evolutionary Chains in Musical Sequences. Electron. J. Comb. Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
2001	B	`conf`	Efficient Experimental String Matching by Weak Factor Recognition. CPM Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot
2001	C	`conf`	Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. SPIRE Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
2000	J	`jnl`	Data compression using antidictionaries. Proc. IEEE Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi
2000	B	`conf`	Fast Evolutionary Chains. SOFSEM Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
2000	—	`conf`	Finding Motifs with Gaps. ISMIR Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
1999	B	`ed.`	Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings CPM Maxime Crochemore, Mike Paterson
1999	J	`jnl`	Constant-Space String-Matching in Sublinear Average Time. Theor. Comput. Sci. Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter
1999	B	`conf`	Factor Oracle: A New Structure for Pattern Matching. SOFSEM Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot
1999	J	`jnl`	Fast Practical Multi-Pattern Matching. Inf. Process. Lett. Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
1999	—	`ch.`	Pattern Matching in Strings. Algorithms and Theory of Computation Handbook Maxime Crochemore, Christophe Hancart
1999	A*	`conf`	Text Compression Using Antidictionaries. ICALP Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi
1999	—	`ch.`	Text Data Compression Algorithms. Algorithms and Theory of Computation Handbook Maxime Crochemore, Thierry Lecroq
1999	J	`jnl`	Zones of Low Entropy in Genomic Sequences. Comput. Chem. Maxime Crochemore, Renaud Vérin
1998	J	`jnl`	A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. SIAM J. Comput. Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter
1998	J	`jnl`	Automata and Forbidden Words. Inf. Process. Lett. Maxime Crochemore, Filippo Mignosi, Antonio Restivo
1998	B	`conf`	Minimal Forbidden Words and Factor Automata. MFCS Maxime Crochemore, Filippo Mignosi, Antonio Restivo
1998	J	`jnl`	Two-Dimensional Prefix String Matching and Covering on Square Matrices. Algorithmica Maxime Crochemore, Costas S. Iliopoulos, Maureen Korda
1997	—	`ch.`	Automata for Matching Patterns. Handbook of Formal Languages (2) Maxime Crochemore, Christophe Hancart
1997	J	`jnl`	Constant-Time Randomized Parallel String Matching. SIAM J. Comput. Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter
1997	—	`conf`	Constant-space string-matching in sublinear average time. SEQUENCES Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter
1997	B	`conf`	Direct Construction of Compact Directed Acyclic Word Graphs. CPM Maxime Crochemore, Renaud Vérin
1997	—	`ch.`	Off-line serial exact string searching. Pattern Matching Algorithms Maxime Crochemore
1997	—	`conf`	On Compact Directed Acyclic Word Graphs. Structures in Logic and Computer Science Maxime Crochemore, Renaud Vérin
1997	—	`ch.`	Pattern Matching and Text Compression Algorithms. The Computer Science and Engineering Handbook Maxime Crochemore, Thierry Lecroq
1997	J	`jnl`	Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm. Inf. Process. Lett. Maxime Crochemore, Thierry Lecroq
1996	B	`conf`	Boyer-Moore Strategy to Efficient Approximate String Matching. CPM Nadia El-Mabrouk, Maxime Crochemore
1996	J	`jnl`	Pattern-Matching and Text-Compression Algorithms. ACM Comput. Surv. Maxime Crochemore, Thierry Lecroq
1995	J	`jnl`	Fast Parallel Lyndon Factorization with Applications. Math. Syst. Theory Alberto Apostolico, Maxime Crochemore
1995	B	`conf`	On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. LATIN Maxime Crochemore, Wojciech Rytter
1995	J	`jnl`	Squares, Cubes, and Time-Space Efficient String Searching. Algorithmica Maxime Crochemore, Wojciech Rytter
1995	A	`conf`	Two-Dimensional Pattern Matching in Linear Time and Small Space. STACS Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
1994	B	`ed.`	Combinatorial Pattern Matching, 5th Annual Symposium, CPM 94, Asilomar, California, USA, June 5-8, 1994, Proceedings CPM Maxime Crochemore, Dan Gusfield
1994	J	`jnl`	On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. Theor. Comput. Sci. Maxime Crochemore, Wojciech Rytter
1994	J	`jnl`	Speeding Up Two String-Matching Algorithms. Algorithmica Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
1994	—	`book`	Text Algorithms Maxime Crochemore, Wojciech Rytter
1993	B	`ed.`	Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings CPM Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
1993	A*	`conf`	Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions FOCS Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter
1993	J	`jnl`	Two-Dimensional Pattern Matching by Sampling. Inf. Process. Lett. Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter
1992	J	`jnl`	A String-Matching Interpretation of the Equation xmyn = zp. Theor. Comput. Sci. Jean Néraud, Maxime Crochemore
1992	B	`ed.`	Combinatorial Pattern Matching, Third Annual Symposium, CPM 92, Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings CPM Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
1992	—	`conf`	Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. ICPIA Maxime Crochemore, Wojciech Rytter
1992	A	`conf`	Speeding Up Two String-Matching Algorithms. STACS Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter
1992	J	`jnl`	String-Matching on Ordered Alphabets. Theor. Comput. Sci. Maxime Crochemore
1991	J	`jnl`	Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings. Inf. Process. Lett. Maxime Crochemore, Wojciech Rytter
1991	J	`jnl`	Mutually Avoiding Ternary Words of Small Exponent. Int. J. Algebra Comput. Maxime Crochemore, Pavel Goralcik
1991	J	`jnl`	On the Parallel Recognition of Unambiguous Context-Free Languages. Theor. Comput. Sci. Michal Chytil, Maxime Crochemore, Burkhard Monien, Wojciech Rytter
1991	J	`jnl`	Optimal Canonization of All Substrings of a String Inf. Comput. Alberto Apostolico, Maxime Crochemore
1991	J	`jnl`	Two-Way String Matching. J. ACM Maxime Crochemore, Dominique Perrin
1991	J	`jnl`	Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays. Theor. Comput. Sci. Maxime Crochemore, Wojciech Rytter
1990	A	`conf`	Parallel Computations on Strings and Arrays. STACS Maxime Crochemore, Wojciech Rytter
1990	B	`conf`	Parallel Construction of Minimal Suffix and Factor Automata. MFCS Maxime Crochemore, Wojciech Rytter
1990	J	`jnl`	Parallel Construction of Minimal Suffix and Factor Automata. Inf. Process. Lett. Maxime Crochemore, Wojciech Rytter
1990	—	`conf`	Unitary Monoid with Two Generators: An Algorithmic Point of View. CAAP Maxime Crochemore, Jean Néraud
1989	J	`jnl`	String-matching and periods. Bull. EATCS Maxime Crochemore
1989	J	`jnl`	Thue-Morse sequence and p-adic topology for the free monoid. Discret. Math. Jean Berstel, Maxime Crochemore, Jean-Eric Pin
1988	—	`conf`	Algorithms and automata. Formal Properties of Finite Automata and Applications Maxime Crochemore
1988	—	`conf`	Constant-Space String-Matching. FSTTCS Maxime Crochemore
1988	J	`jnl`	Critical factorizations of words. Bull. EATCS Maxime Crochemore, Dominique Perrin
1988	B	`conf`	String Matching with Constraints. MFCS Maxime Crochemore
1987	—	`conf`	Data Compression with Substitution. Electronic Dictionaries and Automata in Computational Linguistics Maxime Crochemore
1987	—	`conf`	Longest Common Factor of Two Words. TAPSOFT, Vol.1 Maxime Crochemore
1986	J	`jnl`	Calcul de La Distance Par Les Sous-Mots. RAIRO Theor. Informatics Appl. Jean-Jacques Hébrard, Maxime Crochemore
1986	J	`jnl`	Computing LCF in linear time. Bull. EATCS Maxime Crochemore
1986	J	`jnl`	Transducers and Repetitions. Theor. Comput. Sci. Maxime Crochemore
1984	A*	`conf`	Linear Searching for a Squre in a Word (Abstract). ICALP Maxime Crochemore
1983	J	`jnl`	An Optimal Test on Finite Unavoidable Sets of Words. Inf. Process. Lett. Maxime Crochemore, Michael Le Rest, Philippe Wender
1982	J	`jnl`	Partitioning a Graph in O(\|A\| log2 \|V\|). Theor. Comput. Sci. A. Cardon, Maxime Crochemore
1982	J	`jnl`	Sharp Characterizations of Squarefree Morphisms. Theor. Comput. Sci. Maxime Crochemore
1981	J	`jnl`	An Optimal Algorithm for Computing the Repetitions in a Word. Inf. Process. Lett. Maxime Crochemore
1980	J	`jnl`	Détermination de la Représentation Standard d'une Série Reconnaissable. RAIRO Theor. Informatics Appl. A. Cardon, Maxime Crochemore