@TECHREPORT(CC78a,
  author =      {Alain Cardon and Maxime Crochemore},
  title =       {Minimisation d'automates et algorithme de {H}opcroft},
  type =        {Rapport du Laboratoire d'Informatique 78-02},
  institution = {Universit{\'e} de Haute-Normandie},
  year =        {1978},
)

@TECHREPORT(CC78b,
  author =      {Alain Cardon and Maxime Crochemore},
  title =       {Deux applications du tri lexicographique},
  type =        {Rapport du Laboratoire d'Informatique 78-03},
  institution = {Universit{\'e} de Haute-Normandie},
  year =        {1978},
)

@PHDTHESIS(CC78these,
  author =      {Alain Cardon and Maxime Crochemore},
  title =       {Standardisation de s{\'e}ries formelles et minimisation d'automates},
  type =        {Th{\`e}se de 3-{\`eme} cycle},
  school =      {Universit{\'e} de Haute-Normandie},
  year =        {4 d\'ecembre 1978},
)

@INCOLLECTION(Cro80litp,
  author =      {Maxime Crochemore},
  title =       {Simulation des automates d{\'e}terministes {\`a} pile d'apr{\`e}s {C}ook et {J}ones},
  booktitle =   {Actes du s{\'e}minaire d'informatique th{\'e}orique du {L.I.T.P.}},
  publisher =   {Universit{\'e}s Paris 6-7},
  year =        {1980},
)

@ARTICLE(CC80rairo,
  author =      {Alain Cardon and Maxime Crochemore},
  title =       {D{\'e}termination de la repr{\'e}\-sen\-tation standard d'une s{\'e}rie reconnaissable},
  journal =     {RAIRO Informatique Th{\'e}orique/Theoretical Informatics},
  volume =      {14},
  number =      {4},
  year =        {1980},
  pages =       {371--379},
)

@ARTICLE(Cro81ipl,
  author =      {Maxime Crochemore},
  title =       {An optimal algorithm for computing the repetitions in a word},
  journal =     {Information Processing Letters},
  volume =      {12},
  number =      {5},
  year =        {1981},
  pages =       {244--250},
)

@ARTICLE(Cro82tcs,
  author =      {Maxime Crochemore},
  title =       {Sharp characterization of square-free morphisms},
  journal =     {Theoretical Computer Science},
  volume =      {18},
  number =      {2},
  year =        {1982},
  pages =       {221--226},
)

@ARTICLE(CC82tcs-2,
  author =      {Alain Cardon and Maxime Crochemore},
  title =       {Partitioning a graph in {$O(|A|\log_2|V|)$}},
  journal =     {Theoretical Computer Science},
  volume =      {19},
  number =      {1},
  year =        {1982},
  pages =       {85--98},
)

@TECHREPORT(Cro82litp,
  author =      {Maxime Crochemore},
  title =       {R{\'e}sultats de d{\'e}cidabilit{\'e} pour les morphismes faiblement sans carr{\'e}},
  type =        {Rapport {L.I.T.P.} 82-38},
  institution = {Universit{\'e}s Paris 6-7},
  year =        {1982},
)

@TECHREPORT(Cro82litp-2,
  author =      {Maxime Crochemore},
  title =       {Sur les ensembles in{\'e}vitables},
  type =        {Rapport {L.I.T.P.} 82-56},
  institution = {Universit{\'e}s Paris 6-7},
  year =        {1982},
)

@ARTICLE(Cro82eatcs,
  author =      {Maxime Crochemore},
  title =       {A solution to {Berstel}'s problem {P3}},
  journal =     {Bul. Euro. Assoc. Theor. Comput. Sci.},
  volume =      {18},
  year =        {1982},
  pages =       {9--11},
)

@INCOLLECTION(Cro83cow,
  author =      {Maxime Crochemore},
  title =       {Tests sur les morphismes faiblement sans carr{\'e}},
  booktitle =   {Combinatorics on Words (Waterloo, Ont., 1982)},
  year =        {1983},
  pages =       {63--89},
  editor =      {L. Cummings},
  publisher =   {Academic Press},
)

@ARTICLE(Cro83eatcs,
  author =      {Maxime Crochemore},
  title =       {A solution to {P12}},
  journal =     {Bul. Euro. Assoc. Theor. Comput. Sci.},
  volume =      {19},
  year =        {1983},
  pages =       {15--16},
)

@ARTICLE(CLW83ipl,
  author =      {Maxime Crochemore and Michel Lerest and Philippe Wender},
  title =       {An optimal test on finite unavoidable sets of words},
  journal =     {Information Processing Letters},
  volume =      {16},
  number =      {4},
  year =        {1983},
  pages =       {179--180},
)

@ARTICLE(Cro83cras,
  author =      {Maxime Crochemore},
  title =       {Recherche lin{\'e}aire d'un carr{\'e} dans un mot},
  journal =     {C. R. Acad. Sc. Paris S\'er. I Math.},
  volume =      {296},
  number =      {18},
  year =        {1983},
  pages =       {781--784},
)

@PHDTHESIS(Cro83theseetat,
  author =      {Maxime Crochemore},
  title =       {R{\'e}gularit{\'e}s {\'e}vitables},
  type =        {Th{\`e}se d'{\'e}tat},
  school =      {Universit{\'e} de Haute-Normandie},
  year =        {20 juin 1983},
)

@INPROCEEDINGS(Cro83comb,
  author =      {Maxime Crochemore},
  title =       {Mots et morphismes sans carr{\'e}},
  booktitle =   {Combinatorial Mathematics (Marseille-Luminy, 1981)},
  series =      {Math. Stud.},
  number =      {75},
  year =        {1983},
  pages =       {235--245},
  publisher =   {North-Holland},
)

@ARTICLE(Cro84eatcs,
  author =      {Maxime Crochemore},
  title =       {Linear searching for a square in a word},
  journal =     {Bul. Euro. Assoc. Theor. Comput. Sci.},
  volume =      {24},
  year =        {1984},
  pages =       {66--72},
  note =        {Presented at ICALP'84. Abstract in \textit{Automata, Languages and Programming},
                 LNCS 172, pp. 137. Springer, Berlin, 1984},
)

@INPROCEEDINGS(Cro85caow,
  author =      {Maxime Crochemore},
  title =       {Optimal factor transducers},
  booktitle =   {Combinatorial Algorithms on Words (Maratea, 1984)},
  series =      {NATO Adv. Sci. Inst. Ser. F, Comput. Systems Sci.},
  number =      {12},
  year =        {1985},
  pages =       {31--43},
  editor =      {A. Apostolico and Z. Galil},
  publisher =   {Springer-Verlag},
)

@ARTICLE(CH86ita,
  author =      {Jean-Jacques H{\'e}brard and Maxime Crochemore},
  title =       {Calcul de la distance par les sous-mots},
  journal =     {Informatique th{\'e}orique et applications/Theoretical Informatics and Applications},
  volume =      {20},
  number =      {4},
  year =        {1986},
  pages =       {441--456},
)

@ARTICLE(Cro86tcs,
  author =      {Maxime Crochemore},
  title =       {Transducers and repetitions},
  journal =     {Theoretical Computer Science},
  volume =      {45},
  number =      {1},
  year =        {1986},
  pages =       {63--86},
)

@PROCEEDINGS(CS86ifia,
  editor =      {Maxime Crochemore and Ahmed Saoudi},
  title =       {Actes des journ\'ees Informatique Fondamentale et
                 Intelligence Artificielle (Villetaneuse, 1986)},
  year =        {1986},
  publisher =   {Universit{\'e} Paris-Nord},
)

@INPROCEEDINGS(Cro86litp,
  author =      {Maxime Crochemore},
  title =       {Calcul de la f-distance de deux mots},
  booktitle =   {Actes du s{\'e}minaire d'informatique th{\'e}orique du {L.I.T.P.}},
  pages =       {25--36},
  year =        {1986},
  publisher =   {Universit{\'e}s Paris 6-7},
)

@ARTICLE(Cro86eatcs,
  author =      {Maxime Crochemore},
  title =       {Computing {LCF} in linear time},
  journal =     {Bul. Euro. Assoc. Theor. Comput. Sci.},
  volume =      {30},
  year =        {1986},
  pages =       {57--61},
)

@TECHREPORT(CP87ladl,
  author =      {Maxime Crochemore and Jean-Pierre P{\'e}cuchet},
  title =       {Compression de dictionnaires},
  type =        {Rapport {L.A.D.L.}},
  institution = {Universit{\'e} Paris 7},
  year =        {1987},
)

@INCOLLECTION(Cro87tapsoft,
  author =      {Maxime Crochemore},
  title =       {Longest common factor of two words},
  booktitle =   {TAPSOFT'87 (Pisa, 1987)},
  series =      {LNCS},
  number =      {249},
  year =        {1987},
  pages =       {26--36},
  editor =      {Ehrig and Kowalski and Levi and Montanari},
  publisher =   {Springer-Verlag},
)

@TECHREPORT(CP87ladl-2,
  author =      {Maxime Crochemore and Jean-Pierre P{\'e}cuchet},
  title =       {R{\'e}duction d'un lexique pour micro-ordinateur},
  type =        {Rapport {L.A.D.L.}},
  institution = {Universit{\'e} Paris 7},
  year =        {1987},
)

@PROCEEDINGS(CS87ifia,
  editor =      {Maxime Crochemore and Ahmed Saoudi},
  title =       {Actes des journ\'ees Informatique Fondamentale et
                 Intelligence Artificielle (Villetaneuse, 1987)},
  year =        {1987},
  publisher =   {Universit{\'e} Paris-Nord},
)

@INPROCEEDINGS(CP88ciap,
  author =      {Maxime Crochemore and Dominique Perrin},
  title =       {Pattern matching in strings},
  booktitle =   {Proceedings of the 4th conference on Image Analysis and Processing
                 (Cefal\`u, 1988)},
  series =      {LNCS},
  number =      {249},
  year =        {1988},
  pages =       {67--79},
  editor =      {V. Cantoni and V. Di Gesu and S. Levialdi},
  publisher =   {Plenum Press},
)

@ARTICLE(CP88eatcs,
  author =      {Maxime Crochemore and Dominique Perrin},
  title =       {Critical factorizations of words},
  journal =     {Bul. Euro. Assoc. Theor. Comput. Sci.},
  volume =      {34},
  year =        {1988},
  pages =       {47--52},
)

@TECHREPORT(Cro88lipn,
  author =      {Maxime Crochemore},
  title =       {Compression de textes: les m{\'e}thodes},
  type =        {Rapport {L.I.P.N.} 88-4},
  institution = {Universit{\'e} Paris-Nord},
  year =        {1988},
)

@INPROCEEDINGS(Cro88mfcs,
  author =      {Maxime Crochemore},
  title =       {String Matching with Contraints},
  booktitle =   {Mathematical Foundations of Computer Science 1988 (Carlsbad, 1988)},
  series =      {LNCS},
  number =      {324},
  year =        {1988},
  pages =       {44--58},
  editor =      {M. Chytil and L. Janiga and S. Koubek},
  publisher =   {Springer-Verlag},
)

@INPROCEEDINGS(Cro88fsttcs,
  author =      {Maxime Crochemore},
  title =       {Constant-Space String Matching},
  booktitle =   {Foundations of Software Technology, Theoretical Computer Science
                 (Puna, 1988)},
  series =      {LNCS},
  number =      {338},
  year =        {1988},
  pages =       {80--87},
  editor =      {Nori and Kumar},
  publisher =   {Springer-Verlag},
)

@ARTICLE(BCP89adm,
  author =      {Jean Berstel and Maxime Crochemore and Jean-Eric Pin},
  title =       {Thue-Morse sequence and $p$-adic topology of the free monoid},
  journal =     {Annals of Discrete Mathematics},
  volume =      {76},
  number =      {2},
  year =        {1989},
  pages =       {89--94},
)

@INPROCEEDINGS(Cro89elecdic,
  author =      {Maxime Crochemore},
  title =       {Data compression with substitution},
  booktitle =   {Electronic Dictionaries and Automata in Computational Linguistics
                 (Ol\'eron, 1987)},
  series =      {LNCS},
  number =      {377},
  year =        {1989},
  pages =       {1--16},
  editor =      {M. Gross and D. Perrin},
  publisher =   {Springer-Verlag},
)

@INPROCEEDINGS(Cro89finaut,
  author =      {Maxime Crochemore},
  title =       {Automata and algorithms},
  booktitle =   {Formal Properties of Finite Automata and Applications
                 (Ramatuelle, 1988)},
  series =      {LNCS},
  number =      {386},
  year =        {1989},
  pages =       {166--175},
  editor =      {J-E. Pin},
  publisher =   {Springer-Verlag},
)

@TECHREPORT(CZ89litp,
  author =      {Maxime Crochemore and Marc Zipstein},
  title =       {Transducteurs arithm{\'e}tiques},
  type =        {Rapport {L.I.T.P.} 89-12},
  institution = {Universit{\'e}s Paris 6-7},
  year =        {1989},
)

@ARTICLE(Cro89eatcs,
  author =      {Maxime Crochemore},
  title =       {String-matching and periods},
  journal =     {Bul. Euro. Assoc. Theor. Comput. Sci.},
  volume =      {39},
  year =        {1989},
  pages =       {149--153},
)

@INPROCEEDINGS(Cro90seq,
  author =      {Maxime Crochemore},
  title =       {Note on constant-space string matching},
  booktitle =   {Sequences: Combinatorics, Compression, Security, and Transmission
                 (Positano, 1988)},
  year =        {1990},
  editor =      {R. Capocelli},
  publisher =   {Springer-Verlag},
)

@INPROCEEDINGS(CR90stacs,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {Parallel computations on strings and arrays},
  booktitle =   {STACS'90 (Rouen, 1990)},
  series =      {LNCS},
  number =      {415},
  year =        {1990},
  pages =       {109--125},
  editor =      {C. Choffrut and T. Lengauer},
  publisher =   {Springer-Verlag},
)

@INPROCEEDINGS(CN90caap,
  author =      {Maxime Crochemore and Jean N{\'e}raud},
  title =       {Unitary monoid with two generators: an algorithmic point of view},
  booktitle =   {CAAP'90, proceedings of the 15th Colloquium on Trees in Algebra and
                 Programming (Copenhagen, 1990)},
  series =      {LNCS},
  number =      {431},
  year =        {1990},
  pages =       {117--131},
  editor =      {A. Arnold},
  publisher =   {Springer-Verlag},
)

@ARTICLE(CR90ipl,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {Parallel construction of minimal suffix and factor automata},
  journal =     {Information Processing Letters},
  volume =      {35},
  number =      {3},
  year =        {1990},
  pages =       {121--128},
)

@INPROCEEDINGS(CR90mfcs,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {Parallel construction of minimal suffix and factor automata},
  booktitle =   {MFCS'90 (Bansk\'a Bistrica, 1990)},
  series =      {LNCS},
  number =      {452},
  year =        {1990},
  pages =       {217--223},
  editor =      {B. Rovan},
  publisher =   {Springer-Verlag},
)

@TECHREPORT(CR90litp,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {Testing square-freeness of strings by an optimal parallel algorithm in logarithmic time},
  type =        {Rapport {L.I.T.P.} 90-63},
  institution = {Universit{\'e}s Paris 6-7},
  year =        {1990},
)

@INPROCEEDINGS(Cro90mons,
  author =      {Maxime Crochemore},
  title =       {A la recherche d'un mot},
  booktitle =   {Actes des Journ{\'e}es Montoises (Mons, 1990)},
  year =        {1990},
  pages =       {34--38},
  editor =      {V. Bruy{\`e}re},
  address =     {Universit{\'e} de Mons-Hainaut, Belgique},
)

@ARTICLE(CCMR91tcs,
  author =      {Maxime Crochemore and Michal Chytil and Burkhard Monien and Wojciech Rytter},
  title =       {On the parallel recognition of unambiguous context-free languages},
  journal =     {Theoretical Computer Science},
  volume =      {81},
  number =      {2},
  year =        {1991},
  pages =       {311--316},
)

@ARTICLE(CR91ipl,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {Efficient parallel algorithms to test square-freeness and factorize strings},
  journal =     {Information Processing Letters},
  volume =      {38},
  number =      {2},
  year =        {1991},
  pages =       {57--60},
)

@ARTICLE(CR91tcs,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {Usefulness of the {K}arp-{M}iller-{R}osenberg algorithm in parallel computations on strings and arrays},
  journal =     {Theoretical Computer Science},
  volume =      {88},
  number =      {1},
  year =        {1991},
  pages =       {59--82},
)

@ARTICLE(AC91ic,
  author =      {Alberto Apostolico and Maxime Crochemore},
  title =       {Optimal canonization of all substrings of a string},
  journal =     {Information and Computation},
  volume =      {95},
  number =      {1},
  year =        {1991},
  pages =       {76--95},
)

@ARTICLE(CP91jacm,
  author =      {Maxime Crochemore and Dominique Perrin},
  title =       {Two-way string-matching},
  journal =     {J. Assoc. Comput. Mach.},
  volume =      {38},
  number =      {3},
  year =        {1991},
  pages =       {651--675},
)

@ARTICLE(CG91ijac,
  author =      {Maxime Crochemore and Pavel Goralcik},
  title =       {Mutually avoiding ternary words of small exponent},
  journal =     {International Journal of Algebra and Computation},
  volume =      {1},
  number =      {4},
  year =        {1991},
  pages =       {407--410},
)

@PROCEEDINGS(Cro92cpm,
  editor =      {Maxime Crochemore},
  title =       {Combinatorial Pattern Matching (Paris, 1990)},
  publisher =   {Elsevier},
  year =        {1992},
  note =        {Special issue of {\it Theoretical Computer Science}, volume 92(1)},
)

@ARTICLE(Cro92tcs,
  author =      {Maxime Crochemore},
  title =       {String-Matching on Ordered Alphabets},
  journal =     {Theoretical Computer Science},
  volume =      {92},
  number =      {1},
  year =        {1992},
  pages =       {33--47},
)

@INPROCEEDINGS(CCGJLPR92stacs,
  author =      {Maxime Crochemore and Artur Czumaj and Leszek G\c{a}sieniec
                 and Stefan Jarominek and Thierry Lecroq and Wojciech Plandowski
                 and Wojciech Rytter},
  title =       {Speeding up two string-matching algorithms},
  booktitle =   {STACS'92 (Cachan, 1992)},
  series =      {LNCS},
  number =      {577},
  year =        {1992},
  pages =       {589--600},
  editor =      {A. Finkel and M. Jantzen},
  publisher =   {Springer-Verlag},
)

@INPROCEEDINGS(CCGJLPR92auto,
  author =      {Maxime Crochemore and Artur Czumaj and Leszek G\c{a}sieniec
                 and Stefan Jarominek and Thierry Lecroq and Wojciech Plandowski
                 and Wojciech Rytter},
  title =       {Deux m{\'e}thodes pour acc{\'e}l{\'e}rer l'algorithme de {B}oyer-{M}oore},
  booktitle =   {Th{\'e}orie des automates et applications, Universit{\'e} de Rouen},
  year =        {1992},
  pages =       {45--63},
  editor =      {D. Krob},
  publisher =   {Universit{\'e} de Rouen},
)

@ARTICLE(CN92tcs,
  author =      {Jean N{\'e}raud and Maxime Crochemore},
  title =       {A string-matching interpretation of the equation $x^my^n=z^p$},
  journal =     {Theoretical Computer Science},
  volume =      {92},
  number =      {1},
  year =        {1992},
  pages =       {145--164},
)

@PROCEEDINGS(ACGM92cpm,
  editor =      {Alberto Apostolico and Maxime Crochemore and Zvi Galil and Udi Manber},
  title =       {Combinatorial Pattern Matching (Tucson, Arizona, 1992)},
  series =      {LNCS},
  number =      {644},
  publisher =   {Springer-Verlag},
  year =        {1992},
)

@TECHREPORT(CGR92litp,
  author =      {Maxime Crochemore and Leszek G\c{a}sieniec and Wojciech Rytter},
  title =       {Turbo-{BM}},
  type =        {Rapport {L.I.T.P.} 92.61},
  institution = {Universit{\'e}s Paris 6-7},
  year =        {1992},
)

@INPROCEEDINGS(CR92pia,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {Note on two-dimensional pattern matching by optimal parallel algorithms},
  booktitle =   {Parallel Image Analysis (Ube, 1992)},
  series =      {LNCS},
  number =      {654},
  year =        {1992},
  pages =       {100--112},
  editor =      {A. Nakamura and M. Nivat and A. Saoudi and P. S. P. Wang and K. Inoue},
  publisher =   {Springer-Verlag},
)

@INPROCEEDINGS(ACHP93spaceops,
  author =      {Maxime Crochemore and Jean-Paul Arcangeli
                 and Jean-No{\"e}l Hourcastagnou and Jean-Eric Pin},
  title =       {Compression for an effective management of telemetry data},
  booktitle =   {SPACEOPS'92, Proc. of the Second International Symposium on Ground Data Systems for Space Operations (Pasadena, 1992)},
  type =        {Rapport 93-5},
  year =        {1993},
  pages =       {823--830},
  publisher =   {Jet Propulsion Laboratory Publications},
)

@INCOLLECTION(CPP93cnrs,
  author =      {Maxime Crochemore and Dominique Perrin and Jean-Eric Pin},
  title =       {Les automates finis},
  booktitle =   {Le Courrier du C.N.R.S., la recherche en informatique},
  year =        {1993},
  pages =       {48--51},
  publisher =   {C.N.R.S.},
)

@PROCEEDINGS(CS93ig,
  editor =      {Maxime Crochemore},
  title =       {Informatique et g\'enome (Marne-la-Vall\'ee, 1993)},
  year =        {1993},
  publisher =   {Universit{\'e} de Marne-la-Vall\'ee},
)

@PROCEEDINGS(ACGM93cpm,
  editor =      {Alberto Apostolico and Maxime Crochemore and Zvi Galil and Udi Manber},
  title =       {Combinatorial Pattern Matching (Padova, 1993)},
  series =      {LNCS},
  number =      {684},
  publisher =   {Springer-Verlag},
  year =        {1993},
)

@INCOLLECTION(CR93seq,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {Periodic prefixes in texts},
  booktitle =   {Sequences II (Positano, 1991)},
  editor =      {R. Capocelli, A. De Santis, U. Vaccaro},
  year =        {1993},
  pages =       {153--165},
  publisher =   {Springer-Verlag, New York},
)

@ARTICLE(CGR93ipl,
  author =      {Maxime Crochemore and Leszek G\c{a}sieniec and Wojciech Rytter},
  title =       {Two-dimensional pattern matching by sampling},
  journal =     {Information Processing Letters},
  volume =      {46},
  number =      {4},
  year =        {1993},
  pages =       {159--162},
)

@INPROCEEDINGS(CCGGHMPR93focs,
  author =      {Richard Cole and Maxime Crochemore and Zvi Galil
                 and Leszek G\c{a}sieniec and Ramesh Hariharan and S. Muthukhrishnan
                 and Kunsoo Park and Wojciech Rytter},
  title =       {Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions},
  booktitle =   {34th Annual Symposium on Foundations of Computer Science, FOCS'93
               (Palo Alto, California, 1993)},
  year =        {1993},
  pages =       {248--258},
  publisher =   {{I.E.E.E.}},
)

@TECHREPORT(CCGJLPR93igm,
  author =      {Maxime Crochemore and Artur Czumaj
                 and Leszek G\c{a}sieniec and Stephan Jaromi\-nek
                 and Thierry Lecroq and Wojciech Plandowski and Wojciech Rytter},
  title =       {Fast Multi-Pattern Matching},
  type =        {Rapport {I.G.M.} 93-3},
  institution = {Universit\'e de Marne-la-Vall\'ee},
  year =        {1993},
)

@ARTICLE(CR94btcs,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {On two-dimensional pattern matching by optimal parallel algorithms},
  journal =     {Theoretical Computer Science},
  volume =      {132},
  number =      {1--2},
  year =        {1994},
  pages =       {403--414},
)

@ARTICLE(CCGJLPR94algo,
  author =      {Maxime Crochemore and Artur Czumaj and Leszek G\c{a}sieniec
                 and Stefan Jarominek and Thierry Lecroq and Wojciech Plandowski
                 and Wojciech Rytter},
  title =       {Speeding up two string-matching algorithms},
  journal =     {Algorithmica},
  volume =      {12},
  number =      {4--5},
  year =        {1994},
  pages =       {247--267},
)

@PROCEEDINGS(CG94cpm,
  editor =      {Maxime Crochemore and Dan Gusfield},
  title =       {Combinatorial Pattern Matching (Asilomar, California, 1994)},
  series =      {LNCS},
  number =      {807},
  publisher =   {Springer-Verlag},
  year =        {1994},
)

@BOOK(CR94oup,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {Text algorithms},
  publisher =   {Oxford University Press},
  year =        {1994},
  note =        {412 pages},
)

@ARTICLE(AC95mst,
  author =      {Alberto Apostolico and Maxime Crochemore},
  title =       {Fast parallel Lyndon factorization and applications},
  journal =     {Mathematical System Theory},
  volume =      {28},
  year =        {1995},
  pages =       {89--108},
)

@INPROCEEDINGS(CGPR95stacs,
  author =      {Maxime Crochemore and Leszek G\c{a}sieniec
                 and Wojciech Plandowski and Wojciech Rytter},
  title =       {Two-dimensional pattern matching in linear time and small space},
  booktitle =   {{STACS'95}},
  year =        {1995},
  series =      {LNCS},
  number =      {900},
  pages =       {181--192},
  editor =      {Mayr, E.W. and Puech, C.},
  publisher =   {Springer-Verlag},
)

@INPROCEEDINGS(CR95latin,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching},
  booktitle =   {{LATIN'95} (Valparaiso, 1995)},
  year =        {1995},
  series =      {LNCS},
  number =      {911},
  pages =       {220--229},
  editor =      {Baeza-Yates, R. and Goles, E. and Poblete, P.V.},
  publisher =   {Springer-Verlag},
)

@ARTICLE(CR95algo,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {Squares, cubes and time-space efficient string-searching},
  journal =     {Algorithmica},
  volume =      {13},
  number =      {5},
  pages =       {405--425},
  year =        {1995},
)

@INPROCEEDINGS(CM96cpm,
  author =      {El Mabrouk, Nadia and Maxime Crochemore},
  title =       {{Boyer}-{Moore} strategy to efficient approximate string matching},
  booktitle =   {Combinatorial Pattern Matching (Labuna Beach, California, 1996)},
  year =        {1996},
  series =      {LNCS},
  number =      {1075},
  pages =       {24--38},
  editor =      {Hirschberg, D. and Myers, E.W.},
  publisher =   {Springer-Verlag},
)

@ARTICLE(CL96acm,
  author =      {Maxime Crochemore and Thierry Lecroq},
  title =       {Pattern matching and text compression algorithms},
  journal =     {ACM Computing Surveys},
  year =        {1996},
  volume =      {28, 1},
  pages =       {39--41},
)

@INPROCEEDINGS(CL96wsp,
  author =      {Maxime Crochemore and Thierry Lecroq},
  title =       {Tight bounds on the complexity of the {Apostolico-Giancarlo} algorithm},
  booktitle =   {{WSP 1996} (Recife, 1996)},
  year =        {1996},
  pages =       {64--74},
  editor =      {Ziviani, N. and Baeza-Yates, R. and Guimar{\~a}es, K.},
  publisher =   {Carleton University Press},
)

@INCOLLECTION(CL97crc,
  author =      {Maxime Crochemore and Thierry Lecroq},
  title =       {Pattern matching and text compression algorithms},
  booktitle =   {The Computer Science and Engineering Handbook},
  editor =      {Allen B. Tucker},
  publisher =   {{CRC} Press},
  year =        {1997},
  chapter =     {8},
  pages =       {162--202},
)

@ARTICLE(CGGPR97siamjc,
  author =      {Maxime Crochemore and Zvi Galil
                 and Leszek G\c{a}sieniec and Kunsoo Park and Wojciech Rytter},
  title =       {Constant-time randomized parallel string matching},
  journal =     {{SIAM} Journal of Computing},
  volume =      {26},
  number =      {4},
  pages =       {950--960},
  year =        {1997},
)

@INCOLLECTION(CH97springer,
  author =      {Maxime Crochemore and Christophe Hancart},
  title =       {Automata for matching patterns},
  booktitle =   {Handbook of Formal Languages},
  editor =      {Rozenberg, G. and Salomaa, A.},
  publisher =   {Springer-Verlag},
  year =        {1997},
  volume =      {2, Linear Modeling: Background and Application},
  chapter =     {9},
  pages =       {399--462},
)

@INPROCEEDINGS(CV97cpm,
  author =      {Maxime Crochemore and Renaud V\'erin},
  title =       {Direct construction of compact Directed Acyclic Word Graphs},
  booktitle =   {Combinatorial Pattern Matching (Aarhus, 1997)},
  year =        {1997},
  series =      {LNCS},
  number =      {1264},
  pages =       {116--129},
  editor =      {Apostolico, A and Hein, J.},
  publisher =   {Springer-Verlag},
)

@INCOLLECTION(CV97slcs,
  author =      {Maxime Crochemore and Renaud V\'erin},
  title =       {On Compact Directed Acyclic Word Graphs},
  booktitle =   {Structures in Logic and Computer Science},
  editor =      {J. Mycielski and G. Rozenberg and A. Salomaa},
  series =      {LNCS},
  number =      {1261},
  pages =       {192--211},
  publisher =   {Springer-Verlag},
  year =        {1997},
)

@INCOLLECTION(Cro97pma,
  author =      {Maxime Crochemore},
  title =       {Off-line exact serial string searching},
  booktitle =   {Pattern Matching Algorithms},
  year =        {1997},
  editor =      {Apostolico, A and Galil Z.},
  pages =       {1--53},
  publisher =   {{O}xford {U}niversity {P}ress},
)

@ARTICLE(CL97ipl,
  author =      {Maxime Crochemore and Thierry Lecroq},
  title =       {Tight bounds on the complexity of the {Apostolico-Giancarlo} algorithm},
  journal =     {Information Processing Letters},
  year =        {1997},
  volume =      {63},
  number =      {4},
  pages =       {195--203},
  note =        {Final version of \cite{CL96wsp}},
)

@ARTICLE(CIK97algo,
  author =      {Maxime Crochemore and Costas S. Iliopoulos and Maureen Korda},
  title =       {Two-dimensional prefix string matching and covering on square matrices},
  journal =     {Algorithmica},
  volume =      {20},
  pages =       {353--373},
  year =        {1998},
)

@INPROCEEDINGS(CGR97seq,
  author =      {Maxime Crochemore and Leszek G\c{a}sieniec and Wojciech Rytter},
  title =       {Constant-space string matching in sublinear average time},
  booktitle =   {Compression and Complexity of Sequences (Positano, 1997)},
  editor =      {B. Carpentieri and A. De Santis and U. Vaccaro and J.A. Storer},
  publisher =   {IEEE Computer Society},
  year =        {1998},
  pages =       {230--239},
)

@INPROCEEDINGS(CIKR98awoca,
  author =      {Maxime Crochemore and Costas S. Iliopoulos
                 and Maureen Korda and James F. Reid},
  title =       {Two-dimensional dictionary prefix-matching},
  booktitle =   {Proceedings of the ninth
                 Australian Workshop on Combinatorial Algorithms, AWOCA'98 (Perth, 1998)},
  editor =      {C.~S. Iliopoulos},
  publisher =   {School of Computing, Curtin University of Technology,
                 Perth, Western Australia},
  year =        {1998},
  pages =       {147--158},
)

@INPROCEEDINGS(CIY98awoca,
  author =      {Maxime Crochemore and Costas S. Iliopoulos and Hiafeng Yu},
  title =       {Algorithms for computing evolutionary chains in molecular
                 and musical sequences},
  booktitle =   {Proceedings of the ninth
                 Australian Workshop on Combinatorial Algorithms AWOCA'98 (Perth, 1998)},
  editor =      {C.~S. Iliopoulos},
  publisher =   {School of Computing, Curtin University of Technology,
                 Perth, Western Australia},
  year =        {1998},
  pages =       {172--184},
)

@INPROCEEDINGS(CMR98mfcs,
  author =      {Maxime Crochemore and Filippo Mignosi and Antonio Restivo},
  title =       {Minimal forbidden words and factor automata},
  booktitle =   {Mathematical Foundations of Computer Science (Brno, 1998)},
  editor =      {L. Brim and J. Gruska and J. Zlatu\u{s}ka},
  series =      {LNCS},
  number =      {1450},
  pages =       {665--673},
  publisher =   {Springer-Verlag},
  year =        {1998},
  note =        {Extended abstract of \cite{CMR98ipl}},
)

@ARTICLE(CMR98ipl,
  author =      {Maxime Crochemore and Filippo Mignosi and Antonio Restivo},
  title =       {Automata and forbidden words},
  journal =     {Information Processing Letters},
  volume =      {67},
  number =      {3},
  year =        {1998},
  pages =       {111--117},
)

@INCOLLECTION(CH98crca,
  author =      {Maxime Crochemore and Christophe Hancart},
  title =       {Pattern matching in strings},
  booktitle =   {Algorithms and Theory of Computation Handbook},
  editor =      {Mikhail J. Atallah},
  publisher =   {{CRC} Press},
  year =        {1998},
  chapter =     {11},
  pages =       {11.1--11.28},
)

@INCOLLECTION(CL98crcb,
  author =      {Maxime Crochemore and Thierry Lecroq},
  title =       {Text data compression algorithms},
  booktitle =   {Algorithms and Theory of Computation Handbook},
  editor =      {Mikhail J. Atallah},
  publisher =   {{CRC} Press},
  year =        {1998},
  chapter =     {12},
  pages =       {12.1--12.23},
)

@ARTICLE(CGHMR98siamjc,
  author =      {Maxime Crochemore and Leszek G\c{a}sieniec
                 and Ramesh Hariharan and S. Muthukrishnan and Wojciech Rytter},
  title =       {A constant-time optimal parallel algorithm for two-dimensional
                 pattern matching},
  journal =     {{SIAM} Journal of Computing},
  volume =      {27},
  number =      {3},
  pages =       {668--681},
  year =        {1998},
)

@ARTICLE(CV99cc,
  author =      {Maxime Crochemore and Renaud V\'erin},
  title =       {Zones of low entropy in genomic sequences},
  journal =     {Computers and Chemistry},
  volume =      {324},
  number =      {23},
  pages =       {275--282},
  year =        {1999},
)

@INPROCEEDINGS(CMRS99icalp,
  author =      {Maxime Crochemore and Filippo Mignosi and Antonio Restivo
                 and Sergio Salemi},
  title =       {Text compression using antidictonaries},
  booktitle =   {International Conference on Automata, Languages an Programming
                 (Prague, 1999)},
  editor =      {J. Wiedermann and P. van Emde Boas and M. Nielsen},
  series =      {LNCS},
  number =      {1644},
  publisher =   {Springer-Verlag},
  year =        {1999},
  pages =       {261--270},
  note =        {Rapport {I.G.M.} 98-10, Universit\'e de Marne-la-Vall\'ee},
)

@PROCEEDINGS(CP99cpm,
  editor =      {Maxime Crochemore and Mike Paterson},
  title =       {Combinatorial Pattern Matching (Warwick, 1999)},
  series =      {LNCS},
  number =      {1645},
  publisher =   {Springer-Verlag},
  year =        {1999},
  note =        {{\small\tt http://link.springer.de/link/service/series/0558/tocs/t1645.htm}},
)

@INPROCEEDINGS(CCIMP99awoca,
  author =      {Emilios Cambouropoulos and Maxime Crochemore
                 and Costas S. Iliopoulos and Laurent Mouchard
                 and Yoan J. Pinzon},
  title =       {Algorithms for computing approximate repetitions in musical sequences},
  booktitle =   {Proceedings of the tenth
                 Australian Workshop on Combinatorial Algorithms, AWOCA'99},
  editor =      {R. Raman and J. Simpson},
  publisher =   {School of Computing, Curtin University of Technology,
                 Perth, Western Australia},
  year =        {1999},
  pages =       {129--144},
)

@INPROCEEDINGS(ACR99sofsem,
  author =      {Cyril Allauzen and Maxime Crochemore and Mathieu Raffinot},
  title =       {Factor oracle: a new structure for pattern matching},
  booktitle =   {SOFSEM'99, Theory and Practice of Informatics (Brno, 1999)},
  editor =      {Jan Pavelka, Gerard Tel, Miroslav Bartosek},
  series =      {LNCS},
  number =      {1725},
  publisher =   {Springer-Verlag},
  year =        {1999},
  pages =       {291--306},
  note =        {Proceedings of the 26th Seminar on Current Trends in
                 Theory and Practice of Informatics,
                 Milovy, Czech Republic, November 1999},
)

@TECHREPORT(CT99igm,
  author =      {Maxime Crochemore and Zden\v{e}k Tron\'{\i}\v{c}ek},
  title =       {Directed acyclic subsequence graph for multiple texts},
  type =        {Rapport {I.G.M.} 99-13},
  institution = {Universit\'e de Marne-la-Vall\'ee},
  year =        {1999},
)

@ARTICLE(CCGLPR99ipl,
  author =      {Maxime Crochemore and Artur Czumaj and Leszek G\c{a}sieniec
                 and Thierry Lecroq and Wojciech Plandowski and Wojciech Rytter},
  title =       {Fast practical multi-pattern matching},
  journal =     {Information Processing Letters},
  volume =      {71},
  number =      {3--4},
  year =        {1999},
  pages =       {107--113},
)

@ARTICLE(CGR99tcs,
  author =      {Maxime Crochemore and Leszek G\c{a}sieniec and Wojciech Rytter},
  title =       {Constant-space string matching in sublinear average time},
  journal =     {Theoretical Computer Science},
  volume =      {218},
  number =      {1},
  year =        {1999},
  pages =       {197--203},
  note =        {Full version of \cite{CGR97seq}},
)

@PROCEEDINGS(HCKRR99cc,
  editor =      {Alain H\'enaut and Maxime Crochemore and Andrzej K. Konopka
                 and Jean-Loup Risler and Pierre Rouz\'e},
  title =       {Informatics and the genome},
  volume =      {23},
  publisher =   {Pergamon},
  year =        {1999},
  note =        {Special issue of \textit{Computers and Chemistry}},
)

@INPROCEEDINGS(CIPR00awoca,
  author =      {Maxime Crochemore and Costas S. Iliopoulos
                 and Yoan J. Pinzon and James Reid},
  title =       {A fast and practical bit-vector algorithms for the longest
                 common subsequence problem},
  booktitle =   {Proceedings of the eleventh
                 Australasian Workshop on Combinatorial Algorithms, AWOCA'2000},
  editor =      {L. Brankovic and J. Ryan},
  publisher =   {University of Newcastle, NSW, Australia},
  year =        {2000},
  pages =       {75--86},
)

@INPROCEEDINGS(CIPR00sofsem,
  author=       {Maxime Crochemore and Costas~S. Iliopoulos and Yoan~J. Pinzon},
  title=        {Fast Evolutionary Chains},
  booktitle=    {Sofsem 2000---Theory and Practice of Informatics},
  editor=       {V. Hlav\'a\v{c} and K.~G. Jeffery and J. Wiedermann},
  series=       {LNCS},
  number=       {1963},
  pages=        {306--317},
  publisher=    {Springer-Verlag},
  year=         {2000},
)

@ARTICLE(CIKR00cmcc,
  author =      {Maxime Crochemore and Costas Iliopoulos and Maureen Korda and James Reid},
  title =       {A failure function for multiple two-dimensional pattern matching},
  journal =     {Combinatorial Mathematics and Combinatorial Computing},
  volume =      {35},
  year =        {2000},
  pages =       {225--238},
  note =        {Full version of \cite{CIKR98awoca}},
)

@PROCEEDINGS(CG00jda,
  editor =      {Maxime Crochemore and Leszek G\c{a}sieniec},
  title =       {Matching Patterns},
  publisher =   {Herm\`es},
  year =        {2000},
  note =        {Special issue of \textit{J. Discrete Algorithms}},
)

@Article(CMRS00ieee,
  author =      {Maxime Crochemore and Filippo Mignosi and Antonio Restivo
                 and Sergio Salemi},
  title =       {Data compression using antidictonaries},
  volume =      {88},
  number =      {11},
  journal =     {Proceedings of the I.E.E.E.},
  year =        {2000},
  pages =       {1756--1768},
  note =        {Special issue \textit{Lossless data compression} edited by J. Storer},
)

@InProceedings(CIPR00ismir,
  author =    {Maxime Crochemore and Costas S. Iliopoulos and Yoan J. Pinzon
               and Wojciech Rytter},
  title =     {Finding Motifs with Gaps},
  booktitle = {Proceedings of International Symposium on Music Information
               Retrieval (ISMIR'00)},
  address =   {Plymouth, Massachusetts},
  year =      {2000},
  pages =     {306--317},
)

@INPROCEEDINGS(ACR01cpm,
  author =      {Cyril Allauzen and Maxime Crochemore and Mathieu Raffinot},
  title =       {Efficient Experimental String Matching by Weak Factor Recognition},
  booktitle =   {CPM'2001, Combinatorial Pattern Matching
                 (Jerusalem, 2001)},
  editor =      {A. Amir and G.M. Landau},
  publisher =   {Springer-Verlag},
  year =        {2001},
  series =      {LNCS},
  number =      {2089},
  pages =       {51--72},
)

@BOOK(CHL2001vuibert,
  author =      {Maxime Crochemore and Christophe Hancart and Thierry Lecroq},
  title =       {Algorithmique du texte},
  publisher =   {Vuibert},
  year =        {2001},
  note =        {347 pages},
)

@Article(CIPR01ipl,
  author =      {Maxime Crochemore and Costas S. Iliopoulos
                 and Yoan J. Pinzon and James Reid},
  title =       {A fast and practical bit-vector algorithms for the longest
                 common subsequence problem},
  journal =     {Information Processing Letters},
  volume =      {80},
  number =      {6},
  year =        {2001},
  pages =       {279--285},
  note =        {Complete version of \cite{CIPR00awoca}},
)

@ARTICLE(CIP01ejc,
  author =      {Maxime Crochemore and Costas S. Iliopoulos
                 and Yoan J. Pinzon},
  title =       {Computing Evolutionary Chains in Musical Sequences},
  journal =     {Electronic Journal of Combi\-na\-torics},
  volume =      {8},
  number =      {2},
  year =        {2001},
  note =        {\\http://www.combinatorics.org/Vo\-lu\-me\_8/v8i2toc.html},
)

@INPROCEEDINGS(CILP01psc,
  author =      {Maxime Crochemore and Costas S. Iliopoulos
                 and Thierry Lecroq and Yoan J. Pinzon},
  title =       {Approximate String Matching in Musical Sequences},
  editor =      {M. Bal\'{\i}k and M. \v{S}im\'anek},
  booktitle =   {PSC'2001, Prague Stringoly Club (Prague, 2001)},
  publisher =   {Czech Technical University of Prague},
  year =        {2001},
  pages =       {26--36},
  note =        {DC-2001-06},
)

@INPROCEEDINGS(CIP01spire,
  author =      {Maxime Crochemore and Costas S. Iliopoulos
                 and Yoan J. Pinzon},
  title =       {Speeding-up {H}irschberg and {H}unt-{S}zymanski {LCS} algorithms},
  editor =      {G. Navarro},
  booktitle =   {SPIRE'2001, 8th International Symposium on String Processing
  and Information Retrieval (Laguna de San Rafael, Chile, 2001)},
  publisher =   {IEEE Computer Society},
  year =        {2001},
  pages =       {59--67},
)

@INPROCEEDINGS(CLU02soda,
  author =      {Maxime Crochemore and Gad M. Landau and Michal Ziv-Ukelson},
  title =       {A Sub-quadratic Sequence Alignment Algorithm for Unrestricted Cost Matrices},
  booktitle =   {Proceedings of the Thirteen Annual ACM-SIAM Symposium on Discrete Algorithms},
  editor =      {D. Eppstein},
  publisher =   {ACM-SIAM},
  year =        {2002},
  pages =       {679--688},
  note =        {Rapport {I.G.M.} 2001-08},
)

@INCOLLECTION(AC02kluwer,
  author =      {Alberto Apostolico and Maxime Crochemore},
  title =       {String pattern matching for a deluge survival kit},
  booktitle =   {Handbook of Massive Data Sets},
  editor =      {J. Abello and P.M. Pardalos and M.G.C. Resende},
  publisher =   {Kluwer Academic Publishers},
  year =        {2002},
  pages =       {151--194},
)

@PROCEEDINGS(RCKPR02cc,
  editor =      {Jean-Loup Risler and Maxime Crochemore and Andrzej K. Konopka
                 and Bernard Prum and Pierre Rouz\'e},
  title =       {Genome and Informatics},
  volume =      {26-5},
  year =        {2002},
  note =        {Special issue of \textit{Computers and Chemistry}},
)

@ARTICLE(CIMRTT02njc,
  author =      {Maxime Crochemore and Costas S. Iliopoulos and
                 and Christos Makris and Wojciech Rytter and Athanasios Tsakalidis
                 and Kostas Tsichlas},
  title =       {Approximate string matching with gaps},
  journal =     {Nordic Journal of Computing},
  volume =      {9},
  number =      {1},
  year =        {2002},
  pages =       {54--65},
)

@INPROCEEDINGS(CILPPR02cpm,
  author =      {Maxime Crochemore and Costas~S. Iliopoulos and Thierry Lecroq
                 and Wojciech Plandowski and Wojciech Rytter},
  title =       {Three Heuristics for  $delta$-Matching: $delta$-BM  Algorithms},
  booktitle =   {Combinatorial Pattern Matching, CPM'2002},
  editor =      {A. Apostolico and M. Takeda},
  publisher =   {Springer-Verlag},
  series =      {LNCS},
  number =      {2373},
  year =        {2002},
  pages =       {178--189},
)

@BOOK(CR02jos,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {Jewels of Stringology},
  publisher =   {World Scientific Publishing},
  address =     {Hong-Kong},
  year =        {2002},
  note =        {310 pages},
)

@ARTICLE(CCIMP02ijcm,
  author =      {Emilios Cambouropoulos and Maxime Crochemore
                 and Costas S. Iliopoulos and Laurent Mouchard
                 and Yoan J. Pinzon},
  title =       {Algorithms for computing approximate repetitions in musical sequences},
  journal =     {International Journal of Computer Mathematics},
  year =        {2002},
  volume =      {79},
  number =      {11},
  pages =       {1135--1148},
)

@INPROCEEDINGS(CT02spire,
  author  =     {Maxime Crochemore and Zden\v{e}k Tron\'{\i}\v{c}ek},
  title =       {On the size of {DASG} for multiple texts},
  booktitle =   {String Processing and Information Retrieval, SPIRE'2002},
  publisher =   {Springer-Verlag},
  editor =      {A. Laender and A. Oliveira},
  series =      {LNCS},
  number =      {2476},
  year =        {2002},
  pages =       {58--64},
)

@INPROCEEDINGS(CN02sccc,
  author  =     {Maxime Crochemore and Gonzalo Navarro},
  title =       {Improved antidictionary based compression},
  booktitle =   {SCCC'02, Chilean Computer Science Society},
  publisher =   {I.E.E.E. CS Press},
  year =        {2002},
  pages =       {7--13},
)

@TechReport(PCGS02igm,
  author =      {Nadia Pisanti and Maxime Crochemore and Roberto Grossi and Marie-France Sagot},
  title =       {A Basis for Repeated Motifs in Pattern Discovery and Text Mining},
  institution = {Institut Gaspard-Monge},
  year =        {2002},
  note =        {Rapport {I.G.M.} 2002-10.},
)

@article(CIP02cjc,
  author =      {Maxime Crochemore and Costas S. Iliopoulos and Yoan J. Pinzon},
  title =       {Recovering an {LCS} in {O}$(n^2/w)$ time and space},
  journal =     {Colombian Journal of Computation},
  year =        {2002},
  volume =      {3},
  number =      {1},
  pages =       {41--52},
)

@ARTICLE(CHL02jda,
  author =      {Maxime Crochemore and Christophe Hancart
                 and Thierry Lecroq},
  title =       {A unifying look at the {A}postolico-{G}iancarlo string-matching algorithm},
  journal =     {Journal of Discrete Algorithms},
  volume =      {1},
  number =      {1},
  year =        {2003},
  pages =       {37--52},
)

@INPROCEEDINGS(HC03ciaa,
  author  =     {Jan Holub and Maxime Crochemore},
  title =       {On the implementation of compact {DAWG}'s},
  booktitle =   {Implementation and Application of Automata},
  editor =      {J.-M. Champarnaud and D. Maurel},
  publisher =   {Springer-Verlag},
  series =      {LNCS},
  number =      {2608},
  year =        {2003},
  pages =       {289--294},
)

@Article(C2003tcs,
  author =      {Maxime Crochemore},
  title =       {Reducing space for index implementation},
  journal =     {Theoretical Computer Science},
  volume =      {292},
  number =      {1},
  year =        {2003},
  pages =       {185--197},
)

@PROCEEDINGS(BCC03cpm,
  editor =      {Ricardo Baeza-Yates and Edgar Ch\'avez and Maxime Crochemore},
  title =       {Combinatorial Pattern Matching},
  series =      {LNCS},
  number =      {2676},
  publisher =   {Springer-Verlag},
  year =        {2003},
)

@ARTICLE(CS03ipl,
  author =      {Maxime Crochemore and Valery Stefanov},
  title =       {Waiting time and complexity for matching patterns with automata},
  journal =     {Information Processing Letters},
  volume =      {87},
  number =      {3},
  year =        {2003},
  pages =       {119--125},
)

@INPROCEEDINGS(ABCLS03cpm,
  author =      {Amihood Amir and Ayelet Butman and Maxime Crochemore
                 and Gad M. Landau and Malka Schaps},
  title =       {Two-dimensional Pattern Matching with Rotations},
  booktitle =   {Combinatorial Pattern Matching},
  editor =      {R. Baeza-Yates and E. Chavez and M. Crochemore},
  publisher =   {Springer-Verlag},
  series =      {LNCS},
  number =      {2676},
  year =        {2003},
  pages =       {17--31},
)

@ARTICLE(CILPPR03fi,
  author =      {Maxime Crochemore and Costas~S. Iliopoulos and Thierry Lecroq
                 and Yoan J. Pinzon and Wojciech Plandowski and Wojciech Rytter},
  title =       {Occurrence and substring heuristics for $\delta$-matching},
  volume =      {56},
  number =      {1,2},
  journal =     {Fundamenta Informaticae},
  editor =      {W. Smyth},
  year =        {2003},
  pages =       {1--21},
)

@ARTICLE(CIP03fi,
  author =      {Maxime Crochemore and Costas S. Iliopoulos
                 and Yoan J. Pinzon},
  title =       {Speeding-up {H}irschberg and {H}unt-{S}zymanski {LCS} algorithms},
  volume =      {56},
  number =      {1,2},
  journal =     {Fundamenta Informaticae},
  editor =      {W. Smyth},
  year =        {2003},
  pages =       {89--103},
  note =        {Full version of \cite{CIP01spire}},
)

@ARTICLE(BCMRS03fi,
  author =      {Marie-Pierre B\'eal and Maxime Crochemore and Filippo Mignosi
                 and Antonio Res\-tivo and Marinella Sciortino},
  title =       {Forbidden words of regular languages},
  volume =      {56},
  number =      {1,2},
  journal =     {Fundamenta Informaticae},
  editor =      {W. Smyth},
  year =        {2003},
  pages =       {121--135},
)

@INPROCEEDINGS(PCGS03mfcs,
  author =      {Nadia Pisanti and Maxime Crochemore and Roberto Grossi and Marie-France Sagot},
  title =       {A basis of tiling motifs for generating repeated patterns and its complexity for
                 higher quorum},
  booktitle =   {Mathematical Foundations of Computer Science (MFCS)},
  editor =      {B. Rovan and P. Vojt\'a\v{s}},
  publisher =   {Springer-Verlag},
  series =      {LNCS},
  number =      {2747},
  year =        {2003},
  pages =       {622--632},
  note =        {See TR-03-02, Universit\`a di Pisa},
)

@ARTICLE(CLU03siamjc,
  author =      {Maxime Crochemore and Gad M. Landau and Michal Ziv-Ukelson},
  title =       {A Sub-quadratic Sequence Alignment Algorithm for Unrestricted Cost Matrices},
  journal =     {SIAM Journal of Computing},
  year =        {2003},
  volume =      {32},
  number =      {6},
  pages =       {1654--1673},
  note =        {Full version of \cite{CLU02soda}},
)

@INPROCEEDINGS(CINP03spire,
  author  =     {Maxime Crochemore and Costas~S. Iliopoulos
                 and Gonzalo Navarro and Yoan J. Pinzon},
  title =       {A bit-parallel suffix automaton approach for
                 $(\delta,\gamma)$-matching in music retrieval},
  booktitle =   {Proc. 10th International Symposium on String Processing and Information Retrieval (SPIRE'2003)},
  editor =      {M. Nascimento and E. de Moura and A. Oliveira},
  publisher =   {Springer-Verlag},
  series =      {LNCS},
  number =      {2857},
  year =        {2003},
  pages =       {211--223},
)

@ARTICLE(CMT03jda,
  author  =     {Maxime Crochemore and Bo\v{r}ivoj Melichar and Zden\v{e}k Tron\'{\i}\v{c}ek},
  title =       {Directed Acyclic Subsequence Graph - Overview},
  journal =     {Journal of Discrete Algorithms},
  volume =      {1},
  number =      {3-4},
  year =        {2003},
  pages =       {255--280},
)

@ARTICLE(ABCL04tcs,
  author =      {Amihood Amir and Ayelet Butman and Maxime Crochemore
                 and Gad M. Landau and Mary Schaps},
  title =       {Two-dimensional Pattern Matching with Rotations},
  journal =     {Theoretical Computer Science},
  volume =      {314},
  year =        {2004},
  pages =       {173--187},
  note =        {Full version of \cite{ABCLS03cpm}},
)

@INPROCEEDINGS(CIMS04latin,
  author =      {Maxime Crochemore and Costas~S. Iliopoulos and Manal Mohamed
                 and Marie-France Sagot},
  title =       {Longest repeated motif with a block of don't cares},
  booktitle =   {LATIN 2004: Theoretical Informatics},
  editor =      {M. Farach-Colton},
  publisher =   {Springer-Verlag},
  series =      {LNCS},
  number =      {2976},
  year =        {2004},
  pages =       {271--278},
)

@INPROCEEDINGS(CEGM04cpm,
  author =      {Maxime Crochemore and Chiara Epifanio
                 and Roberto Grossi and Filippo Mignosi},
  title =       {A trie-based approach for compacting automata},
  booktitle =   {Combinatorial Pattern Matching},
  editor =      {S. C. Sahinalp and S. Muthukrishnan and U. Dogrusoz},
  publisher =   {Springer-Verlag},
  series =      {LNCS},
  number =      {3109},
  year =        {2004},
  pages =       {145--158},
)

@INPROCEEDINGS(CGS04spire,
  author =      {Maxime Crochemore and Raffaele Giancarlo and Marie-France Sagot},
  title =       {Lon\-gest Motifs with a Functionally Equivalent Block},
  booktitle =   {Proc. 11th International Symposium on String Processing and Information Retrieval (SPIRE'2004)},
  editor =      {A. Apostolico and M. Melucci},
  publisher =   {Springer-Verlag},
  series =      {LNCS},
  number =      {3246},
  year =        {2004},
  pages =       {298--309},
)

@INCOLLECTION(CS04dekker,
  author =      {Maxime Crochemore and Marie-France Sagot},
  title =       {Motifs in Sequences: Localization and Extraction},
  booktitle =   {Compact Handbook of Computational Biology},
  editor =      {A. K. Konopka and M. J. C. Crabbe},
  publisher =   {Marcel Dekker, New York},
  year =        {2004},
  pages =       {47--97},
)

@INCOLLECTION(CL04crc,
  author =      {Maxime Crochemore and Thierry Lecroq},
  title =       {Pattern matching and text compression algorithms},
  booktitle =   {The Computer Science and Engineering Handbook},
  editor =      {Allen B. Tucker},
  publisher =   {{CRC} Press},
  year =        {2004},
  chapter =     {13},
  pages =       {13-1--13-48},
  note =        {Update of \cite{CL97crc}},
)

@INPROCEEDINGS(CLSU05kcl,
  author =      {Maxime Crochemore and Gad M. Landau and Baruch Schieber and Michal Ziv-Ukelson},
  title =       {Re-Use Dynamic Programming for Sequence Alignment: An Algorithmic Toolkit},
  booktitle =   {String Algorithmics},
  editor =      {C. Iliopoulos and T. Lecroq},
  publisher =   {King's College London Publications},
  year =        {2005},
  pages =       {19--59},
)

@INPROCEEDINGS(PCGS05kcl,
  author =      {Nadia Pisanti and Maxime Crochemore and Roberto Grossi and Marie-France Sagot},
  title =       {A Comparative Study of Bases for Motif Inference},
  booktitle =   {String Algorithmics},
  editor =      {C. Iliopoulos and T. Lecroq},
  publisher =   {King's College London Publications},
  year =        {2005},
  pages =       {195--225},
)

@ARTICLE(PCGS05tcbb,
  author =      {Nadia Pisanti and Maxime Crochemore and Roberto Grossi and Marie-France Sagot},
  title =       {Bases of Motifs for Generating Repeated Patterns with Wild Cards},
  journal =     {IEEE/ACM Transactions on Computational Biology and Bioinformatics},
  volume =      {2},
  number =      {1},
  year =        {2005},
  pages =       {40--50},
)

@ARTICLE(CDP05tcs,
  author =      {Maxime Crochemore and Jacques D\'esarm\'enien and Dominique Perrin},
  title =       {A note on the {B}urrows-{W}heeler transformation},
  journal =     {Theoretical Computer Science},
  volume =      {332},
  number =      {1-3},
  year =        {2005},
  pages =       {567--572},
)

@ARTICLE(CINPS05jda,
  author =      {Maxime Crochemore and Costas Iliopoulos and Gonzalo Navarro
                 and Yoan Pinzon and Alejandro Salinger},
  title =       {Bit-parallel $(\gamma,\delta)$-matching and suffix automata},
  volume =      {3},
  number =      {2-4},
  journal =     {J. Discrete Algorithms},
  year =        {2005},
  pages =       {198--214},
)

@ARTICLE(BCF05ieeeit,
  author =      {Marie-Pierre B\'eal and Maxime Crochemore and Gabriele Fici},
  title =       {Presentations of constrained systems with unconstrained positions},
  volume =      {51},
  number =      {5},
  journal =     {IEEE Transactions on Information Theory},
  year =        {2005},
  pages =       {1891--1900},
)

@INCOLLECTION(C05cup,
  author =      {Maxime Crochemore},
  title =       {Structures for indexes},
  booktitle =   {Applied Combinatorics on Words},
  editor =      {M. Lothaire},
  publisher =   {Cambridge University Press},
  year =        {2005},
  chapter =     {2},
  pages =       {106--163},
)

@PROCEEDINGS(ACP05cpm,
  editor =      {Alberto Apostolico and Maxime Crochemore and Kunsoo Park},
  title =       {Combinatorial Pattern Matching},
  series =      {LNCS},
  number =      {3537},
  publisher =   {Springer-Verlag},
  year =        {2005},
)

@PROCEEDINGS(BC05jda,
  editor =      {Ricardo Baeza-Yates and Maxime Crochemore},
  title =       {Indexing and Matching Strings},
  publisher =   {Elsevier},
  year =        {2005},
  note =        {Special issue of {\em J. Discrete Algorithms}, volume 3(2--4)},
)

@INPROCEEDINGS(CHLV05esa,
  author =      {Maxime Crochemore and Danny Hermelin and Gad M. Landau
                 and St\'ephane Vialette},
  title =       {Approximating the 2-Interval Pattern Problem},
  booktitle =   {ESA 2005: 13th Annual European Symposium},
  editor =      {G. S. Brodal and S. Leonardi},
  publisher =   {Springer-Verlag},
  series =      {LNCS},
  number =      {3669},
  year =        {2005},
  pages =       {426--437},
)

@INPROCEEDINGS(CCIMS05ismir,
  author =      {Emilios Cambouropoulos and Maxime Crochemore and Costas S. Iliopoulos
                 and Manal Mohamed and Marie-France Sagot},
  title =       {A Pattern Extraction Algorithm for Abstract Melodic Representations
                 that Allow Partial Overlapping of Intervallic Categories},
  booktitle =   {Proceedings of the 6th International Conference on Music Information Retrieval
                 (ISMIR 2005)},
  editor =      {T. Crawford and M. Sandler},
  publisher =   { },
  year =        {2005},
  pages =       {167--174},
)

@INCOLLECTION(CL06springer,
  author =      {Maxime Crochemore and Thierry Lecroq},
  title =       {Text Searching and Indexing},
  booktitle =   {Recent Advances in Formal Languages and Applications},
  editor =      {Z. \'Esik and C. Mart\'{\i}n-Vide and V. Mitrana},
  publisher =   {Springer-Verlag},
  year =        {2006},
  chapter =     {2},
  pages =       {43--80},
)

@INPROCEEDINGS(CISH06ciaa,
  author =      {Maxime Crochemore and Lucian Ilie and Emine Seid-Hilmi},
  title =       {Factor Oracles},
  booktitle =   {Implementation and Application of Automata},
  editor =      {O. H. Ibarra and H.-C. Yen},
  publisher =   {Springer-Verlag},
  series =      {LNCS},
  number =      {4094},
  year =        {2006},
  pages =       {78--89},
)

@PROCEEDINGS(DSC06tal,
  TITLE =       {Fouille de donn\'ees textuelles : complexit\'e, algorithmique et passage \`a l'\'echelle},
  YEAR =        {2006},
  editor =      {Maxime Crochemore and Ga\"el Harry Diaz and Sim{\~a}o Melo de Souza},
  publisher =   {Lavoisier, Paris},
  note =        {Num\'ero sp\'ecial de \textit{Traitement automatique des langues}, volume 46(2)},
)

@ARTICLE(DSC06tal-pref,
  AUTHOR =      {Ga\"el Harry Diaz and Sim{\~a}o Melo de Souza and Maxime Crochemore},
  TITLE =       {Passage \`a l'\'echelle : complexit\'e, algorithmique et architectures},
  JOURNAL =     {Traitement automatique des langues},
  YEAR =        {2006},
  volume =      {46},
  number =      {2},
  pages =       {7--12},
  note =        {Pr\'eface de \cite{DSC06tal}},
)

@ARTICLE(CIMS06tcs,
  author =      {Maxime Crochemore and Costas S. Iliopoulos and Manal Mohamed
                 and Marie-France Sagot},
  title =       {Longest Repeats with a Block of $k$ Don't Cares},
  journal =     {Theoretical Computer Science},
  volume =      {362},
  number =      {1-3},
  year =        {2006},
  pages =       {248-254},
)

@INPROCEEDINGS(RCIP06awoca,
  author =      {Maxime Crochemore and Costas S. Iliopoulos and Kunsoo Park and Kangho Roh},
  title =       {External memory algorithms for string problems},
  booktitle =   {Proceedings of the Seventeenth Australasian Workshop on Combinatorial Algorithms},
  year =        {2006},
  editor =      {J. Ryan and Dafik},
  pages =       { },
  publisher =   {University of Ballarat},
)

@BOOK(CHL07cup,
  author =      {Maxime Crochemore and Christophe Hancart and Thierry Lecroq},
  title =       {Algorithms on Strings},
  publisher =   {Cambridge University Press},
  year =        {2007},
  note =        {392 pages},
)

@ARTICLE(CISH07ijfcs,
  author =      {Maxime Crochemore and Lucian Ilie and Emine Seid-Hilmi},
  title =       {The structure of Factor Oracles},
  journal =     {International Journal of Foundations of Computer Science},
  year =        {2007},
  volume =      {18},
  number =      {4},
  pages =       {781--797},
)

@INPROCEEDINGS(ACIP07lata,
  author =      {Pavlos Antoniou and Maxime Crochemore and Costas Iliopoulos
                 and Pierre Peterlongo},
  title =       {Application of suffix trees for the acquisition of common motifs
                 with gaps in a set of strings},
  booktitle =   {Proceedings of the 1st International Conference on Language
                 and Automata Theory and Applications (LATA'07)},
  year =        {2007},
  editor =      {R. Loos and S. Z. Fazekas and C. Mart\'{\i}n-Vide},
  volume =      { },
  series =      { },
  pages =       {57--66},
  publisher =   {Universitat Rovira i Virgili},
)

@ARTICLE(CCIMS06is,
  author =      {Emilios Cambouropoulos and Maxime Crochemore and Costas S. Iliopoulos
                 and Manal Mohamed and Marie-France Sagot},
  title =       {All Maximal Pairs in Step-Leap Representation of Melodic Sequences},
  journal =     {Information Sciences},
  volume =      {177},
  number =      {9},
  year =        {2007},
  pages =       {1954--1962},
  note =        {Journal version of \cite{CCIMS05ismir}},
)

@INPROCEEDINGS(BC07isit,
  author =      {Marie-Pierre B\'eal and Maxime Crochemore},
  title =       {Minimizing local automata},
  booktitle =   {IEEE International Symposium on Information Theory},
  year =        {2007},
  editor =      {G. Caire and M. Fossorier},
  volume =      { },
  series =      { },
  pages =       {1376--1380},
  publisher =   { },
  note =        {IEEE Catalog Number: 07CH37924C},
)

@INPROCEEDINGS(CEGM07ciaa,
  author =      {Maxime Crochemore and Chiara Epifanio
                 and Alessandra Gabriele and Filippo Mignosi},
  title =       {On the suffix automaton with mismatches},
  booktitle =   {Implementation and Application of Automata, 12th International
                 Conference},
  year =        {2007},
  editor =      {J. Holub and J. Zd{\'a}rek},
  number =      {4783},
  series =      {LNCS},
  pages =       {144-156},
  publisher =   {Springer-Verlag, Berlin},
)

@INPROCEEDINGS(CI07mfcs,
  author =      {Maxime Crochemore and Lucian Ilie},
  title =       {Analysis of maximal repetitions in strings},
  booktitle =   {Mathematical Foundations of Computer Science},
  year =        {2007},
  editor =      {L. Ku\v{c}era and A. Ku\v{c}era},
  number =      {4708},
  series =      {LNCS},
  pages =       {465--476},
  publisher =   {Springer-Verlag, Berlin},
)

@INPROCEEDINGS(CIR07mfcs,
  author =      {Maxime Crochemore and Costas Iliopoulos and Mohammad Sohel Rahman},
  title =       {Finding Patterns in Given Intervals},
  booktitle =   {Mathematical Foundations of Computer Science},
  year =        {2007},
  editor =      {L. Ku\v{c}era and A. Ku\v{c}era},
  number =      {4708},
  series =      {LNCS},
  pages =       {645--656},
  publisher =   {Springer, Berlin},
)

@INPROCEEDINGS(CI08stacs,
  author =      {Maxime Crochemore and Lucian Ilie},
  title =       {Understanding maximal repetitions in strings},
  booktitle =   {Symposium on Theoretical Aspects of Computer Science},
  year =        {2008},
  editor =      {S. Albers and P. Weil},
  pages =       {11--16},
  publisher =   {IBFI Schloss Dagstuhl},
  ISBN =        {978-3-939897-06-4},
  note =        {Bordeaux, France, 21-23 February 2008},
)

@INPROCEEDINGS(CIKRW08stacs,
  author =      {Maxime Crochemore and Costas Iliopoulos and Marcin Kubica
                 and Mohammad Sohel Rahman and Tomasz Wale{\'n}},
  title =       {Improved algorithms for the range next value problem and applications},
  booktitle =   {Symposium on Theoretical Aspects of Computer Science},
  year =        {2008},
  editor =      {S. Albers and P. Weil},
  pages =       {205--216},
  publisher =   {IBFI Schloss Dagstuhl},
  ISBN =        {978-3-939897-06-4},
  note =        {Bordeaux, France, 21-23 February 2008},
)

@ARTICLE(CI08ipl,
  author =      {Maxime Crochemore and Lucian Ilie},
  title =       {Computing Longest Previous Factors in linear time and applications},
  journal =     {Information Processing Letters},
  volume =      {106},
  number =      {2},
  year =        {2008},
  pages =       {75--80},
  note =        {DOI: 10.1016/j.ipl.2007.10.006},
)

@ARTICLE(RCIP08fi,
  author =      {Kangho Roh and Maxime Crochemore and Costas S. Iliopoulos and Kunsoo Park},
  title =       {External memory algorithms for string problems},
  journal =     {Fundamenta Informaticae},
  volume =      {84},
  number =      {1},
  year =        {2008},
  pages =       {17-32},
)

@INPROCEEDINGS(CIS08dcc,
  author =      {Maxime Crochemore and Lucian Ilie and William F. Smyth},
  title =       {A simple algorithm for computing the {Lempel-Ziv} factorization},
  booktitle =   {18th Data Compression Conference},
  year =        {2008},
  editor =      {J. A. Storer and M. W. Marcellin},
  pages =       {482--488},
  publisher =   {IEEE Computer Society, Los Alamitos, CA},
  note =        {Snowbird, UT, USA, 25-27 March 2008},
)

@ARTICLE(CI08jcss,
  author =      {Maxime Crochemore and Lucian Ilie},
  title =       {Maximal repetitions in strings},
  journal =     {Journal of Computer and System Sciences},
  volume =      {74},
  year =        {2008},
  pages =       {796--807},
  note =        {DOI: 10.1016/j.jcss.2007.09.003},
)

@INPROCEEDINGS(CIT08cpm,
  author =      {Maxime Crochemore and Lucian Ilie and Liviu Tinta},
  title =       {Towards a solution to the ``runs'' conjecture},
  booktitle =   {Combinatorial Pattern Matching},
  year =        {2008},
  editor =      {P. Ferragina and G. M. Landau},
  number =      {5029},
  series =      {LNCS},
  pages =       {290-302},
  publisher =   {Springer, Heidelberg},
  note =        {Pisa, Italy, June 18-20, 2008},
  doi =         {DOI: 10.1007/978-3-540-69068-9\_27},
)

@ARTICLE(CHLV08tcs,
  author =      {Maxime Crochemore and Danny Hermelin and Gad M. Landau
                 and Dror Rawitz and St\'ephane Vialette},
  title =       {Approximating the 2-Interval Pattern Problem},
  journal =     {Theoretical Computer Science},
  volume =      {395},
  number =      {2-3},
  year =        {2008},
  pages =       {283--297},
)

@PROCEEDINGS(CC08mcs,
  TITLE =       {Combinatorial Algorithms},
  YEAR =        {2008},
  editor =      {Joseph Wun-Tat Chan and Maxime Crochemore},
  publisher =   {Birkh{\"a}user Basel, Switzerland},
  issn =        {1661-8270 (Print), 1661-8289 (Online)},
  note =        {Special issue of \textit{Mathematics in Computer Science}, Volume 1(4):541--736},
)

@INCOLLECTION(CR08springersar,
  author =      {Maxime Crochemore and Wojciech Rytter},
  title =       {Squares and repetitions},
  booktitle =   {Encyclopedia of {A}lgorithms},
  editor =      {Ming-Yang Kao},
  publisher =   {Springer, Heidelberg},
  year =        {2008},
  pages =       {874--877},
  ISBN =        {978-0-387-30770-1 (Print) 978-0-387-30162-4 (Online)},
)

@INCOLLECTION(CL08springeresm,
  author =      {Maxime Crochemore and Thierry Lecroq},
  title =       {Sequential exact string matching},
  booktitle =   {Encyclopedia of {A}lgorithms},
  editor =      {Ming-Yang Kao},
  publisher =   {Springer, Heidelberg},
  year =        {2008},
  pages =       {824--826},
  ISBN =        {978-0-387-30770-1 (Print) 978-0-387-30162-4 (Online)},
)

@INCOLLECTION(CL08springermsm,
  author =      {Maxime Crochemore and Thierry Lecroq},
  title =       {Sequential multiple string matching},
  booktitle =   {Encyclopedia of {A}lgorithms},
  editor =      {Ming-Yang Kao},
  publisher =   {Springer, Heidelberg},
  year =        {2008},
  pages =       {826--829},
  ISBN =        {978-0-387-30770-1 (Print) 978-0-387-30162-4 (Online)},
)

@INPROCEEDINGS(CGMP08ictcs,
  author =      {Maxime Crochemore and Alessandra Gabriele and Filippo Mignosi
                 and Mauriana Pesaresi},
  title =       {On the longest common factor problem},
  booktitle =   {5th IFIP International Conference on Theoretical Computer Science},
  year      =   {2008},
  pages     =   {143-155},
  editor =      {G. Ausiello and J. Karhum{\"a}ki and G. Mauri and C.-H. Luke Ong},
  publisher =   {Springer, Heidelberg},
  series    =   {IFIP},
  volume    =   {273},
  isbn      =   {978-0-387-09679-7},
  note =         {Milano, Italy, 7-10 September 2008},
)

@INPROCEEDINGS(BC08fsmnlp-min,
  author =      {Marie-Pierre B{\'e}al and Maxime Crochemore},
  title =       {Minimizing incomplete automata},
  booktitle =   {Finite-State Methods and Natural Language Processing},
  year =        {2008},
  editor =      {J. Pikorski and B. Watson and A. Yli-Jyr{\"a}},
  volume =      { },
  series =      { },
  pages =       {9--16},
  publisher =   {Joint Research Centre, European Commission},
  note =        {Ispra, Italy, 11-12 September 2008},
)

@INPROCEEDINGS(CFIJ08dlt,
  author =      {Maxime Crochemore and Szil\'{a}rd Zsolt Fazekas and Costas Iliopoulos
                 and Inuka Jayasekera},
  title =       {Bounds on powers in strings},
  booktitle =   {Developments in Language Theory},
  year      =   {2008},
  pages     =   {206-215},
  editor =      {M. Ito and M. Toyama},
  publisher =   {Springer, Heidelberg},
  series    =   {LNCS},
  number    =   {5257},
  isbn      =   {978-3-540-85779-2},
  note =        {Kyoto, Japan, 16-19 September 2008},
)

@INPROCEEDINGS(CP08bcs,
  AUTHOR =      {Maxime Crochemore and Ely Porat},
  TITLE =       {Computing a longest increasing subsequence of length $k$ in time {$O(n\log\log k)$}},
  BOOKTITLE =   {Visions of computer science},
  YEAR =        {2008},
  editor =      {E. Gelenbe and S. Abramsky and V. Sassone},
  pages =       {69--74},
  publisher =   {The British Computer Society, Swindon, UK},
  isbn =        {978-1-906124-08-3},
  note =        {Imperial College London, 22-24 September 2008},
)

@ARTICLE(CIR08ipl,
  author =      {Maxime Crochemore and Costas Iliopoulos and Mohammad Sohel Rahman},
  title =       {Optimal Prefix and Suffix Queries on Texts},
  journal =     {Information Processing Letters},
  volume =      {108},
  number =      {5},
  year =        {2008},
  pages =       {320--325},
  note =        {Presented at the International conference on Analysis of Algorithms (AofA), 2007},
)

@INPROCEEDINGS(ACIJL08psc,
 author =       "Pavlos Antoniou and Maxime Crochemore and Costas S. Iliopoulos
                 and Inuka Jayasekera and Gad M. Landau",
 title =        "Conservative String Covering of Indeterminate Strings",
 booktitle =    "Proceedings of the Prague Stringology Conference 2008",
 address =      "Czech Technical University in Prague, Czech Republic",
 editor =       "Jan Holub and Jan {\v{Z}}{\v{d}}{\'{a}}rek",
 isbn =         "978-80-01-04145-1",
 year =         2008,
 pages =        "108--115",
)

@INCOLLECTION(CL08aasm,
  author =      {Maxime Crochemore and Thierry Lecroq},
  title =       {Alignments and approximate string matching},
  booktitle =   {New Developments in Formal Languages and Applications},
  editor =      {G. Bel-Enguix and M. D. Jim{\'e}nez-L{\'o}pez and C. Mart{\'{\i}}n-Vide},
  publisher =   {Springer, Berlin/Heidelberg},
  year =        {2008},
  chapter =     {3},
  pages =       {59--94},
)

@MISC( CrL2008d,
  author = "M. Crochemore and T. Lecroq",
  title = "Efficient implementation of {Boyer-Moore} string-matching algorithm",
  note = {Manuscript},
  year = 2008,
  howpublished = {http://www-igm.univ-mlv.fr/$\sim$lecroq/articles/cl2008.pdf},
)

@INPROCEEDINGS(CCR09-pref,
  author =      {Julien Clement and Maxime Crochemore and Giuseppina Rindone},
  title =       {Reverse Engineering Prefix Tables},
  pages =       {289--300},
  booktitle =   {26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009)},
  year =        {2009},
  editor =      {S. Albers and J.-Y. Marion},
  publisher =   {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =     {Dagstuhl, Germany},
  note =		{http://drops.dagstuhl.de/opus/volltexte/2009/1825},
)

@ARTICLE(CEGM09tcs,
  author =      {Maxime Crochemore and Chiara Epifanio and Alessandra Gabriele and Filippo Mignosi},
  title =       {From {N}erode's congruence to Suffix Automata with mismatches},
  journal =     {Theoretical Computer Science},
  volume =      {410},
  number =      {37},
  year =        {2009},
  pages =       {3471--3480},
  note =        {DOI: 10.1016/j.tcs.2009.03.011},
  url =         {http://dx.doi.org/10.1016/j.tcs.2009.03.011},
)

@INPROCEEDINGS{CIIKRW09iwoca,
  AUTHOR =       {Maxime Crochemore and Lucian Ilie and Costas Iliopoulos
                  and Marcin Kubica and Wojciech Rytter and Tomasz Wale{\'n}},
  TITLE =        {{LPF} computation revisited},
  BOOKTITLE =    {IWOCA 2009},
  YEAR =         {2009},
  editor =       {J. Fiala and J. Kratochv\'{\i}l and M. Miller},
  number =       {5874},
  series =       {LNCS},
  pages =        {158--169},
  publisher =    {Springer, Heidelberg},
}

@Misc{IGMA_BliCroHam09,
  author	= {Blin, Guillaume and Crochemore, Maxime and Hamel, Sylvie
               and Vialette, St\'ephane},
  title 	= {{Finding the median of three permutations under the Kendall-tau distance}},
  year		= {2009},
  days		= {13-17},
  month 	= {jul},
  howpublished	= {Extended Abstract in the {\em 7th annual international conference on
               Permutation Patterns}, University of Firenze, Italy},
  url		= {http://www.dsi.unifi.it/~PP2009},
}

@INPROCEEDINGS(CG09psc,
  author =      "Crochemore, Maxime and Giambruno, Laura",
  title =       "On-line construction of a small automaton for a finite set of words",
  booktitle =   "Proceedings of the Prague Stringology Conference 2009",
  address =     "Czech Technical University in Prague, Czech Republic",
  editor =      "J. Holub and J. {\v{Z}}{\v{d}}{\'{a}}rek",
  isbn =        "978-80-01-04403-2",
  year =        "2009",
  pages =       "15--28",
)

@INPROCEEDINGS{CC09csit,
  AUTHOR =       {Supaporn Chairungsee and Maxime Crochemore},
  TITLE =        {Efficient Computing of Longest Previous Reverse Factors},
  BOOKTITLE =    {Seventh International Conference on Computer Science and Information Technologies (CSIT 2009)},
  YEAR =         {2009},
  editor =       {Y. Shoukourian},
  pages =        {27--30},
  publisher =    {The National Academy of Sciences of Armenia Publishers, Yerevan, Armenia},
}

@ARTICLE(CIR09tcs,
  author =      {Maxime Crochemore and Lucian Ilie and Wojciech Rytter},
  title =       {Repetitions in strings: algorithms and combinatorics},
  journal =     {Theoretical Computer Science},
  volume =      {410},
  number =      {50},
  year =        {2009},
  pages =       {5227--5235},
  doi =         {doi:10.1016/j.tcs.2009.08.024},
  issn =        {0304-3975},
)

@INCOLLECTION{CL09encdb-st,
  author    = {Maxime Crochemore and Thierry Lecroq},
  title     = {Suffix Tree},
  booktitle = {Encyclopedia of Database Systems},
  editor    = {Ling Liu and M. Tamer {\"O}zsu},
  year      = {2009},
  pages     = {2876-2880},
  publisher = {Springer US},
  isbn      = {978-0-387-35544-3, 978-0-387-39940-9},
}

@INCOLLECTION{CL09encdb-tries,
  author    = {Maxime Crochemore and Thierry Lecroq},
  title     = {Trie},
  booktitle = {Encyclopedia of Database Systems},
  editor    = {Ling Liu and M. Tamer {\"O}zsu},
  year      = {2009},
  pages     = {3179-3182},
  publisher = {Springer US},
  isbn      = {978-0-387-35544-3, 978-0-387-39940-9},
}

@INCOLLECTION(CH10crc,
  author =      {Maxime Crochemore and Christophe Hancart},
  title =       {Pattern matching in strings},
  booktitle =   {Algorithms and Theory of Computation Handbook},
  editor =      {M. J. Atallah and M. Blanton},
  publisher =   {{CRC} Press},
  year =        {2010},
  chapter =     {13},
  pages =       { },
)

@INCOLLECTION(CL10crc,
  author =      {Maxime Crochemore and Thierry Lecroq},
  title =       {Text data compression algorithms},
  booktitle =   {Algorithms and Theory of Computation Handbook},
  editor =      {M. J. Atallah and M. Blanton},
  publisher =   {{CRC} Press},
  year =        {2010},
  chapter =     {14},
  pages =       { },
)

@INPROCEEDINGS{CIKRW10sofsem,
  AUTHOR =       {Maxime Crochemore and Costas Iliopoulos
                  and Marcin Kubica and Wojciech Rytter and Tomasz Wale{\'n}},
  TITLE =        {Efficient algorithms for two extensions of the {LPF} table:
                  the power of {S}uffix {A}rrays},
  booktitle =    {SOFSEM 2010: Theory and Practice of Computer Science, 36th
                  Conference on Current Trends in Theory and Practice of Computer
                  Science, Spindleruv Ml{\'y}n, Czech Republic},
  year =         {2010},
  editor =       {J. van Leeuwen and A. Muscholl and D. Peleg
                  and J. Pokorn{\'y} and B. Rumpe},
  number =       {5901},
  series =       {LNCS},
  pages =        {296-307},
  address =      {Berlin},
  publisher =    {Springer},
  isbn =         {978-3-642-11265-2},
}

@INCOLLECTION{CIP10esko,
  author    = {Maxime Crochemore and Costas S. Iliopoulos and Solon P. Pissis},
  title     = {A Parallel Algorithm for Fixed-Length Approximate String-Matching
               with {\it k}-mismatches},
  booktitle = {Algorithms and Applications},
  editor    = {Tapio Elomaa and Heikki Mannila and Pekka Orponen},
  publisher = {Springer},
  series    = {LNCS},
  number    = {6060},
  year      = {2010},
  pages     = {92--101},
  isbn      = {978-3-642-12475-4},
}

@INPROCEEDINGS{CIKRRW10-cubic-lata,
  author =       {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and
                  Jakub Radoszewski and Wojciech Rytter and Tomasz Wale\'n},
  title =        {On the maximal number of cubic runs in a string},
  BOOKTITLE =    {LATA 2010},
  YEAR =         {2010},
  editor =       {A.-H. Dediu and H. Fernau and C. Martin-Vide},
  number =       {6031},
  series =       {LNCS},
  pages =        {227--238},
  publisher =    {Springer, Heidelberg},
  note =         {See \texttt{http://arxiv.org/abs/0907.2157}},
}

@INPROCEEDINGS{CIPT10-cover-cpm,
  AUTHOR =       {Maxime Crochemore and Costas S. Iliopoulos and Solon P. Pissis and German Tischler},
  TITLE =        {Cover array string reconstruction},
  BOOKTITLE =    {Combinatorial Pattern Matching},
  YEAR =         {2010},
  editor =       {A. Amir and L. Parida},
  number =       {6129},
  series =       {LNCS},
  pages =        {251--259},
  publisher =    {Springer, Heidelberg},
}

@INPROCEEDINGS{CCIKRRW10-scs-cpm,
  AUTHOR =       {Maxime Crochemore and Marek Cygan and Costas S. Iliopoulos and Marcin Kubica
                  and Jakub Radoszewski and Wojciech Rytter and Tomasz Wale{\'n}},
  TITLE =        {Algorithms for Three Versions of the Shortest Common Superstring Problem},
  BOOKTITLE =    {Combinatorial Pattern Matching},
  YEAR =         {2010},
  editor =       {A. Amir and L. Parida},
  number =       {6129},
  series =       {LNCS},
  pages =        {299--309},
  publisher =    {Springer, Heidelberg},
}

@ARTICLE{CIKRW10fi,
  author =       {Maxime Crochemore and Costas Iliopoulos and Marcin Kubica
                  and Mohammad Sohel Rahman and Tomasz Wale{\'n}},
  title =        {Finding Patterns in Given Intervals},
  JOURNAL =      {Fundamenta Informaticae},
  YEAR =         {2010},
  volume =       {101},
  number =       {3},
  pages =        {173--186},
  note =         {Extended version of \cite{CIR07mfcs}},
}

@ARTICLE(CP10ic,
  author =      {Maxime Crochemore and Ely Porat},
  title =       {Fast computation of a longest increasing subsequence and application},
  journal =     {Information and Computation},
  volume =      {208},
  number =      {9},
  year =        {2010},
  pages =       {1054--1059},
  doi =         {10.1016/j.ic.2010.04.003}
)

@INPROCEEDINGS{CG10reactive-psc,
  author =      {Maxime Crochemore and Dov M. Gabbay},
  TITLE =       {Reactive links to save automata states},
  BOOKTITLE =   {Prague Stringology Conference},
  YEAR =        {2010},
  editor =      {J. Holub and J. Zd{'}\'arek},
  pages =       {1--8},
  publisher =   {Czech Technical University in Prague},
  note =        {ISBN 978-80-01-04597-8},
}

@INPROCEEDINGS{CIKRRW10powers-psc,
  AUTHOR =      {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica
                 and Jakub Radoszewski and Wojciech Rytter and Tomasz Wale{\'n}},
  TITLE =       {New Simple Efficient Algorithms Computing Powers and Runs in Strings},
  BOOKTITLE =   {Prague Stringology Conference},
  YEAR =        {2010},
  editor =      {J. Holub and J. Zd{'}\'arek},
  pages =       {138--149},
  publisher =   {Czech Technical University in Prague},
  note =        {ISBN 978-80-01-04597-8},
}

@INPROCEEDINGS{BC1012sq-psc,
  AUTHOR =      {Golnaz Badkobeh and Maxime Crochemore},
  TITLE =       {Bounded number of squares in infinite repetition-constrained binary words},
  BOOKTITLE =   {Prague Stringology Conference},
  YEAR =        {2010},
  editor =      {J. Holub and J. Zd{'}\'arek},
  pages =       {161--166},
  publisher =   {Czech Technical University in Prague},
  note =        {ISBN 978-80-01-04597-8},
}

@ARTICLE{CFIJ10ijfcs,
  author =      {Maxime Crochemore and Szil\'{a}rd Zsolt Fazekas and Costas Iliopoulos
                 and Inuka Jayasekera},
  TITLE =       {Number of occurrences of powers in strings},
  JOURNAL =     {International Journal of Foundations of Computer Science},
  volume    =   {21},
  number    =   {4},
  year      =   {2010},
  pages     =   {535--547},
}

@INPROCEEDINGS{CIKRRW10powers-spire,
  AUTHOR =       {Maxime Crochemore and Costas Iliopoulos and Marcin Kubica
                  and Jakub Radoszewski and Wojciech Rytter and Tomasz Wale{\'n}},
  TITLE =        {Extracting powers and periods in a string from its runs structure},
  booktitle =    {String Processing and Information Retrieval - SPIRE 2010},
  booktitle =    {SPIRE},
  editor    =    {Edgar Ch{\'a}vez and Stefano Lonardi},
  publisher =    {Springer},
  series    =    {LNCS},
  number    =    {6393},
  year      =    {2010},
  pages     =    {258--269},
  ee        =    {http://dx.doi.org/10.1007/978-3-642-16321-0_27},
}

@INPROCEEDINGS{CT10spire,
  AUTHOR =       {Maxime Crochemore and German Tischler},
  TITLE =        {The Gapped Suffix Arrays: a New Index Structure for Fast Approximate Matching},
  editor    =    {Edgar Ch{\'a}vez and Stefano Lonardi},
  booktitle =    {String Processing and Information Retrieval - SPIRE 2010},
  publisher =    {Springer},
  series    =    {LNCS},
  number    =    {6393},
  year      =    {2010},
  pages     =    {359--364},
  ee        =    {http://dx.doi.org/10.1007/978-3-642-16321-0_37},
}

@ARTICLE{BCHV10pp,
  AUTHOR =       {Guillaume Blin and Maxime Crochemore and Sylvie Hamel and St{\'e}phane Vialette},
  TITLE =        {Medians of an odd number of permutations},
  JOURNAL =      {Pure Mathematics and Applications},
  YEAR =         {2010},
  volume =       {21},
  number =       {2},
  pages =        {161--175},
}

@ARTICLE{CT11lpnf-ipl,
  AUTHOR =       {Maxime Crochemore and German Tischler},
  TITLE =        {Computing Longest Previous non-overlapping Factors},
  JOURNAL =      {Information Processing Letters},
  YEAR =         {2011},
  volume =       {111},
  number =       {6},
  pages =        {291--295},
}

@ARTICLE(CG11ic,
  author =      {Maxime Crochemore and Dov M. Gabbay},
  title =       {Reactive automata},
  journal =     {Information and Computation},
  volume =      {209},
  number =      {4},
  year =        {2011},
  pages =       {692--704},
  DOI =         {10.1016/j.ic.2011.01.002},
)

@ARTICLE(CIT11tcs,
  author =      {Maxime Crochemore and Lucian Ilie and Liviu Tinta},
  title =       {The ``runs'' conjecture},
  journal =     {Theoretical Computer Science},
  volume =      {412},
  number =      {27},
  year =        {2011},
  pages =       {2931--2941},
)

@article{CKMN11,
  author    =   {Maxime Crochemore and Lila Kari and Mehryar Mohri and Dirk Nowotka},
  title     =   {Combinatorial and Algorithmic Aspects of Sequence Processing
                 (Dagstuhl Seminar 11081)},
  journal   =   {Dagstuhl Reports},
  volume    =   {1},
  number    =   {2},
  year      =   {2011},
  pages     =   {47-66},
  ee        =   {http://dx.doi.org/10.4230/DagRep.1.2.47},
  bibsource =   {DBLP, http://dblp.uni-trier.de}
}

@INPROCEEDINGS{BCC11-redund-dlt,
  AUTHOR =       {Golnaz Badkobeh and Supaporn Chairungsee and Maxime Crochemore},
  TITLE =        {Hunting redundancies in strings},
  BOOKTITLE =    {15th Conference on Developments in Language Theory},
  YEAR =         {2011},
  editor =       {G. Mauri and A. Leporati},
  number =       {6795},
  series =       {LNCS},
  pages =        {1--14},
  publisher =    {Springer},
}

@INPROCEEDINGS{BC11-FRt3-words,
  AUTHOR =       {Golnaz Badkobeh and Maxime Crochemore},
  TITLE =        {Finite-Repetition threshold for infinite ternary words},
  BOOKTITLE =    {Proceedings 8th International Conference Words 2011},
  YEAR =         {2011},
  editor =       {P. Ambro\v{z} and \v{S}. Holub and Z. Mas{\'a}kov{\'a}},
  volume =       {63},
  series =       {Electronic Proceedings in Theoretical Computer Science},
  pages =        {37--43},
  address =      {Prague, CZ},
  organization = {Czech Technical University},
}

@INPROCEEDINGS{CCGIP11-cocoon,
  AUTHOR =       {Michalis Christou and Maxime Crochemore and Ondrej Guth and
                  Costas S. Iliopoulos and Solon P. Pissis},
  TITLE =        {On the right-seed array of a string},
  BOOKTITLE =    {17th Annual International Computing and Combinatorics Conference (COCOON)},
  YEAR =         {2011},
  editor =       {B. Fu and D.-Z. Du},
  number =       {6842},
  series =       {LNCS},
  pages =        {492-502},
  publisher =    {Springer},
}

@ARTICLE(BCMS11ieee,
  author =      {Marie-Pierre B{\'e}al and Maxime Crochemore and Bruce E. Moision
                 and Paul H. Siegel},
  title =       {Periodic Finite-Type Shift Spaces},
  journal =     {IEEE Transactions on Information Theory},
  volume =      {57},
  number =      {6},
  year =        {2011},
  pages =       {3677--3691 },
  DOI =         {10.1109/TIT.2011.2143910}
)

@INPROCEEDINGS{CCIKPRRCW11-seeds-cpm,
  AUTHOR =       {Michalis Christou and Maxime Crochemore and Costas S. Iliopoulos and
                  Marcin Kubica and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and
                  Bartosz Szreder and Tomasz Walen},
  TITLE =        {Efficient Seeds Computation Revisited},
  BOOKTITLE =    {Combinatorial Pattern Matching},
  YEAR =         {2011},
  editor =       {R. Giancarlo and G. Manzini},
  number    =    {6661},
  series =       {LNCS},
  pages =        {350-363},
  address =      {Berlin},
  publisher =    {Springer},
}

@INPROCEEDINGS{CC11ciaa,
  AUTHOR =       {Supaporn Chairungsee and Maxime Crochemore},
  TITLE =        {Building Phylogeny with Minimal Absent Words},
  BOOKTITLE =    {Conference on Implementation and Application of Automata (CIAA)},
  YEAR =         {2011},
  editor =       {B. Bouchou-Markhoff and J.-M. Champarnaud and D. Maurel},
  number =       {6807},
  series =       {LNCS},
  pages =        {100--109},
  publisher =    {Springer},
}

@INPROCEEDINGS{CCFIJP11-spire,
  AUTHOR =       {Michalis Christou and Maxime Crochemore and Tom{\'a}s Flouri and
                  Costas Iliopoulos and Jan Janousek and Bo\v{r}ivoj Melichar and
                  Solon Pissis},
  TITLE =        {Computing all Subtree Repeats in Ordered Ranked Trees},
  booktitle =    {String Processing and Information Retrieval, 18th International
                 Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011.
                 Proceedings},
  editor    =    {Roberto Grossi and
                 Fabrizio Sebastiani and
                 Fabrizio Silvestri},
  YEAR =         {2011},
  editor =       {R. Grossi and F. Sebastiani and F. Silvestri},
  series    =    {LNCS},
  volume    =    {7024},
  pages     =    {338-343},
  publisher =    {Springer},
}

@article{ACIKSTY12-acm-surveys,
  author    = {Anisa Al-Hafeedh and Maxime Crochemore and Lucian Ilie and
               Evguenia Kopylova and William F. Smyth and German Tischler and
               Munina Yusufu},
  title     = {A comparison of index-based lempel-Ziv LZ77 factorization
               algorithms},
  journal   = {ACM Comput. Surv.},
  volume    = {45},
  number    = {1},
  year      = {2012},
  pages     = {5},
  ee        = {http://doi.acm.org/10.1145/2379776.2379781},
}

@ARTICLE{CGL12auto-ijfcs,
  AUTHOR =       {Maxime Crochemore and Laura Giambruno and Alessio Langiu},
  TITLE =        {On-line construction of a small automaton for a finite set of words},
  JOURNAL =      {Int. J. Found. Comput. Sci.},
  YEAR =         {2012},
  volume =       {23},
  number =       {2},
  pages =        {281--301},
  note =         {Journal version of \cite{CG09psc}},
  doi =          {10.1142/S0129054112400138}
}

@ARTICLE{CCI12-ijfcs,
  AUTHOR =       {Michalis Christou and Maxime Crochemore and Costas Iliopoulos},
  TITLE =        {Identifying all abelian periods of a string in quadratic time and relevant problems},
  JOURNAL =      {Int. J. Found. Comput. Sci.},
  YEAR =         {2012},
  volume =       {23},
  number =       {6},
  pages =        {1371--1384},
  doi =          {10.1142/S0129054112500190},
  note =         {See \texttt{http://arxiv.org/abs/1207.1307}},
}

@ARTICLE{CCFIJMP12-ipl,
  AUTHOR =       {Michalis Christou and Maxime Crochemore and Tom{\'a}s Flouri and
                  Costas Iliopoulos and Jan Janousek and Bo\v{r}ivoj Melichar and
                  Solon Pissis},
  title     =    {Computing all subtree repeats in ordered trees},
  JOURNAL =      {Information Processing Letters},
  volume    =    {112},
  number    =    {24},
  year      =    {2012},
  pages     =    {958-962},
  doi =          {http://dx.doi.org/10.1016/j.ipl.2012.09.001},
  note =         {Presented at SPIRE 2011 \cite{CCFIJP11-spire}},
}

@ARTICLE{BC1012sq-rairo,
  AUTHOR =       {Golnaz Badkobeh and Maxime Crochemore},
  TITLE =        {Fewest repetitions in infinite binary words},
  JOURNAL =      {RAIRO - Theoretical Informatics and Applications},
  YEAR =         {2012},
  volume =       {46},
  number =       {1},
  pages =        {17--31},
  doi =          {10.1051/ita/2011109},
  note =         {See \texttt{http://arxiv.org/abs/1207.5723}},
}

@ARTICLE{CIKRRW12cubic-jcss,
  AUTHOR =       {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica
                  and Jakub Radoszewski and Wojciech Rytter and Tomasz Wale{\'n}},
  title     =    {The maximal number of cubic runs in a word},
  journal   =    {Journal Computer System Science},
  volume    =    {78},
  number    =    {6},
  year      =    {2012},
  pages     =    {1828-1836},
  ee        =    {http://dx.doi.org/10.1016/j.jcss.2011.12.005},
  bibsource =    {DBLP, http://dblp.uni-trier.de},
  note =         {Presented at LATA 2010 \cite{CIKRRW10-cubic-lata}},
}

@article{CIKRW12-jda,
  author    =   {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and
                 Wojciech Rytter and Tomasz Wale{\'n}},
  title     =   {Efficient algorithms for three variants of the LPF table},
  journal   =   {J. Discrete Algorithms},
  volume    =   {11},
  year      =   {2012},
  pages     =   {51--61},
  ee        =   {http://dx.doi.org/10.1016/j.jda.2011.02.002},
}

@ARTICLE{CKRRW12sumexp-jda,
  AUTHOR =      {Maxime Crochemore and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter
                 and Tomasz Wale{\'n}},
  TITLE =       {On the Maximal Sum of Exponents of Runs in a String},
  journal   =   {J. Discrete Algorithms},
  volume    =   {14},
  year      =   {2012},
  pages     =   {29-36},
  arxiv     =   {http://arxiv.org/abs/1003.4866},
  ee        =   {http://dx.doi.org/10.1016/j.jda.2011.12.016},
}

@ARTICLE{CGLMR12parsing-jda,
  AUTHOR =       {Maxime Crochemore and Laura Giambruno and Alessio Langiu
                  and Filippo Mignosi and Antonio Restivo},
  TITLE =        {Dictionary-Symbolwise Flexible Parsing},
  JOURNAL =      {Journal of Discrete Algorithms},
  volume    =    {14},
  year      =    {2012},
  pages     =    {74-90},
  ee        =    {http://dx.doi.org/10.1016/j.jda.2011.12.021},
  note =         {Special issue co-edited by C.S. Iliopoulos and W.F. Smyth},
}

@article{DBLP:journals/jda/ChristouCGIP12,
  author    = {Michalis Christou and Maxime Crochemore and Ondrej Guth and
               Costas S. Iliopoulos and Solon P. Pissis},
  title     = {On left and right seeds of a string},
  journal   = {J. Discrete Algorithms},
  volume    = {17},
  year      = {2012},
  pages     = {31-44},
  ee        = {http://dx.doi.org/10.1016/j.jda.2012.10.004},
}

@ARTICLE{CIKRW12tcs,
  author =       {Maxime Crochemore and Costas Iliopoulos and Marcin Kubica
                  and Mohammad Sohel Rahman and German Tischler and Tomasz Wale{\'n}},
  title =        {Improved algorithms for the range next value problem and applications},
  JOURNAL =      {Theoretical Computer Science},
  YEAR =         {2012},
  volume =       {434},
  pages =        {23--34},
  ee =           {http://dx.doi.org/10.1016/j.tcs.2012.02.015},
  note =         {Journal version of \cite{CIKRW08stacs}},
}

@ARTICLE{CC12-tcs,
  AUTHOR =       {Supaporn Chairungsee and Maxime Crochemore},
  TITLE =        {Using minimal absent words to build phylogeny},
  JOURNAL =      {Theoretical Computer Science},
  YEAR =         {2012},
  volume =       {450},
  number =       {1},
  pages =        {109--116},
  ee =           {http://dx.doi.org/10.1016/j.tcs.2012.04.031},
  note =         {Journal version of \cite{CC11ciaa}},
}

@inproceedings{CIKKRRTW12-cpm,
  author    = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and
               Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and
               Wojciech Tyczynski and Tomasz Wale{\'n}},
  title     = {The Maximum Number of Squares in a Tree},
  editor    = {Juha K{\"a}rkk{\"a}inen and
               Jens Stoye},
  booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium,
               CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {7354},
  year      = {2012},
  pages     = {27--40},
  ee        = {http://dx.doi.org/10.1007/978-3-642-31265-6_3},
}

@inproceedings{DBLP:conf/cube/AlatabbiCIO12,
  author    = {Ali Alatabbi and Maxime Crochemore and
               Costas S. Iliopoulos and Tewogboye A. Okanlawon},
  title     = {Overlapping repetitions in weighted sequence},
  booktitle = {CUBE International IT Conference {\&} Exhibition, CUBE
               '12, Pune, India - September 03 - 06, 2012},
  editor    = {Vidyasagar Potdar and
               Debajyoti Mukhopadhyay},
  publisher = {ACM},
  isbn      = {978-1-4503-1185-4},
  year      = {2012},
  pages     = {435-440},
  ee        = {http://doi.acm.org/10.1145/2381716.2381798},
}

@inproceedings{DBLP:conf/cube/AlatabbiCDM12,
  author    = {Ali Alatabbi and
               Maxime Crochemore and
               Jacqueline W. Daykin and
               Laurent Mouchard},
  title     = {Lyndon fountains and the Burrows-Wheeler transform},
  booktitle = {CUBE International IT Conference {\&} Exhibition, CUBE
               '12, Pune, India - September 03 - 06, 2012},
  editor    = {Vidyasagar Potdar and
               Debajyoti Mukhopadhyay},
  publisher = {ACM},
  year      = {2012},
  pages     = {441-446},
  ee        = {http://doi.acm.org/10.1145/2381716.2381799},
}

@INPROCEEDINGS{BCT12spire,
  AUTHOR =       {Golnaz Badkobeh and Maxime Crochemore and Chalita Toopsuwan},
  TITLE =        {Computing the maximal-exponent repeats of an overlap-free string in linear time},
  BOOKTITLE =    {Symposium on String Processing and Information Retrieval},
  YEAR =         {2012},
  editor =       {L. Calder´on-Benavides and C. González-Caro and E. Chávez and N. Ziviani},
  number =       {7608},
  series =       {LNCS},
  pages =        {61--72},
  publisher =    {Springer},
}

@ARTICLE{CIIKRW13-ejc,
  AUTHOR =       {Maxime Crochemore and Lucian Ilie and Costas Iliopoulos
                  and Marcin Kubica and Wojciech Rytter and Tomasz Wale{\'n}},
  TITLE =        {Computing the Longest Previous Factor},
  JOURNAL =      {European Journal of Combinatorics},
  YEAR =         {2013},
  volume =       {34},
  number =       {1},
  pages =        {15--26},
  ee =           {http://dx.doi.org/10.1016/j.ejc.2012.07.011},
  note =         {Guest editors: J. Kratochv\'{\i}l and M. Miller.
                  Presented at IWOCA 2009 \cite{CIIKRW09iwoca}},
}

@article{IKKPRRTW13-ipl,
  author    = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and
               Marcin Kubica and Jakub Pachocki and Jakub Radoszewski and
               Wojciech Rytter and Wojciech Tyczynski and Tomasz Walen},
  title     = {A note on efficient computation of all Abelian periods in
               a string},
  journal   = {Inf. Process. Lett.},
  volume    = {113},
  number    = {3},
  year      = {2013},
  pages     = {74-77},
  ee        = {http://dx.doi.org/10.1016/j.ipl.2012.11.001},
}