\begin{thebibliography}{100}

\bibitem{CC78a}
Alain Cardon and Maxime Crochemore.
\newblock Minimisation d'automates et algorithme de {H}opcroft.
\newblock Rapport du laboratoire d'informatique 78-02, Universit{\'e} de
  Haute-Normandie, 1978.

\bibitem{CC78b}
Alain Cardon and Maxime Crochemore.
\newblock Deux applications du tri lexicographique.
\newblock Rapport du laboratoire d'informatique 78-03, Universit{\'e} de
  Haute-Normandie, 1978.

\bibitem{CC78these}
Alain Cardon and Maxime Crochemore.
\newblock {\em Standardisation de s{\'e}ries formelles et minimisation
  d'automates}.
\newblock Th{\`e}se de 3-{\`eme} cycle, Universit{\'e} de Haute-Normandie, 4
  d\'ecembre 1978.

\bibitem{Cro80litp}
Maxime Crochemore.
\newblock Simulation des automates d{\'e}terministes {\`a} pile d'apr{\`e}s
  {C}ook et {J}ones.
\newblock In {\em Actes du s{\'e}minaire d'informatique th{\'e}orique du
  {L.I.T.P.}} Universit{\'e}s Paris 6-7, 1980.

\bibitem{CC80rairo}
Alain Cardon and Maxime Crochemore.
\newblock D{\'e}termination de la repr{\'e}\-sen\-tation standard d'une
  s{\'e}rie reconnaissable.
\newblock {\em RAIRO Informatique Th{\'e}orique/Theoretical Informatics},
  14(4):371--379, 1980.

\bibitem{Cro81ipl}
Maxime Crochemore.
\newblock An optimal algorithm for computing the repetitions in a word.
\newblock {\em Information Processing Letters}, 12(5):244--250, 1981.

\bibitem{Cro82tcs}
Maxime Crochemore.
\newblock Sharp characterization of square-free morphisms.
\newblock {\em Theoretical Computer Science}, 18(2):221--226, 1982.

\bibitem{CC82tcs-2}
Alain Cardon and Maxime Crochemore.
\newblock Partitioning a graph in {$O(|A|\log_2|V|)$}.
\newblock {\em Theoretical Computer Science}, 19(1):85--98, 1982.

\bibitem{Cro82litp}
Maxime Crochemore.
\newblock R{\'e}sultats de d{\'e}cidabilit{\'e} pour les morphismes faiblement
  sans carr{\'e}.
\newblock Rapport {L.I.T.P.} 82-38, Universit{\'e}s Paris 6-7, 1982.

\bibitem{Cro82litp-2}
Maxime Crochemore.
\newblock Sur les ensembles in{\'e}vitables.
\newblock Rapport {L.I.T.P.} 82-56, Universit{\'e}s Paris 6-7, 1982.

\bibitem{Cro82eatcs}
Maxime Crochemore.
\newblock A solution to {Berstel}'s problem {P3}.
\newblock {\em Bul. Euro. Assoc. Theor. Comput. Sci.}, 18:9--11, 1982.

\bibitem{Cro83cow}
Maxime Crochemore.
\newblock Tests sur les morphismes faiblement sans carr{\'e}.
\newblock In L.~Cummings, editor, {\em Combinatorics on Words (Waterloo, Ont.,
  1982)}, pages 63--89. Academic Press, 1983.

\bibitem{Cro83eatcs}
Maxime Crochemore.
\newblock A solution to {P12}.
\newblock {\em Bul. Euro. Assoc. Theor. Comput. Sci.}, 19:15--16, 1983.

\bibitem{CLW83ipl}
Maxime Crochemore, Michel Lerest, and Philippe Wender.
\newblock An optimal test on finite unavoidable sets of words.
\newblock {\em Information Processing Letters}, 16(4):179--180, 1983.

\bibitem{Cro83cras}
Maxime Crochemore.
\newblock Recherche lin{\'e}aire d'un carr{\'e} dans un mot.
\newblock {\em C. R. Acad. Sc. Paris S\'er. I Math.}, 296(18):781--784, 1983.

\bibitem{Cro83theseetat}
Maxime Crochemore.
\newblock {\em R{\'e}gularit{\'e}s {\'e}vitables}.
\newblock Th{\`e}se d'{\'e}tat, Universit{\'e} de Haute-Normandie, 20 juin
  1983.

\bibitem{Cro83comb}
Maxime Crochemore.
\newblock Mots et morphismes sans carr{\'e}.
\newblock In {\em Combinatorial Mathematics (Marseille-Luminy, 1981)},
  number~75 in Math. Stud., pages 235--245. North-Holland, 1983.

\bibitem{Cro84eatcs}
Maxime Crochemore.
\newblock Linear searching for a square in a word.
\newblock {\em Bul. Euro. Assoc. Theor. Comput. Sci.}, 24:66--72, 1984.
\newblock Presented at ICALP'84. Abstract in \textit{Automata, Languages and
  Programming}, LNCS 172, pp. 137. Springer, Berlin, 1984.

\bibitem{Cro85caow}
Maxime Crochemore.
\newblock Optimal factor transducers.
\newblock In A.~Apostolico and Z.~Galil, editors, {\em Combinatorial Algorithms
  on Words (Maratea, 1984)}, number~12 in NATO Adv. Sci. Inst. Ser. F, Comput.
  Systems Sci., pages 31--43. Springer-Verlag, 1985.

\bibitem{CH86ita}
Jean-Jacques H{\'e}brard and Maxime Crochemore.
\newblock Calcul de la distance par les sous-mots.
\newblock {\em Informatique th{\'e}orique et applications/Theoretical
  Informatics and Applications}, 20(4):441--456, 1986.

\bibitem{Cro86tcs}
Maxime Crochemore.
\newblock Transducers and repetitions.
\newblock {\em Theoretical Computer Science}, 45(1):63--86, 1986.

\bibitem{CS86ifia}
Maxime Crochemore and Ahmed Saoudi, editors.
\newblock {\em Actes des journ\'ees Informatique Fondamentale et Intelligence
  Artificielle (Villetaneuse, 1986)}. Universit{\'e} Paris-Nord, 1986.

\bibitem{Cro86litp}
Maxime Crochemore.
\newblock Calcul de la f-distance de deux mots.
\newblock In {\em Actes du s{\'e}minaire d'informatique th{\'e}orique du
  {L.I.T.P.}}, pages 25--36. Universit{\'e}s Paris 6-7, 1986.

\bibitem{Cro86eatcs}
Maxime Crochemore.
\newblock Computing {LCF} in linear time.
\newblock {\em Bul. Euro. Assoc. Theor. Comput. Sci.}, 30:57--61, 1986.

\bibitem{CP87ladl}
Maxime Crochemore and Jean-Pierre P{\'e}cuchet.
\newblock Compression de dictionnaires.
\newblock Rapport {L.A.D.L.}, Universit{\'e} Paris 7, 1987.

\bibitem{Cro87tapsoft}
Maxime Crochemore.
\newblock Longest common factor of two words.
\newblock In Ehrig, Kowalski, Levi, and Montanari, editors, {\em TAPSOFT'87
  (Pisa, 1987)}, number 249 in LNCS, pages 26--36. Springer-Verlag, 1987.

\bibitem{CP87ladl-2}
Maxime Crochemore and Jean-Pierre P{\'e}cuchet.
\newblock R{\'e}duction d'un lexique pour micro-ordinateur.
\newblock Rapport {L.A.D.L.}, Universit{\'e} Paris 7, 1987.

\bibitem{CS87ifia}
Maxime Crochemore and Ahmed Saoudi, editors.
\newblock {\em Actes des journ\'ees Informatique Fondamentale et Intelligence
  Artificielle (Villetaneuse, 1987)}. Universit{\'e} Paris-Nord, 1987.

\bibitem{CP88ciap}
Maxime Crochemore and Dominique Perrin.
\newblock Pattern matching in strings.
\newblock In V.~Cantoni, V.~Di Gesu, and S.~Levialdi, editors, {\em Proceedings
  of the 4th conference on Image Analysis and Processing (Cefal\`u, 1988)},
  number 249 in LNCS, pages 67--79. Plenum Press, 1988.

\bibitem{CP88eatcs}
Maxime Crochemore and Dominique Perrin.
\newblock Critical factorizations of words.
\newblock {\em Bul. Euro. Assoc. Theor. Comput. Sci.}, 34:47--52, 1988.

\bibitem{Cro88lipn}
Maxime Crochemore.
\newblock Compression de textes: les m{\'e}thodes.
\newblock Rapport {L.I.P.N.} 88-4, Universit{\'e} Paris-Nord, 1988.

\bibitem{Cro88mfcs}
Maxime Crochemore.
\newblock String matching with constraints.
\newblock In M.~Chytil, L.~Janiga, and S.~Koubek, editors, {\em Mathematical
  Foundations of Computer Science 1988 (Carlsbad, 1988)}, number 324 in LNCS,
  pages 44--58. Springer-Verlag, 1988.

\bibitem{Cro88fsttcs}
Maxime Crochemore.
\newblock Constant-space string matching.
\newblock In Nori and Kumar, editors, {\em Foundations of Software Technology,
  Theoretical Computer Science (Puna, 1988)}, number 338 in LNCS, pages 80--87.
  Springer-Verlag, 1988.

\bibitem{BCP89adm}
Jean Berstel, Maxime Crochemore, and Jean-Eric Pin.
\newblock Thue-morse sequence and $p$-adic topology of the free monoid.
\newblock {\em Annals of Discrete Mathematics}, 76(2):89--94, 1989.

\bibitem{Cro89elecdic}
Maxime Crochemore.
\newblock Data compression with substitution.
\newblock In M.~Gross and D.~Perrin, editors, {\em Electronic Dictionaries and
  Automata in Computational Linguistics (Ol\'eron, 1987)}, number 377 in LNCS,
  pages 1--16. Springer-Verlag, 1989.

\bibitem{Cro89finaut}
Maxime Crochemore.
\newblock Automata and algorithms.
\newblock In J-E. Pin, editor, {\em Formal Properties of Finite Automata and
  Applications (Ramatuelle, 1988)}, number 386 in LNCS, pages 166--175.
  Springer-Verlag, 1989.

\bibitem{CZ89litp}
Maxime Crochemore and Marc Zipstein.
\newblock Transducteurs arithm{\'e}tiques.
\newblock Rapport {L.I.T.P.} 89-12, Universit{\'e}s Paris 6-7, 1989.

\bibitem{Cro89eatcs}
Maxime Crochemore.
\newblock String-matching and periods.
\newblock {\em Bul. Euro. Assoc. Theor. Comput. Sci.}, 39:149--153, 1989.

\bibitem{Cro90seq}
Maxime Crochemore.
\newblock Note on constant-space string matching.
\newblock In R.~Capocelli, editor, {\em Sequences: Combinatorics, Compression,
  Security, and Transmission (Positano, 1988)}. Springer-Verlag, 1990.

\bibitem{CR90stacs}
Maxime Crochemore and Wojciech Rytter.
\newblock Parallel computations on strings and arrays.
\newblock In C.~Choffrut and T.~Lengauer, editors, {\em STACS'90 (Rouen,
  1990)}, number 415 in LNCS, pages 109--125. Springer-Verlag, 1990.

\bibitem{CN90caap}
Maxime Crochemore and Jean N{\'e}raud.
\newblock Unitary monoid with two generators: an algorithmic point of view.
\newblock In A.~Arnold, editor, {\em CAAP'90, proceedings of the 15th
  Colloquium on Trees in Algebra and Programming (Copenhagen, 1990)}, number
  431 in LNCS, pages 117--131. Springer-Verlag, 1990.

\bibitem{CR90ipl}
Maxime Crochemore and Wojciech Rytter.
\newblock Parallel construction of minimal suffix and factor automata.
\newblock {\em Information Processing Letters}, 35(3):121--128, 1990.

\bibitem{CR90mfcs}
Maxime Crochemore and Wojciech Rytter.
\newblock Parallel construction of minimal suffix and factor automata.
\newblock In B.~Rovan, editor, {\em MFCS'90 (Bansk\'a Bistrica, 1990)}, number
  452 in LNCS, pages 217--223. Springer-Verlag, 1990.

\bibitem{CR90litp}
Maxime Crochemore and Wojciech Rytter.
\newblock Testing square-freeness of strings by an optimal parallel algorithm
  in logarithmic time.
\newblock Rapport {L.I.T.P.} 90-63, Universit{\'e}s Paris 6-7, 1990.

\bibitem{Cro90mons}
Maxime Crochemore.
\newblock A la recherche d'un mot.
\newblock In V.~Bruy{\`e}re, editor, {\em Actes des Journ{\'e}es Montoises
  (Mons, 1990)}, pages 34--38, Universit{\'e} de Mons-Hainaut, Belgique, 1990.

\bibitem{CCMR91tcs}
Maxime Crochemore, Michal Chytil, Burkhard Monien, and Wojciech Rytter.
\newblock On the parallel recognition of unambiguous context-free languages.
\newblock {\em Theoretical Computer Science}, 81(2):311--316, 1991.

\bibitem{CR91ipl}
Maxime Crochemore and Wojciech Rytter.
\newblock Efficient parallel algorithms to test square-freeness and factorize
  strings.
\newblock {\em Information Processing Letters}, 38(2):57--60, 1991.

\bibitem{CR91tcs}
Maxime Crochemore and Wojciech Rytter.
\newblock Usefulness of the {K}arp-{M}iller-{R}osenberg algorithm in parallel
  computations on strings and arrays.
\newblock {\em Theoretical Computer Science}, 88(1):59--82, 1991.

\bibitem{AC91ic}
Alberto Apostolico and Maxime Crochemore.
\newblock Optimal canonization of all substrings of a string.
\newblock {\em Information and Computation}, 95(1):76--95, 1991.

\bibitem{CP91jacm}
Maxime Crochemore and Dominique Perrin.
\newblock Two-way string-matching.
\newblock {\em J. Assoc. Comput. Mach.}, 38(3):651--675, 1991.

\bibitem{CG91ijac}
Maxime Crochemore and Pavel Goralcik.
\newblock Mutually avoiding ternary words of small exponent.
\newblock {\em International Journal of Algebra and Computation},
  1(4):407--410, 1991.

\bibitem{Cro92cpm}
Maxime Crochemore, editor.
\newblock {\em Combinatorial Pattern Matching (Paris, 1990)}. Elsevier, 1992.
\newblock Special issue of {\it Theoretical Computer Science}, volume 92(1).

\bibitem{Cro92tcs}
Maxime Crochemore.
\newblock String-matching on ordered alphabets.
\newblock {\em Theoretical Computer Science}, 92(1):33--47, 1992.

\bibitem{CCGJLPR92stacs}
Maxime Crochemore, Artur Czumaj, Leszek G\c{a}sieniec, Stefan Jarominek,
  Thierry Lecroq, Wojciech Plandowski, and Wojciech Rytter.
\newblock Speeding up two string-matching algorithms.
\newblock In A.~Finkel and M.~Jantzen, editors, {\em STACS'92 (Cachan, 1992)},
  number 577 in LNCS, pages 589--600. Springer-Verlag, 1992.

\bibitem{CCGJLPR92auto}
Maxime Crochemore, Artur Czumaj, Leszek G\c{a}sieniec, Stefan Jarominek,
  Thierry Lecroq, Wojciech Plandowski, and Wojciech Rytter.
\newblock Deux m{\'e}thodes pour acc{\'e}l{\'e}rer l'algorithme de
  {B}oyer-{M}oore.
\newblock In D.~Krob, editor, {\em Th{\'e}orie des automates et applications,
  Universit{\'e} de Rouen}, pages 45--63. Universit{\'e} de Rouen, 1992.

\bibitem{CN92tcs}
Jean N{\'e}raud and Maxime Crochemore.
\newblock A string-matching interpretation of the equation $x^my^n=z^p$.
\newblock {\em Theoretical Computer Science}, 92(1):145--164, 1992.

\bibitem{ACGM92cpm}
Alberto Apostolico, Maxime Crochemore, Zvi Galil, and Udi Manber, editors.
\newblock {\em Combinatorial Pattern Matching (Tucson, Arizona, 1992)}, number
  644 in LNCS. Springer-Verlag, 1992.

\bibitem{CGR92litp}
Maxime Crochemore, Leszek G\c{a}sieniec, and Wojciech Rytter.
\newblock Turbo-{BM}.
\newblock Rapport {L.I.T.P.} 92.61, Universit{\'e}s Paris 6-7, 1992.

\bibitem{CR92pia}
Maxime Crochemore and Wojciech Rytter.
\newblock Note on two-dimensional pattern matching by optimal parallel
  algorithms.
\newblock In A.~Nakamura, M.~Nivat, A.~Saoudi, P.~S.~P. Wang, and K.~Inoue,
  editors, {\em Parallel Image Analysis (Ube, 1992)}, number 654 in LNCS, pages
  100--112. Springer-Verlag, 1992.

\bibitem{ACHP93spaceops}
Maxime Crochemore, Jean-Paul Arcangeli, Jean-No{\"e}l Hourcastagnou, and
  Jean-Eric Pin.
\newblock Compression for an effective management of telemetry data.
\newblock In {\em SPACEOPS'92, Proc. of the Second International Symposium on
  Ground Data Systems for Space Operations (Pasadena, 1992)}, pages 823--830.
  Jet Propulsion Laboratory Publications, 1993.

\bibitem{CPP93cnrs}
Maxime Crochemore, Dominique Perrin, and Jean-Eric Pin.
\newblock Les automates finis.
\newblock In {\em Le Courrier du C.N.R.S., la recherche en informatique}, pages
  48--51. C.N.R.S., 1993.

\bibitem{CS93ig}
Maxime Crochemore, editor.
\newblock {\em Informatique et g\'enome (Marne-la-Vall\'ee, 1993)}.
  Universit{\'e} de Marne-la-Vall\'ee, 1993.

\bibitem{ACGM93cpm}
Alberto Apostolico, Maxime Crochemore, Zvi Galil, and Udi Manber, editors.
\newblock {\em Combinatorial Pattern Matching (Padova, 1993)}, number 684 in
  LNCS. Springer-Verlag, 1993.

\bibitem{CR93seq}
Maxime Crochemore and Wojciech Rytter.
\newblock Periodic prefixes in texts.
\newblock In U.~Vaccaro R.~Capocelli, A. De~Santis, editor, {\em Sequences II
  (Positano, 1991)}, pages 153--165. Springer-Verlag, New York, 1993.

\bibitem{CGR93ipl}
Maxime Crochemore, Leszek G\c{a}sieniec, and Wojciech Rytter.
\newblock Two-dimensional pattern matching by sampling.
\newblock {\em Information Processing Letters}, 46(4):159--162, 1993.

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

\bibitem{CCGJLPR93igm}
Maxime Crochemore, Artur Czumaj, Leszek G\c{a}sieniec, Stephan Jaromi\-nek,
  Thierry Lecroq, Wojciech Plandowski, and Wojciech Rytter.
\newblock Fast multi-pattern matching.
\newblock Rapport {I.G.M.} 93-3, Universit\'e de Marne-la-Vall\'ee, 1993.

\bibitem{CR94btcs}
Maxime Crochemore and Wojciech Rytter.
\newblock On two-dimensional pattern matching by optimal parallel algorithms.
\newblock {\em Theoretical Computer Science}, 132(1--2):403--414, 1994.

\bibitem{CCGJLPR94algo}
Maxime Crochemore, Artur Czumaj, Leszek G\c{a}sieniec, Stefan Jarominek,
  Thierry Lecroq, Wojciech Plandowski, and Wojciech Rytter.
\newblock Speeding up two string-matching algorithms.
\newblock {\em Algorithmica}, 12(4--5):247--267, 1994.

\bibitem{CG94cpm}
Maxime Crochemore and Dan Gusfield, editors.
\newblock {\em Combinatorial Pattern Matching (Asilomar, California, 1994)},
  number 807 in LNCS. Springer-Verlag, 1994.

\bibitem{CR94oup}
Maxime Crochemore and Wojciech Rytter.
\newblock {\em Text algorithms}.
\newblock Oxford University Press, 1994.
\newblock 412 pages.

\bibitem{AC95mst}
Alberto Apostolico and Maxime Crochemore.
\newblock Fast parallel {L}yndon factorization and applications.
\newblock {\em Mathematical System Theory}, 28:89--108, 1995.

\bibitem{CGPR95stacs}
Maxime Crochemore, Leszek G\c{a}sieniec, Wojciech Plandowski, and Wojciech
  Rytter.
\newblock Two-dimensional pattern matching in linear time and small space.
\newblock In E.W. Mayr and C.~Puech, editors, {\em {STACS'95}}, number 900 in
  LNCS, pages 181--192. Springer-Verlag, 1995.

\bibitem{CR95latin}
Maxime Crochemore and Wojciech Rytter.
\newblock On linear-time alphabet-independent 2-dimensional pattern matching.
\newblock In R.~Baeza-Yates, E.~Goles, and P.V. Poblete, editors, {\em
  {LATIN'95} (Valparaiso, 1995)}, number 911 in LNCS, pages 220--229.
  Springer-Verlag, 1995.

\bibitem{CR95algo}
Maxime Crochemore and Wojciech Rytter.
\newblock Squares, cubes and time-space efficient string-searching.
\newblock {\em Algorithmica}, 13(5):405--425, 1995.

\bibitem{CM96cpm}
Nadia El~Mabrouk and Maxime Crochemore.
\newblock {Boyer}-{Moore} strategy to efficient approximate string matching.
\newblock In D.~Hirschberg and E.W. Myers, editors, {\em Combinatorial Pattern
  Matching (Labuna Beach, California, 1996)}, number 1075 in LNCS, pages
  24--38. Springer-Verlag, 1996.

\bibitem{CL96acm}
Maxime Crochemore and Thierry Lecroq.
\newblock Pattern matching and text compression algorithms.
\newblock {\em ACM Computing Surveys}, 28, 1:39--41, 1996.

\bibitem{CL96wsp}
Maxime Crochemore and Thierry Lecroq.
\newblock Tight bounds on the complexity of the {Apostolico-Giancarlo}
  algorithm.
\newblock In N.~Ziviani, R.~Baeza-Yates, and K.~Guimar{\~a}es, editors, {\em
  {WSP 1996} (Recife, 1996)}, pages 64--74. Carleton University Press, 1996.

\bibitem{CL97crc}
Maxime Crochemore and Thierry Lecroq.
\newblock Pattern matching and text compression algorithms.
\newblock In Allen~B. Tucker, editor, {\em The Computer Science and Engineering
  Handbook}, chapter~8, pages 162--202. {CRC} Press, 1997.

\bibitem{CGGPR97siamjc}
Maxime Crochemore, Zvi Galil, Leszek G\c{a}sieniec, Kunsoo Park, and Wojciech
  Rytter.
\newblock Constant-time randomized parallel string matching.
\newblock {\em {SIAM} Journal of Computing}, 26(4):950--960, 1997.

\bibitem{CH97springer}
Maxime Crochemore and Christophe Hancart.
\newblock Automata for matching patterns.
\newblock In G.~Rozenberg and A.~Salomaa, editors, {\em Handbook of Formal
  Languages}, volume 2, Linear Modeling: Background and Application, chapter~9,
  pages 399--462. Springer-Verlag, 1997.

\bibitem{CV97cpm}
Maxime Crochemore and Renaud V\'erin.
\newblock Direct construction of compact directed acyclic word graphs.
\newblock In A~Apostolico and J.~Hein, editors, {\em Combinatorial Pattern
  Matching (Aarhus, 1997)}, number 1264 in LNCS, pages 116--129.
  Springer-Verlag, 1997.

\bibitem{CV97slcs}
Maxime Crochemore and Renaud V\'erin.
\newblock On compact directed acyclic word graphs.
\newblock In J.~Mycielski, G.~Rozenberg, and A.~Salomaa, editors, {\em
  Structures in Logic and Computer Science}, number 1261 in LNCS, pages
  192--211. Springer-Verlag, 1997.

\bibitem{Cro97pma}
Maxime Crochemore.
\newblock Off-line exact serial string searching.
\newblock In A~Apostolico and Galil Z., editors, {\em Pattern Matching
  Algorithms}, pages 1--53. {O}xford {U}niversity {P}ress, 1997.

\bibitem{CL97ipl}
Maxime Crochemore and Thierry Lecroq.
\newblock Tight bounds on the complexity of the {Apostolico-Giancarlo}
  algorithm.
\newblock {\em Information Processing Letters}, 63(4):195--203, 1997.
\newblock Final version of \cite{CL96wsp}.

\bibitem{CIK97algo}
Maxime Crochemore, Costas~S. Iliopoulos, and Maureen Korda.
\newblock Two-dimensional prefix string matching and covering on square
  matrices.
\newblock {\em Algorithmica}, 20:353--373, 1998.

\bibitem{CGR97seq}
Maxime Crochemore, Leszek G\c{a}sieniec, and Wojciech Rytter.
\newblock Constant-space string matching in sublinear average time.
\newblock In B.~Carpentieri, A.~De Santis, U.~Vaccaro, and J.A. Storer,
  editors, {\em Compression and Complexity of Sequences (Positano, 1997)},
  pages 230--239. IEEE Computer Society, 1998.

\bibitem{CIKR98awoca}
Maxime Crochemore, Costas~S. Iliopoulos, Maureen Korda, and James~F. Reid.
\newblock Two-dimensional dictionary prefix-matching.
\newblock In C.~S. Iliopoulos, editor, {\em Proceedings of the ninth Australian
  Workshop on Combinatorial Algorithms, AWOCA'98 (Perth, 1998)}, pages
  147--158. School of Computing, Curtin University of Technology, Perth,
  Western Australia, 1998.

\bibitem{CIY98awoca}
Maxime Crochemore, Costas~S. Iliopoulos, and Hiafeng Yu.
\newblock Algorithms for computing evolutionary chains in molecular and musical
  sequences.
\newblock In C.~S. Iliopoulos, editor, {\em Proceedings of the ninth Australian
  Workshop on Combinatorial Algorithms AWOCA'98 (Perth, 1998)}, pages 172--184.
  School of Computing, Curtin University of Technology, Perth, Western
  Australia, 1998.

\bibitem{CMR98mfcs}
Maxime Crochemore, Filippo Mignosi, and Antonio Restivo.
\newblock Minimal forbidden words and factor automata.
\newblock In L.~Brim, J.~Gruska, and J.~Zlatu\u{s}ka, editors, {\em
  Mathematical Foundations of Computer Science (Brno, 1998)}, number 1450 in
  LNCS, pages 665--673. Springer-Verlag, 1998.
\newblock Extended abstract of \cite{CMR98ipl}.

\bibitem{CMR98ipl}
Maxime Crochemore, Filippo Mignosi, and Antonio Restivo.
\newblock Automata and forbidden words.
\newblock {\em Information Processing Letters}, 67(3):111--117, 1998.

\bibitem{CH98crca}
Maxime Crochemore and Christophe Hancart.
\newblock Pattern matching in strings.
\newblock In Mikhail~J. Atallah, editor, {\em Algorithms and Theory of
  Computation Handbook}, chapter~11, pages 11.1--11.28. {CRC} Press, 1998.

\bibitem{CL98crcb}
Maxime Crochemore and Thierry Lecroq.
\newblock Text data compression algorithms.
\newblock In Mikhail~J. Atallah, editor, {\em Algorithms and Theory of
  Computation Handbook}, chapter~12, pages 12.1--12.23. {CRC} Press, 1998.

\bibitem{CGHMR98siamjc}
Maxime Crochemore, Leszek G\c{a}sieniec, Ramesh Hariharan, S.~Muthukrishnan,
  and Wojciech Rytter.
\newblock A constant-time optimal parallel algorithm for two-dimensional
  pattern matching.
\newblock {\em {SIAM} Journal of Computing}, 27(3):668--681, 1998.

\bibitem{CV99cc}
Maxime Crochemore and Renaud V\'erin.
\newblock Zones of low entropy in genomic sequences.
\newblock {\em Computers and Chemistry}, 324(23):275--282, 1999.

\bibitem{CMRS99icalp}
Maxime Crochemore, Filippo Mignosi, Antonio Restivo, and Sergio Salemi.
\newblock Text compression using antidictonaries.
\newblock In J.~Wiedermann, P.~van Emde~Boas, and M.~Nielsen, editors, {\em
  International Conference on Automata, Languages an Programming (Prague,
  1999)}, number 1644 in LNCS, pages 261--270. Springer-Verlag, 1999.
\newblock Rapport {I.G.M.} 98-10, Universit\'e de Marne-la-Vall\'ee.

\bibitem{CP99cpm}
Maxime Crochemore and Mike Paterson, editors.
\newblock {\em Combinatorial Pattern Matching (Warwick, 1999)}, number 1645 in
  LNCS. Springer-Verlag, 1999.
\newblock {\small\tt
  http://link.springer.de/link/service/series/0558/tocs/t1645.htm}.

\bibitem{CCIMP99awoca}
Emilios Cambouropoulos, Maxime Crochemore, Costas~S. Iliopoulos, Laurent
  Mouchard, and Yoan~J. Pinzon.
\newblock Algorithms for computing approximate repetitions in musical
  sequences.
\newblock In R.~Raman and J.~Simpson, editors, {\em Proceedings of the tenth
  Australian Workshop on Combinatorial Algorithms, AWOCA'99}, pages 129--144.
  School of Computing, Curtin University of Technology, Perth, Western
  Australia, 1999.

\bibitem{ACR99sofsem}
Cyril Allauzen, Maxime Crochemore, and Mathieu Raffinot.
\newblock Factor oracle: a new structure for pattern matching.
\newblock In Miroslav~Bartosek Jan~Pavelka, Gerard~Tel, editor, {\em SOFSEM'99,
  Theory and Practice of Informatics (Brno, 1999)}, number 1725 in LNCS, pages
  291--306. Springer-Verlag, 1999.
\newblock Proceedings of the 26th Seminar on Current Trends in Theory and
  Practice of Informatics, Milovy, Czech Republic, November 1999.

\bibitem{CT99igm}
Maxime Crochemore and Zden\v{e}k Tron\'{\i}\v{c}ek.
\newblock Directed acyclic subsequence graph for multiple texts.
\newblock Rapport {I.G.M.} 99-13, Universit\'e de Marne-la-Vall\'ee, 1999.

\bibitem{CCGLPR99ipl}
Maxime Crochemore, Artur Czumaj, Leszek G\c{a}sieniec, Thierry Lecroq, Wojciech
  Plandowski, and Wojciech Rytter.
\newblock Fast practical multi-pattern matching.
\newblock {\em Information Processing Letters}, 71(3--4):107--113, 1999.

\bibitem{CGR99tcs}
Maxime Crochemore, Leszek G\c{a}sieniec, and Wojciech Rytter.
\newblock Constant-space string matching in sublinear average time.
\newblock {\em Theoretical Computer Science}, 218(1):197--203, 1999.
\newblock Full version of \cite{CGR97seq}.

\bibitem{HCKRR99cc}
Alain H\'enaut, Maxime Crochemore, Andrzej~K. Konopka, Jean-Loup Risler, and
  Pierre Rouz\'e, editors.
\newblock {\em Informatics and the genome}, volume~23. Pergamon, 1999.
\newblock Special issue of \textit{Computers and Chemistry}.

\bibitem{CIPR00awoca}
Maxime Crochemore, Costas~S. Iliopoulos, Yoan~J. Pinzon, and James Reid.
\newblock A fast and practical bit-vector algorithms for the longest common
  subsequence problem.
\newblock In L.~Brankovic and J.~Ryan, editors, {\em Proceedings of the
  eleventh Australasian Workshop on Combinatorial Algorithms, AWOCA'2000},
  pages 75--86. University of Newcastle, NSW, Australia, 2000.

\bibitem{CIPR00sofsem}
Maxime Crochemore, Costas~S. Iliopoulos, and Yoan~J. Pinzon.
\newblock Fast evolutionary chains.
\newblock In V.~Hlav\'a\v{c}, K.~G. Jeffery, and J.~Wiedermann, editors, {\em
  Sofsem 2000---Theory and Practice of Informatics}, number 1963 in LNCS, pages
  306--317. Springer-Verlag, 2000.

\bibitem{CIKR00cmcc}
Maxime Crochemore, Costas~S. Iliopoulos, Maureen Korda, and James Reid.
\newblock A failure function for multiple two-dimensional pattern matching.
\newblock {\em Combinatorial Mathematics and Combinatorial Computing},
  35:225--238, 2000.
\newblock Full version of \cite{CIKR98awoca}.

\bibitem{CG00jda}
Maxime Crochemore and Leszek G\c{a}sieniec, editors.
\newblock {\em Matching Patterns}. Herm\`es, 2000.
\newblock Special issue of \textit{J. Discrete Algorithms}.

\bibitem{CMRS00ieee}
Maxime Crochemore, Filippo Mignosi, Antonio Restivo, and Sergio Salemi.
\newblock Data compression using antidictonaries.
\newblock {\em Proceedings of the I.E.E.E.}, 88(11):1756--1768, 2000.
\newblock Special issue \textit{Lossless data compression} edited by J. Storer.

\bibitem{CIPR00ismir}
Maxime Crochemore, Costas~S. Iliopoulos, Yoan~J. Pinzon, and Wojciech Rytter.
\newblock Finding motifs with gaps.
\newblock In {\em Proceedings of International Symposium on Music Information
  Retrieval (ISMIR'00)}, pages 306--317, Plymouth, Massachusetts, 2000.

\bibitem{ACR01cpm}
Cyril Allauzen, Maxime Crochemore, and Mathieu Raffinot.
\newblock Efficient experimental string matching by weak factor recognition.
\newblock In A.~Amir and G.M. Landau, editors, {\em CPM'2001, Combinatorial
  Pattern Matching (Jerusalem, 2001)}, number 2089 in LNCS, pages 51--72.
  Springer-Verlag, 2001.

\bibitem{CHL2001vuibert}
Maxime Crochemore, Christophe Hancart, and Thierry Lecroq.
\newblock {\em Algorithmique du texte}.
\newblock Vuibert, 2001.
\newblock 347 pages.

\bibitem{CIPR01ipl}
Maxime Crochemore, Costas~S. Iliopoulos, Yoan~J. Pinzon, and James Reid.
\newblock A fast and practical bit-vector algorithms for the longest common
  subsequence problem.
\newblock {\em Information Processing Letters}, 80(6):279--285, 2001.
\newblock Complete version of \cite{CIPR00awoca}.

\bibitem{CIP01ejc}
Maxime Crochemore, Costas~S. Iliopoulos, and Yoan~J. Pinzon.
\newblock Computing evolutionary chains in musical sequences.
\newblock {\em Electronic Journal of Combi\-na\-torics}, 8(2), 2001.
\newblock \\http://www.combinatorics.org/Vo\-lu\-me\_8/v8i2toc.html.

\bibitem{CILP01psc}
Maxime Crochemore, Costas~S. Iliopoulos, Thierry Lecroq, and Yoan~J. Pinzon.
\newblock Approximate string matching in musical sequences.
\newblock In M.~Bal\'{\i}k and M.~\v{S}im\'anek, editors, {\em PSC'2001, Prague
  Stringoly Club (Prague, 2001)}, pages 26--36. Czech Technical University of
  Prague, 2001.
\newblock DC-2001-06.

\bibitem{CIP01spire}
Maxime Crochemore, Costas~S. Iliopoulos, and Yoan~J. Pinzon.
\newblock Speeding-up {H}irschberg and {H}unt-{S}zymanski {LCS} algorithms.
\newblock In G.~Navarro, editor, {\em SPIRE'2001, 8th International Symposium
  on String Processing and Information Retrieval (Laguna de San Rafael, Chile,
  2001)}, pages 59--67. IEEE Computer Society, 2001.

\bibitem{CLU02soda}
Maxime Crochemore, Gad~M. Landau, and Michal Ziv-Ukelson.
\newblock A sub-quadratic sequence alignment algorithm for unrestricted cost
  matrices.
\newblock In D.~Eppstein, editor, {\em Proceedings of the Thirteen Annual
  ACM-SIAM Symposium on Discrete Algorithms}, pages 679--688. ACM-SIAM, 2002.
\newblock Rapport {I.G.M.} 2001-08.

\bibitem{AC02kluwer}
Alberto Apostolico and Maxime Crochemore.
\newblock String pattern matching for a deluge survival kit.
\newblock In J.~Abello, P.M. Pardalos, and M.G.C. Resende, editors, {\em
  Handbook of Massive Data Sets}, pages 151--194. Kluwer Academic Publishers,
  2002.

\bibitem{RCKPR02cc}
Jean-Loup Risler, Maxime Crochemore, Andrzej~K. Konopka, Bernard Prum, and
  Pierre Rouz\'e, editors.
\newblock {\em Genome and Informatics}, volume 26-5, 2002.
\newblock Special issue of \textit{Computers and Chemistry}.

\bibitem{CIMRTT02njc}
Maxime Crochemore, Costas~S. Iliopoulos, , Christos Makris, Wojciech Rytter,
  Athanasios Tsakalidis, and Kostas Tsichlas.
\newblock Approximate string matching with gaps.
\newblock {\em Nordic Journal of Computing}, 9(1):54--65, 2002.

\bibitem{CILPPR02cpm}
Maxime Crochemore, Costas~S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski,
  and Wojciech Rytter.
\newblock Three heuristics for $delta$-matching: $delta$-bm algorithms.
\newblock In A.~Apostolico and M.~Takeda, editors, {\em Combinatorial Pattern
  Matching, CPM'2002}, number 2373 in LNCS, pages 178--189. Springer-Verlag,
  2002.

\bibitem{CR02jos}
Maxime Crochemore and Wojciech Rytter.
\newblock {\em Jewels of Stringology}.
\newblock World Scientific Publishing, Hong-Kong, 2002.
\newblock 310 pages.

\bibitem{CCIMP02ijcm}
Emilios Cambouropoulos, Maxime Crochemore, Costas~S. Iliopoulos, Laurent
  Mouchard, and Yoan~J. Pinzon.
\newblock Algorithms for computing approximate repetitions in musical
  sequences.
\newblock {\em International Journal of Computer Mathematics},
  79(11):1135--1148, 2002.

\bibitem{CT02spire}
Maxime Crochemore and Zden\v{e}k Tron\'{\i}\v{c}ek.
\newblock On the size of {DASG} for multiple texts.
\newblock In A.~Laender and A.~Oliveira, editors, {\em String Processing and
  Information Retrieval, SPIRE'2002}, number 2476 in LNCS, pages 58--64.
  Springer-Verlag, 2002.

\bibitem{CN02sccc}
Maxime Crochemore and Gonzalo Navarro.
\newblock Improved antidictionary based compression.
\newblock In {\em SCCC'02, Chilean Computer Science Society}, pages 7--13.
  I.E.E.E. CS Press, 2002.

\bibitem{PCGS02igm}
Nadia Pisanti, Maxime Crochemore, Roberto Grossi, and Marie-France Sagot.
\newblock A basis for repeated motifs in pattern discovery and text mining.
\newblock Technical report, Institut Gaspard-Monge, 2002.
\newblock Rapport {I.G.M.} 2002-10.

\bibitem{CIP02cjc}
Maxime Crochemore, Costas~S. Iliopoulos, and Yoan~J. Pinzon.
\newblock Recovering an {LCS} in {O}$(n^2/w)$ time and space.
\newblock {\em Colombian Journal of Computation}, 3(1):41--52, 2002.

\bibitem{CHL02jda}
Maxime Crochemore, Christophe Hancart, and Thierry Lecroq.
\newblock A unifying look at the {A}postolico-{G}iancarlo string-matching
  algorithm.
\newblock {\em Journal of Discrete Algorithms}, 1(1):37--52, 2003.

\bibitem{HC03ciaa}
Jan Holub and Maxime Crochemore.
\newblock On the implementation of compact {DAWG}'s.
\newblock In J.-M. Champarnaud and D.~Maurel, editors, {\em Implementation and
  Application of Automata}, number 2608 in LNCS, pages 289--294.
  Springer-Verlag, 2003.

\bibitem{C2003tcs}
Maxime Crochemore.
\newblock Reducing space for index implementation.
\newblock {\em Theoretical Computer Science}, 292(1):185--197, 2003.

\bibitem{BCC03cpm}
Ricardo Baeza-Yates, Edgar Ch\'avez, and Maxime Crochemore, editors.
\newblock {\em Combinatorial Pattern Matching}, number 2676 in LNCS.
  Springer-Verlag, 2003.

\bibitem{CS03ipl}
Maxime Crochemore and Valery Stefanov.
\newblock Waiting time and complexity for matching patterns with automata.
\newblock {\em Information Processing Letters}, 87(3):119--125, 2003.

\bibitem{ABCLS03cpm}
Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad~M. Landau, and Malka
  Schaps.
\newblock Two-dimensional pattern matching with rotations.
\newblock In R.~Baeza-Yates, E.~Chavez, and M.~Crochemore, editors, {\em
  Combinatorial Pattern Matching}, number 2676 in LNCS, pages 17--31.
  Springer-Verlag, 2003.

\bibitem{CILPPR03fi}
Maxime Crochemore, Costas~S. Iliopoulos, Thierry Lecroq, Yoan~J. Pinzon,
  Wojciech Plandowski, and Wojciech Rytter.
\newblock Occurrence and substring heuristics for $\delta$-matching.
\newblock {\em Fundamenta Informaticae}, 56(1,2):1--21, 2003.

\bibitem{CIP03fi}
Maxime Crochemore, Costas~S. Iliopoulos, and Yoan~J. Pinzon.
\newblock Speeding-up {H}irschberg and {H}unt-{S}zymanski {LCS} algorithms.
\newblock {\em Fundamenta Informaticae}, 56(1,2):89--103, 2003.
\newblock Full version of \cite{CIP01spire}.

\bibitem{BCMRS03fi}
Marie-Pierre B\'eal, Maxime Crochemore, Filippo Mignosi, Antonio Res\-tivo, and
  Marinella Sciortino.
\newblock Forbidden words of regular languages.
\newblock {\em Fundamenta Informaticae}, 56(1,2):121--135, 2003.

\bibitem{PCGS03mfcs}
Nadia Pisanti, Maxime Crochemore, Roberto Grossi, and Marie-France Sagot.
\newblock A basis of tiling motifs for generating repeated patterns and its
  complexity for higher quorum.
\newblock In B.~Rovan and P.~Vojt\'a\v{s}, editors, {\em Mathematical
  Foundations of Computer Science (MFCS)}, number 2747 in LNCS, pages 622--632.
  Springer-Verlag, 2003.
\newblock See TR-03-02, Universit\`a di Pisa.

\bibitem{CLU03siamjc}
Maxime Crochemore, Gad~M. Landau, and Michal Ziv-Ukelson.
\newblock A sub-quadratic sequence alignment algorithm for unrestricted cost
  matrices.
\newblock {\em SIAM Journal of Computing}, 32(6):1654--1673, 2003.
\newblock Full version of \cite{CLU02soda}.

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

\bibitem{CMT03jda}
Maxime Crochemore, Bo\v{r}ivoj Melichar, and Zden\v{e}k Tron\'{\i}\v{c}ek.
\newblock Directed acyclic subsequence graph - overview.
\newblock {\em Journal of Discrete Algorithms}, 1(3-4):255--280, 2003.

\bibitem{ABCL04tcs}
Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad~M. Landau, and Mary Schaps.
\newblock Two-dimensional pattern matching with rotations.
\newblock {\em Theoretical Computer Science}, 314:173--187, 2004.
\newblock Full version of \cite{ABCLS03cpm}.

\bibitem{CIMS04latin}
Maxime Crochemore, Costas~S. Iliopoulos, Manal Mohamed, and Marie-France Sagot.
\newblock Longest repeated motif with a block of don't cares.
\newblock In M.~Farach-Colton, editor, {\em LATIN 2004: Theoretical
  Informatics}, number 2976 in LNCS, pages 271--278. Springer-Verlag, 2004.

\bibitem{CEGM04cpm}
Maxime Crochemore, Chiara Epifanio, Roberto Grossi, and Filippo Mignosi.
\newblock A trie-based approach for compacting automata.
\newblock In S.~C. Sahinalp, S.~Muthukrishnan, and U.~Dogrusoz, editors, {\em
  Combinatorial Pattern Matching}, number 3109 in LNCS, pages 145--158.
  Springer-Verlag, 2004.

\bibitem{CGS04spire}
Maxime Crochemore, Raffaele Giancarlo, and Marie-France Sagot.
\newblock Lon\-gest motifs with a functionally equivalent block.
\newblock In A.~Apostolico and M.~Melucci, editors, {\em Proc. 11th
  International Symposium on String Processing and Information Retrieval
  (SPIRE'2004)}, number 3246 in LNCS, pages 298--309. Springer-Verlag, 2004.

\bibitem{CS04dekker}
Maxime Crochemore and Marie-France Sagot.
\newblock Motifs in sequences: Localization and extraction.
\newblock In A.~K. Konopka and M.~J.~C. Crabbe, editors, {\em Compact Handbook
  of Computational Biology}, pages 47--97. Marcel Dekker, New York, 2004.

\bibitem{CL04crc}
Maxime Crochemore and Thierry Lecroq.
\newblock Pattern matching and text compression algorithms.
\newblock In Allen~B. Tucker, editor, {\em The Computer Science and Engineering
  Handbook}, chapter~13, pages 13--1--13--48. {CRC} Press, 2004.
\newblock Update of \cite{CL97crc}.

\bibitem{CLSU05kcl}
Maxime Crochemore, Gad~M. Landau, Baruch Schieber, and Michal Ziv-Ukelson.
\newblock Re-use dynamic programming for sequence alignment: An algorithmic
  toolkit.
\newblock In C.~Iliopoulos and T.~Lecroq, editors, {\em String Algorithmics},
  pages 19--59. King's College London Publications, 2005.

\bibitem{PCGS05kcl}
Nadia Pisanti, Maxime Crochemore, Roberto Grossi, and Marie-France Sagot.
\newblock A comparative study of bases for motif inference.
\newblock In C.~Iliopoulos and T.~Lecroq, editors, {\em String Algorithmics},
  pages 195--225. King's College London Publications, 2005.

\bibitem{PCGS05tcbb}
Nadia Pisanti, Maxime Crochemore, Roberto Grossi, and Marie-France Sagot.
\newblock Bases of motifs for generating repeated patterns with wild cards.
\newblock {\em IEEE/ACM Transactions on Computational Biology and
  Bioinformatics}, 2(1):40--50, 2005.

\bibitem{CDP05tcs}
Maxime Crochemore, Jacques D\'esarm\'enien, and Dominique Perrin.
\newblock A note on the {B}urrows-{W}heeler transformation.
\newblock {\em Theoretical Computer Science}, 332(1-3):567--572, 2005.

\bibitem{CINPS05jda}
Maxime Crochemore, Costas~S. Iliopoulos, Gonzalo Navarro, Yoan Pinzon, and
  Alejandro Salinger.
\newblock Bit-parallel $(\gamma,\delta)$-matching and suffix automata.
\newblock {\em J. Discrete Algorithms}, 3(2-4):198--214, 2005.

\bibitem{BCF05ieeeit}
Marie-Pierre B\'eal, Maxime Crochemore, and Gabriele Fici.
\newblock Presentations of constrained systems with unconstrained positions.
\newblock {\em IEEE Transactions on Information Theory}, 51(5):1891--1900,
  2005.

\bibitem{C05cup}
Maxime Crochemore.
\newblock Structures for indexes.
\newblock In M.~Lothaire, editor, {\em Applied Combinatorics on Words},
  chapter~2, pages 106--163. Cambridge University Press, 2005.

\bibitem{ACP05cpm}
Alberto Apostolico, Maxime Crochemore, and Kunsoo Park, editors.
\newblock {\em Combinatorial Pattern Matching}, number 3537 in LNCS.
  Springer-Verlag, 2005.

\bibitem{BC05jda}
Ricardo Baeza-Yates and Maxime Crochemore, editors.
\newblock {\em Indexing and Matching Strings}. Elsevier, 2005.
\newblock Special issue of {\em J. Discrete Algorithms}, volume 3(2--4).

\bibitem{CHLV05esa}
Maxime Crochemore, Danny Hermelin, Gad~M. Landau, and St\'ephane Vialette.
\newblock Approximating the 2-interval pattern problem.
\newblock In G.~S. Brodal and S.~Leonardi, editors, {\em ESA 2005: 13th Annual
  European Symposium}, number 3669 in LNCS, pages 426--437. Springer-Verlag,
  2005.

\bibitem{CCIMS05ismir}
Emilios Cambouropoulos, Maxime Crochemore, Costas~S. Iliopoulos, Manal Mohamed,
  and Marie-France Sagot.
\newblock A pattern extraction algorithm for abstract melodic representations
  that allow partial overlapping of intervallic categories.
\newblock In T.~Crawford and M.~Sandler, editors, {\em Proceedings of the 6th
  International Conference on Music Information Retrieval (ISMIR 2005)}, pages
  167--174, 2005.

\bibitem{CL06springer}
Maxime Crochemore and Thierry Lecroq.
\newblock Text searching and indexing.
\newblock In Z.~\'Esik, C.~Mart\'{\i}n-Vide, and V.~Mitrana, editors, {\em
  Recent Advances in Formal Languages and Applications}, chapter~2, pages
  43--80. Springer-Verlag, 2006.

\bibitem{CISH06ciaa}
Maxime Crochemore, Lucian Ilie, and Emine Seid-Hilmi.
\newblock Factor oracles.
\newblock In O.~H. Ibarra and H.-C. Yen, editors, {\em Implementation and
  Application of Automata}, number 4094 in LNCS, pages 78--89. Springer-Verlag,
  2006.

\bibitem{DSC06tal}
Maxime Crochemore, Ga\"el~Harry Diaz, and Sim{\~a}o~Melo de~Souza, editors.
\newblock {\em Fouille de donn\'ees textuelles : complexit\'e, algorithmique et
  passage \`a l'\'echelle}. Lavoisier, Paris, 2006.
\newblock Num\'ero sp\'ecial de \textit{Traitement automatique des langues},
  volume 46(2).

\bibitem{DSC06tal-pref}
Ga\"el~Harry Diaz, Sim{\~a}o~Melo de~Souza, and Maxime Crochemore.
\newblock Passage \`a l'\'echelle : complexit\'e, algorithmique et
  architectures.
\newblock {\em Traitement automatique des langues}, 46(2):7--12, 2006.
\newblock Pr\'eface de \cite{DSC06tal}.

\bibitem{CIMS06tcs}
Maxime Crochemore, Costas~S. Iliopoulos, Manal Mohamed, and Marie-France Sagot.
\newblock Longest repeats with a block of $k$ don't cares.
\newblock {\em Theoretical Computer Science}, 362(1-3):248--254, 2006.

\bibitem{RCIP06awoca}
Maxime Crochemore, Costas~S. Iliopoulos, Kunsoo Park, and Kangho Roh.
\newblock External memory algorithms for string problems.
\newblock In J.~Ryan and Dafik, editors, {\em Proceedings of the Seventeenth
  Australasian Workshop on Combinatorial Algorithms}. University of Ballarat,
  2006.

\bibitem{CHL07cup}
Maxime Crochemore, Christophe Hancart, and Thierry Lecroq.
\newblock {\em Algorithms on Strings}.
\newblock Cambridge University Press, 2007.
\newblock 392 pages.

\bibitem{CISH07ijfcs}
Maxime Crochemore, Lucian Ilie, and Emine Seid-Hilmi.
\newblock The structure of factor oracles.
\newblock {\em International Journal of Foundations of Computer Science},
  18(4):781--797, 2007.

\bibitem{ACIP07lata}
Pavlos Antoniou, Maxime Crochemore, Costas~S. Iliopoulos, and Pierre
  Peterlongo.
\newblock Application of suffix trees for the acquisition of common motifs with
  gaps in a set of strings.
\newblock In R.~Loos, S.~Z. Fazekas, and C.~Mart\'{\i}n-Vide, editors, {\em
  Proceedings of the 1st International Conference on Language and Automata
  Theory and Applications (LATA'07)}, pages 57--66. Universitat Rovira i
  Virgili, 2007.

\bibitem{CCIMS06is}
Emilios Cambouropoulos, Maxime Crochemore, Costas~S. Iliopoulos, Manal Mohamed,
  and Marie-France Sagot.
\newblock All maximal pairs in step-leap representation of melodic sequences.
\newblock {\em Information Sciences}, 177(9):1954--1962, 2007.
\newblock Journal version of \cite{CCIMS05ismir}.

\bibitem{BC07isit}
Marie-Pierre B\'eal and Maxime Crochemore.
\newblock Minimizing local automata.
\newblock In G.~Caire and M.~Fossorier, editors, {\em IEEE International
  Symposium on Information Theory}, pages 1376--1380, 2007.
\newblock IEEE Catalog Number: 07CH37924C.

\bibitem{CEGM07ciaa}
Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, and Filippo Mignosi.
\newblock On the suffix automaton with mismatches.
\newblock In J.~Holub and J.~Zd{\'a}rek, editors, {\em Implementation and
  Application of Automata, 12th International Conference}, number 4783 in LNCS,
  pages 144--156. Springer-Verlag, Berlin, 2007.

\bibitem{CI07mfcs}
Maxime Crochemore and Lucian Ilie.
\newblock Analysis of maximal repetitions in strings.
\newblock In L.~Ku\v{c}era and A.~Ku\v{c}era, editors, {\em Mathematical
  Foundations of Computer Science}, number 4708 in LNCS, pages 465--476.
  Springer-Verlag, Berlin, 2007.

\bibitem{CIR07mfcs}
Maxime Crochemore, Costas~S. Iliopoulos, and Mohammad~Sohel Rahman.
\newblock Finding patterns in given intervals.
\newblock In L.~Ku\v{c}era and A.~Ku\v{c}era, editors, {\em Mathematical
  Foundations of Computer Science}, number 4708 in LNCS, pages 645--656.
  Springer, Berlin, 2007.

\bibitem{CI08stacs}
Maxime Crochemore and Lucian Ilie.
\newblock Understanding maximal repetitions in strings.
\newblock In S.~Albers and P.~Weil, editors, {\em Symposium on Theoretical
  Aspects of Computer Science}, pages 11--16. IBFI Schloss Dagstuhl, 2008.
\newblock Bordeaux, France, 21-23 February 2008.

\bibitem{CIKRW08stacs}
Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica, Mohammad~Sohel Rahman,
  and Tomasz Wale{\'n}.
\newblock Improved algorithms for the range next value problem and
  applications.
\newblock In S.~Albers and P.~Weil, editors, {\em Symposium on Theoretical
  Aspects of Computer Science}, pages 205--216. IBFI Schloss Dagstuhl, 2008.
\newblock Bordeaux, France, 21-23 February 2008.

\bibitem{CI08ipl}
Maxime Crochemore and Lucian Ilie.
\newblock Computing longest previous factors in linear time and applications.
\newblock {\em Information Processing Letters}, 106(2):75--80, 2008.
\newblock DOI: 10.1016/j.ipl.2007.10.006.

\bibitem{RCIP08fi}
Kangho Roh, Maxime Crochemore, Costas~S. Iliopoulos, and Kunsoo Park.
\newblock External memory algorithms for string problems.
\newblock {\em Fundamenta Informaticae}, 84(1):17--32, 2008.

\bibitem{CIS08dcc}
Maxime Crochemore, Lucian Ilie, and William~F. Smyth.
\newblock A simple algorithm for computing the {Lempel-Ziv} factorization.
\newblock In J.~A. Storer and M.~W. Marcellin, editors, {\em 18th Data
  Compression Conference}, pages 482--488. IEEE Computer Society, Los Alamitos,
  CA, 2008.
\newblock Snowbird, UT, USA, 25-27 March 2008.

\bibitem{CI08jcss}
Maxime Crochemore and Lucian Ilie.
\newblock Maximal repetitions in strings.
\newblock {\em Journal of Computer and System Sciences}, 74:796--807, 2008.
\newblock DOI: 10.1016/j.jcss.2007.09.003.

\bibitem{CIT08cpm}
Maxime Crochemore, Lucian Ilie, and Liviu Tinta.
\newblock Towards a solution to the ``runs'' conjecture.
\newblock In P.~Ferragina and G.~M. Landau, editors, {\em Combinatorial Pattern
  Matching}, number 5029 in LNCS, pages 290--302. Springer, Heidelberg, 2008.
\newblock Pisa, Italy, June 18-20, 2008.

\bibitem{CHLV08tcs}
Maxime Crochemore, Danny Hermelin, Gad~M. Landau, Dror Rawitz, and St\'ephane
  Vialette.
\newblock Approximating the 2-interval pattern problem.
\newblock {\em Theoretical Computer Science}, 395(2-3):283--297, 2008.

\bibitem{CC08mcs}
Joseph Wun-Tat Chan and Maxime Crochemore, editors.
\newblock {\em Combinatorial Algorithms}. Birkh{\"a}user Basel, Switzerland,
  2008.
\newblock Special issue of \textit{Mathematics in Computer Science}, Volume
  1(4):541--736.

\bibitem{CR08springersar}
Maxime Crochemore and Wojciech Rytter.
\newblock Squares and repetitions.
\newblock In Ming-Yang Kao, editor, {\em Encyclopedia of {A}lgorithms}, pages
  874--877. Springer, Heidelberg, 2008.

\bibitem{CL08springeresm}
Maxime Crochemore and Thierry Lecroq.
\newblock Sequential exact string matching.
\newblock In Ming-Yang Kao, editor, {\em Encyclopedia of {A}lgorithms}, pages
  824--826. Springer, Heidelberg, 2008.

\bibitem{CL08springermsm}
Maxime Crochemore and Thierry Lecroq.
\newblock Sequential multiple string matching.
\newblock In Ming-Yang Kao, editor, {\em Encyclopedia of {A}lgorithms}, pages
  826--829. Springer, Heidelberg, 2008.

\bibitem{CGMP08ictcs}
Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, and Mauriana Pesaresi.
\newblock On the longest common factor problem.
\newblock In G.~Ausiello, J.~Karhum{\"a}ki, G.~Mauri, and C.-H.~Luke Ong,
  editors, {\em 5th IFIP International Conference on Theoretical Computer
  Science}, volume 273 of {\em IFIP}, pages 143--155. Springer, Heidelberg,
  2008.
\newblock Milano, Italy, 7-10 September 2008.

\bibitem{BC08fsmnlp-min}
Marie-Pierre B{\'e}al and Maxime Crochemore.
\newblock Minimizing incomplete automata.
\newblock In J.~Pikorski, B.~Watson, and A.~Yli-Jyr{\"a}, editors, {\em
  Finite-State Methods and Natural Language Processing}, pages 9--16. Joint
  Research Centre, European Commission, 2008.
\newblock Ispra, Italy, 11-12 September 2008.

\bibitem{CFIJ08dlt}
Maxime Crochemore, Szil\'{a}rd~Zsolt Fazekas, Costas~S. Iliopoulos, and Inuka
  Jayasekera.
\newblock Bounds on powers in strings.
\newblock In M.~Ito and M.~Toyama, editors, {\em Developments in Language
  Theory}, number 5257 in LNCS, pages 206--215. Springer, Heidelberg, 2008.
\newblock Kyoto, Japan, 16-19 September 2008.

\bibitem{CP08bcs}
Maxime Crochemore and Ely Porat.
\newblock Computing a longest increasing subsequence of length $k$ in time
  {$O(n\log\log k)$}.
\newblock In E.~Gelenbe, S.~Abramsky, and V.~Sassone, editors, {\em Visions of
  computer science}, pages 69--74. The British Computer Society, Swindon, UK,
  2008.
\newblock Imperial College London, 22-24 September 2008.

\bibitem{CIR08ipl}
Maxime Crochemore, Costas~S. Iliopoulos, and Mohammad~Sohel Rahman.
\newblock Optimal prefix and suffix queries on texts.
\newblock {\em Information Processing Letters}, 108(5):320--325, 2008.
\newblock Presented at the International conference on Analysis of Algorithms
  (AofA), 2007.

\bibitem{ACIJL08psc}
Pavlos Antoniou, Maxime Crochemore, Costas~S. Iliopoulos, Inuka
  {Jaya\-se\-kera}, and Gad~M. Landau.
\newblock Conservative string covering of indeterminate strings.
\newblock In Jan Holub and Jan {\v{Z}}{\v{d}}{\'{a}}rek, editors, {\em
  Proceedings of the Prague Stringology Conference 2008}, pages 108--115, Czech
  Technical University in Prague, Czech Republic, 2008.

\bibitem{CL08aasm}
Maxime Crochemore and Thierry Lecroq.
\newblock Alignments and approximate string matching.
\newblock In G.~Bel-Enguix, M.~D. Jim{\'e}nez-L{\'o}pez, and
  C.~Mart{\'{\i}}n-Vide, editors, {\em New Developments in Formal Languages and
  Applications}, chapter~3, pages 59--94. Springer, Berlin/Heidelberg, 2008.

\bibitem{CrL2008d}
M.~Crochemore and T.~Lecroq.
\newblock Efficient implementation of {Boyer-Moore} string-matching algorithm.
\newblock http://www-igm.univ-mlv.fr/$\sim$lecroq/articles/cl2008.pdf, 2008.
\newblock Manuscript.

\bibitem{CCR09-pref}
Julien Cl{\'e}ment, Maxime Crochemore, and Giuseppina Rindone.
\newblock Reverse engineering prefix tables.
\newblock In S.~Albers and J.-Y. Marion, editors, {\em 26th International
  Symposium on Theoretical Aspects of Computer Science (STACS 2009)}, pages
  289--300, Dagstuhl, Germany, 2009. Schloss Dagstuhl - Leibniz-Zentrum fuer
  Informatik, Germany.
\newblock http://drops.dagstuhl.de/opus/volltexte/2009/1825.

\bibitem{CEGM09tcs}
Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, and Filippo Mignosi.
\newblock From {N}erode's congruence to suffix automata with mismatches.
\newblock {\em Theoretical Computer Science}, 410(37):3471--3480, 2009.
\newblock DOI: 10.1016/j.tcs.2009.03.011.

\bibitem{CIIKRW09iwoca}
Maxime Crochemore, Lucian Ilie, Costas~S. Iliopoulos, Marcin Kubica, Wojciech
  Rytter, and Tomasz Wale{\'n}.
\newblock {LPF} computation revisited.
\newblock In J.~Fiala, J.~Kratochv\'{\i}l, and M.~Miller, editors, {\em IWOCA
  2009}, number 5874 in LNCS, pages 158--169. Springer, Heidelberg, 2009.

\bibitem{IGMA_BliCroHam09}
Guillaume Blin, Maxime Crochemore, Sylvie Hamel, and St\'ephane Vialette.
\newblock {Finding the median of three permutations under the Kendall-tau
  distance}.
\newblock Extended Abstract in the {\em 7th annual international conference on
  Permutation Patterns}, University of Firenze, Italy, jul 2009.

\bibitem{CG09psc}
Maxime Crochemore and Laura Giambruno.
\newblock On-line construction of a small automaton for a finite set of words.
\newblock In J.~Holub and J.~{\v{Z}}{\v{d}}{\'{a}}rek, editors, {\em
  Proceedings of the Prague Stringology Conference 2009}, pages 15--28, Czech
  Technical University in Prague, Czech Republic, 2009.

\bibitem{CC09csit}
Supaporn Chairungsee and Maxime Crochemore.
\newblock Efficient computing of longest previous reverse factors.
\newblock In Y.~Shoukourian, editor, {\em Seventh International Conference on
  Computer Science and Information Technologies (CSIT 2009)}, pages 27--30. The
  National Academy of Sciences of Armenia Publishers, Yerevan, Armenia, 2009.

\bibitem{CIR09tcs}
Maxime Crochemore, Lucian Ilie, and Wojciech Rytter.
\newblock Repetitions in strings: algorithms and combinatorics.
\newblock {\em Theoretical Computer Science}, 410(50):5227--5235, 2009.

\bibitem{CL09encdb-st}
Maxime Crochemore and Thierry Lecroq.
\newblock Suffix tree.
\newblock In Ling Liu and M.~Tamer {\"O}zsu, editors, {\em Encyclopedia of
  Database Systems}, pages 2876--2880. Springer US, 2009.

\bibitem{CL09encdb-tries}
Maxime Crochemore and Thierry Lecroq.
\newblock Trie.
\newblock In Ling Liu and M.~Tamer {\"O}zsu, editors, {\em Encyclopedia of
  Database Systems}, pages 3179--3182. Springer US, 2009.

\bibitem{CH10crc}
Maxime Crochemore and Christophe Hancart.
\newblock Pattern matching in strings.
\newblock In M.~J. Atallah and M.~Blanton, editors, {\em Algorithms and Theory
  of Computation Handbook}, chapter~13. {CRC} Press, 2010.

\bibitem{CL10crc}
Maxime Crochemore and Thierry Lecroq.
\newblock Text data compression algorithms.
\newblock In M.~J. Atallah and M.~Blanton, editors, {\em Algorithms and Theory
  of Computation Handbook}, chapter~14. {CRC} Press, 2010.

\bibitem{CIKRW10sofsem}
Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica, Wojciech Rytter, and
  Tomasz Wale{\'n}.
\newblock Efficient algorithms for two extensions of the {LPF} table: the power
  of {S}uffix {A}rrays.
\newblock In J.~van Leeuwen, A.~Muscholl, D.~Peleg, J.~Pokorn{\'y}, and
  B.~Rumpe, editors, {\em 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}, number 5901 in LNCS, pages 296--307,
  Berlin, 2010. Springer.

\bibitem{CIP10esko}
Maxime Crochemore, Costas~S. Iliopoulos, and Solon~P. Pissis.
\newblock A parallel algorithm for fixed-length approximate string-matching
  with {\it k}-mismatches.
\newblock In Tapio Elomaa, Heikki Mannila, and Pekka Orponen, editors, {\em
  Algorithms and Applications}, number 6060 in LNCS, pages 92--101. Springer,
  2010.

\bibitem{CIKRRW10-cubic-lata}
Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica, Jakub Radoszewski,
  Wojciech Rytter, and Tomasz Wale\'n.
\newblock On the maximal number of cubic runs in a string.
\newblock In A.-H. Dediu, H.~Fernau, and C.~Martin-Vide, editors, {\em LATA
  2010}, number 6031 in LNCS, pages 227--238. Springer, Heidelberg, 2010.
\newblock See \texttt{http://arxiv.org/abs/0907.2157}.

\bibitem{CIPT10-cover-cpm}
Maxime Crochemore, Costas~S. Iliopoulos, Solon~P. Pissis, and German Tischler.
\newblock Cover array string reconstruction.
\newblock In A.~Amir and L.~Parida, editors, {\em Combinatorial Pattern
  Matching}, number 6129 in LNCS, pages 251--259. Springer, Heidelberg, 2010.

\bibitem{CCIKRRW10-scs-cpm}
Maxime Crochemore, Marek Cygan, Costas~S. Iliopoulos, Marcin Kubica, Jakub
  Radoszewski, Wojciech Rytter, and Tomasz Wale{\'n}.
\newblock Algorithms for three versions of the shortest common superstring
  problem.
\newblock In A.~Amir and L.~Parida, editors, {\em Combinatorial Pattern
  Matching}, number 6129 in LNCS, pages 299--309. Springer, Heidelberg, 2010.

\bibitem{CIKRW10fi}
Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica, Mohammad~Sohel Rahman,
  and Tomasz Wale{\'n}.
\newblock Finding patterns in given intervals.
\newblock {\em Fundamenta Informaticae}, 101(3):173--186, 2010.
\newblock Extended version of \cite{CIR07mfcs}.

\bibitem{CP10ic}
Maxime Crochemore and Ely Porat.
\newblock Fast computation of a longest increasing subsequence and application.
\newblock {\em Information and Computation}, 208(9):1054--1059, 2010.

\bibitem{CG10reactive-psc}
Maxime Crochemore and Dov~M. Gabbay.
\newblock Reactive links to save automata states.
\newblock In J.~Holub and J.~Zd{'}\'arek, editors, {\em Prague Stringology
  Conference}, pages 1--8. Czech Technical University in Prague, 2010.
\newblock ISBN 978-80-01-04597-8.

\bibitem{CIKRRW10powers-psc}
Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica, Jakub Radoszewski,
  Wojciech Rytter, and Tomasz Wale{\'n}.
\newblock New simple efficient algorithms computing powers and runs in strings.
\newblock In J.~Holub and J.~Zd{'}\'arek, editors, {\em Prague Stringology
  Conference}, pages 138--149. Czech Technical University in Prague, 2010.
\newblock ISBN 978-80-01-04597-8.

\bibitem{BC1012sq-psc}
Golnaz Badkobeh and Maxime Crochemore.
\newblock Bounded number of squares in infinite repetition-constrained binary
  words.
\newblock In J.~Holub and J.~Zd{'}\'arek, editors, {\em Prague Stringology
  Conference}, pages 161--166. Czech Technical University in Prague, 2010.
\newblock ISBN 978-80-01-04597-8.

\bibitem{CFIJ10ijfcs}
Maxime Crochemore, Szil\'{a}rd~Zsolt Fazekas, Costas~S. Iliopoulos, and Inuka
  Jayasekera.
\newblock Number of occurrences of powers in strings.
\newblock {\em International Journal of Foundations of Computer Science},
  21(4):535--547, 2010.

\bibitem{CIKRRW10powers-spire}
Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica, Jakub Radoszewski,
  Wojciech Rytter, and Tomasz Wale{\'n}.
\newblock Extracting powers and periods in a string from its runs structure.
\newblock In E.~Ch{\'a}vez and S.~Lonardi, editors, {\em String Processing and
  Information Retrieval - SPIRE 2010}, number 6393 in LNCS, pages 258--269.
  Springer, 2010.

\bibitem{CT10spire}
Maxime Crochemore and German Tischler.
\newblock The gapped suffix arrays: a new index structure for fast approximate
  matching.
\newblock In Edgar Ch{\'a}vez and Stefano Lonardi, editors, {\em String
  Processing and Information Retrieval - SPIRE 2010}, number 6393 in LNCS,
  pages 359--364. Springer, 2010.

\bibitem{BCHV10pp}
Guillaume Blin, Maxime Crochemore, Sylvie Hamel, and St{\'e}phane Vialette.
\newblock Medians of an odd number of permutations.
\newblock {\em Pure Mathematics and Applications}, 21(2):161--175, 2010.

\bibitem{BCV11}
Guillaume Blin, Maxime Crochemore, and St{\'e}phane Vialette.
\newblock Algorithmic aspect of arc-annotated sequences.
\newblock In M.~Elloumi and A.~Y. Zomaya, editors, {\em Algorithmic in
  Computational Molecular Biology: Techniques, Approaches and Applications},
  chapter~6, pages 113--128. Wiley, 2011.

\bibitem{CT11lpnf-ipl}
Maxime Crochemore and German Tischler.
\newblock Computing longest previous non-overlapping factors.
\newblock {\em Information Processing Letters}, 111(6):291--295, 2011.

\bibitem{CG11ic}
Maxime Crochemore and Dov~M. Gabbay.
\newblock Reactive automata.
\newblock {\em Information and Computation}, 209(4):692--704, 2011.

\bibitem{CIT11tcs}
Maxime Crochemore, Lucian Ilie, and Liviu Tinta.
\newblock The ``runs'' conjecture.
\newblock {\em Theoretical Computer Science}, 412(27):2931--2941, 2011.

\bibitem{CKMN11}
Maxime Crochemore, Lila Kari, Mehryar Mohri, and Dirk Nowotka.
\newblock Combinatorial and algorithmic aspects of sequence processing
  (dagstuhl seminar 11081).
\newblock {\em Dagstuhl Reports}, 1(2):47--66, 2011.

\bibitem{BCC11-redund-dlt}
Golnaz Badkobeh, Supaporn Chairungsee, and Maxime Crochemore.
\newblock Hunting redundancies in strings.
\newblock In G.~Mauri and A.~Leporati, editors, {\em 15th Conference on
  Developments in Language Theory}, number 6795 in LNCS, pages 1--14. Springer,
  2011.

\bibitem{BC11-FRt3-words}
Golnaz Badkobeh and Maxime Crochemore.
\newblock Finite-repetition threshold for infinite ternary words.
\newblock In P.~Ambro\v{z}, \v{S}. Holub, and Z.~Mas{\'a}kov{\'a}, editors,
  {\em Proceedings 8th International Conference Words 2011}, volume~63 of {\em
  Electronic Proceedings in Theoretical Computer Science}, pages 37--43,
  Prague, CZ, 2011. Czech Technical University.

\bibitem{CCGIP11-cocoon}
Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas~S. Iliopoulos, and
  Solon~P. Pissis.
\newblock On the right-seed array of a string.
\newblock In B.~Fu and D.-Z. Du, editors, {\em 17th Annual International
  Computing and Combinatorics Conference (COCOON)}, number 6842 in LNCS, pages
  492--502. Springer, 2011.

\bibitem{BCMS11ieee}
Marie-Pierre B{\'e}al, Maxime Crochemore, Bruce~E. Moision, and Paul~H. Siegel.
\newblock Periodic finite-type shift spaces.
\newblock {\em IEEE Transactions on Information Theory}, 57(6):3677--3691,
  2011.

\bibitem{CCIKPRRCW11-seeds-cpm}
Michalis Christou, Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica,
  Solon~P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, and
  Tomasz Wale\'n.
\newblock Efficient seeds computation revisited.
\newblock In R.~Giancarlo and G.~Manzini, editors, {\em Combinatorial Pattern
  Matching}, number 6661 in LNCS, pages 350--363, Berlin, 2011. Springer.

\bibitem{CC11ciaa}
Supaporn Chairungsee and Maxime Crochemore.
\newblock Building phylogeny with minimal absent words.
\newblock In B.~Bouchou-Markhoff, J.-M. Champarnaud, and D.~Maurel, editors,
  {\em Conference on Implementation and Application of Automata (CIAA)}, number
  6807 in LNCS, pages 100--109. Springer, 2011.

\bibitem{CCFIJP11-spire}
Michalis Christou, Maxime Crochemore, Tom{\'a}s Flouri, Costas~S. Iliopoulos,
  Jan Janousek, Bo\v{r}ivoj Melichar, and Solon Pissis.
\newblock Computing all subtree repeats in ordered ranked trees.
\newblock In R.~Grossi, F.~Sebastiani, and F.~Silvestri, editors, {\em String
  Processing and Information Retrieval, 18th International Symposium, SPIRE
  2011, Pisa, Italy, October 17-21, 2011. Proceedings}, volume 7024 of {\em
  LNCS}, pages 338--343. Springer, 2011.

\bibitem{ACIKSTY12-acm-surveys}
Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Evguenia Kopylova, William~F.
  Smyth, German Tischler, and Munina Yusufu.
\newblock A comparison of index-based {L}empel-{Z}iv {LZ77} factorization
  algorithms.
\newblock {\em ACM Comput. Surv.}, 45(1), 2012.
\newblock Article 5.

\bibitem{CGL12auto-ijfcs}
Maxime Crochemore, Laura Giambruno, and Alessio Langiu.
\newblock On-line construction of a small automaton for a finite set of words.
\newblock {\em Int. J. Found. Comput. Sci.}, 23(2):281--301, 2012.
\newblock Journal version of \cite{CG09psc}.

\bibitem{CCI12-ijfcs}
Michalis Christou, Maxime Crochemore, and Costas~S. Iliopoulos.
\newblock Identifying all abelian periods of a string in quadratic time and
  relevant problems.
\newblock {\em Int. J. Found. Comput. Sci.}, 23(6):1371--1384, 2012.
\newblock See \texttt{http://arxiv.org/abs/1207.1307}.

\bibitem{CCFIJMP12-ipl}
Michalis Christou, Maxime Crochemore, Tom{\'a}s Flouri, Costas~S. Iliopoulos,
  Jan Janousek, Bo\v{r}ivoj Melichar, and Solon Pissis.
\newblock Computing all subtree repeats in ordered trees.
\newblock {\em Information Processing Letters}, 112(24):958--962, 2012.
\newblock Presented at SPIRE 2011 \cite{CCFIJP11-spire}.

\bibitem{BC1012sq-rairo}
Golnaz Badkobeh and Maxime Crochemore.
\newblock Fewest repetitions in infinite binary words.
\newblock {\em RAIRO - Theoretical Informatics and Applications}, 46(1):17--31,
  2012.
\newblock See \texttt{http://arxiv.org/abs/1207.5723},
  texttt{http://dx.doi.org/10.1051/ita/2011109}.

\bibitem{CIKRRW12cubic-jcss}
Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica, Jakub Radoszewski,
  Wojciech Rytter, and Tomasz Wale{\'n}.
\newblock The maximal number of cubic runs in a word.
\newblock {\em Journal Computer System Science}, 78(6):1828--1836, 2012.
\newblock Presented at LATA 2010 \cite{CIKRRW10-cubic-lata}.

\bibitem{CIKRW12-jda}
Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica, Wojciech Rytter, and
  Tomasz Wale{\'n}.
\newblock Efficient algorithms for three variants of the {LPF} table.
\newblock {\em J. Discrete Algorithms}, 11:51--61, 2012.

\bibitem{CKRRW12sumexp-jda}
Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, and
  Tomasz Wale{\'n}.
\newblock On the maximal sum of exponents of runs in a string.
\newblock {\em J. Discrete Algorithms}, 14:29--36, 2012.

\bibitem{CGLMR12parsing-jda}
Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, and
  Antonio Restivo.
\newblock Dictionary-symbolwise flexible parsing.
\newblock {\em Journal of Discrete Algorithms}, 14:74--90, 2012.
\newblock Special issue co-edited by C.S. Iliopoulos and W.F. Smyth.

\bibitem{CCGIP12}
Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas~S. Iliopoulos, and
  Solon~P. Pissis.
\newblock On left and right seeds of a string.
\newblock {\em J. Discrete Algorithms}, 17:31--44, 2012.

\bibitem{CIKRTW12tcs}
Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica, Mohammad~Sohel Rahman,
  German Tischler, and Tomasz Wale{\'n}.
\newblock Improved algorithms for the range next value problem and
  applications.
\newblock {\em Theoretical Computer Science}, 434:23--34, 2012.
\newblock Journal version of \cite{CIKRW08stacs}.

\bibitem{CC12-tcs}
Supaporn Chairungsee and Maxime Crochemore.
\newblock Using minimal absent words to build phylogeny.
\newblock {\em Theoretical Computer Science}, 450(1):109--116, 2012.
\newblock Journal version of \cite{CC11ciaa}.

\bibitem{CIKKRRTW12-cpm}
Maxime Crochemore, Costas~S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub
  Radoszewski, Wojciech Rytter, Wojciech Tyczynski, and Tomasz Wale{\'n}.
\newblock The maximum number of squares in a tree.
\newblock In Juha K{\"a}rkk{\"a}inen and Jens Stoye, editors, {\em
  Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki,
  Finland, July 3-5, 2012. Proceedings}, volume 7354 of {\em LNCS}, pages
  27--40. Springer, 2012.

\bibitem{AlatabbiCIO12}
Ali Alatabbi, Maxime Crochemore, Costas~S. Iliopoulos, and Tewogboye~A.
  Okanlawon.
\newblock Overlapping repetitions in weighted sequence.
\newblock In Vidyasagar Potdar and Debajyoti Mukhopadhyay, editors, {\em CUBE
  International IT Conference {\&} Exhibition, CUBE '12, Pune, India -
  September 03 - 06, 2012}, pages 435--440. ACM, 2012.

\bibitem{AlatabbiCDM12}
Ali Alatabbi, Maxime Crochemore, Jacqueline~W. Daykin, and Laurent Mouchard.
\newblock {L}yndon fountains and the {B}urrows-{W}heeler transform.
\newblock In Vidyasagar Potdar and Debajyoti Mukhopadhyay, editors, {\em CUBE
  International IT Conference {\&} Exhibition, CUBE '12, Pune, India -
  September 03 - 06, 2012}, pages 441--446. ACM, 2012.

\bibitem{BCT12spire}
Golnaz Badkobeh, Maxime Crochemore, and Chalita Toopsuwan.
\newblock Computing the maximal-exponent repeats of an overlap-free string in
  linear time.
\newblock In L.~Calder�on-Benavides, C.~Gonz�lez-Caro, E.~Ch�vez, and
  N.~Ziviani, editors, {\em Symposium on String Processing and Information
  Retrieval}, number 7608 in LNCS, pages 61--72. Springer, 2012.
\newblock Best paper award.

\bibitem{CKRTTW12-bob}
Maxime Crochemore, Tomasz Kociumaka, Wojciech Rytter, Chalita Toopsuwan,
  Wojciech Tyczy\'nski, and Tomasz Wale\'n.
\newblock {\em Algorithmics of repetitions, local periods and critical
  factorisation revisited}, pages 53--60.
\newblock {J. Holub and B. W. Watson and Jan Zdarek} eds., Czech Technical
  University, Prague, 2012.

\bibitem{CIKKPRRTW13-ipl}
Maxime Crochemore, Costas~S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub
  Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, and Tomasz
  Wale\'n.
\newblock A note on efficient computation of all abelian periods in a string.
\newblock {\em Inf. Process. Lett.}, 113(3):74--77, 2013.

\bibitem{CCIKPRRSW13-seed-tcs}
Michalis Christou, Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica,
  Solon~P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, and
  Tomasz Wale\'n.
\newblock Efficient seed computation revisited.
\newblock {\em Theor. Comput. Sci.}, 483:171--181, 2013.

\bibitem{CIIKRW13-ejc}
Maxime Crochemore, Lucian Ilie, Costas~S. Iliopoulos, Marcin Kubica, Wojciech
  Rytter, and Tomasz Wale{\'n}.
\newblock Computing the longest previous factor.
\newblock {\em European Journal of Combinatorics}, 34(1):15--26, 2013.
\newblock Guest editors: J. Kratochv\'{\i}l, M. Miller. Presented at IWOCA 2009
  \cite{CIIKRW09iwoca}.

\bibitem{ACFGM13cpm}
Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, and
  S.~Muthukrishnan.
\newblock Forty years of text indexing.
\newblock In J.~Fischer and P.~Sanders, editors, {\em Combinatorial Pattern
  Matching}, number 7922 in LNCS, pages 1--10. Springer, 2013.

\bibitem{ACL13cpm}
Mika Amit, Maxime Crochemore, and Gad~M. Landau.
\newblock Locating all maximal approximate runs in a string.
\newblock In J.~Fischer and P.~Sanders, editors, {\em Combinatorial Pattern
  Matching}, number 7922 in LNCS, pages 13--27. Springer, 2013.

\bibitem{CGKL13cpm}
Maxime Crochemore, Roberto Grossi, Juha K\"arkk\"ainen, and Gad~M. Landau.
\newblock A constant-space comparison-based algorithm for computing the
  {B}urrows-{W}heeler transform.
\newblock In J.~Fischer and P.~Sanders, editors, {\em Combinatorial Pattern
  Matching}, number 7922 in LNCS, pages 74--82. Springer, 2013.

\bibitem{CCCI13-ajc}
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, and Costas~S.
  Iliopoulos.
\newblock Overlapping factors in words.
\newblock {\em Australasian Journal of Combinatorics}, 57:49--64, 2013.

\bibitem{CIKKLPRRW13-spire}
Maxime Crochemore, Costas~S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica,
  Alessio Langiu, Solon Pissis, Jakub Radoszewski, Wojciech Rytter, and Tomasz
  Wale\'n.
\newblock Order-preserving incomplete suffix trees and order-preserving
  indexes.
\newblock In O.~Kurland, M.~Lewenstein, and E.~Porat, editors, {\em String
  Processing and Information Retrieval (SPIRE)}, number 8214 in LNCS, pages
  84--95. Springer, 2013.

\bibitem{CD13-jda}
Maxime Crochemore and Jacqueline~W. Daykin, editors.
\newblock {\em StringMasters 2011}. Elsevier, 2013.
\newblock Special issue of \textit{J. Discrete Algorithms} 20:1-2, 2013.

\bibitem{NPCHIMP13-iwoca}
Joong~Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas~S. Iliopoulos,
  Laurent Mouchard, and Kunsoo Park.
\newblock Suffix tree of an alignment: An efficient index for similar data.
\newblock In T.~Lecroq and L.~Mouchard, editors, {\em IWOCA}, number 8288 in
  LNCS, pages 337--348. Springer, 2013.

\bibitem{CLM13-dcc}
Maxime Crochemore, Alessio Langiu, and Filippo Mignosi.
\newblock The rightmost equal-cost position problem.
\newblock In J.~A. Storer and M.~W. Marcellin, editors, {\em 2013 Data
  Compression Conference}, pages 421--430, Los Alamitos, CA, 2013. IEEE
  Computer Society.
\newblock Snowbird, UT, USA, 20-22 March 2013.

\bibitem{CLMM13-wiley}
Maxime Crochemore, Alessio Langiu, Filippo Mignosi, and Mario Mirisola.
\newblock Longest common substrings, related problems and applications.
\newblock In M.~Elloumi and A.~Y. Zomaya, editors, {\em Biologicla Knowledge,
  Discovery Handbook}, chapter~1, pages 3--27. John Wiley \& Sons Inc, 2013.

\bibitem{CLR14index-rsoc}
Maxime Crochemore, Alessio Langiu, and M.~Sohel Rahman.
\newblock Indexing a sequence for mapping reads with a single mismatch.
\newblock {\em Philosophical Transactions of the Royal Society A},
  372(2016):1--18, 2014.
\newblock Article ID 20130167.

\bibitem{crochemore_et_al:DR:2014:4552}
Maxime Crochemore, James~D. Currie, Gregory Kucherov, and Dirk Nowotka.
\newblock {Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111)}.
\newblock {\em Dagstuhl Reports}, 4(3):28--46, 2014.
\newblock Keywords: combinatorics on words, string algorithms, automata.

\bibitem{CM14spire}
Edleno~Silva de~Moura and Maxime Crochemore, editors.
\newblock {\em String Processing and Information Retrieval - 21st International
  Symposium, {SPIRE} 2014, Ouro Preto, Brazil, October 20-22, 2014.
  Proceedings}, volume 8799 of {\em Lecture Notes in Computer Science}.
  Springer, 2014.

\bibitem{CIKRRW14isaac}
Maxime Crochemore, Costas~S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski,
  Wojciech Rytter, and Tomasz Walen.
\newblock Covering problems for partial words and for indeterminate strings.
\newblock In Hee{-}Kap Ahn and Chan{-}Su Shin, editors, {\em Algorithms and
  Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea,
  December 15-17, 2014, Proceedings}, volume 8889 of {\em Lecture Notes in
  Computer Science}, pages 220--232. Springer, 2014.

\bibitem{BadkobehCT14}
Golnaz Badkobeh, Maxime Crochemore, and Chalita Toopsuwan.
\newblock Maximal anti-exponent of gapped palindromes.
\newblock In {\em Fourth International Conference on Digital Information and
  Communication Technology and its Applications - DICTAP 2014, Bangkok,
  Thailand, May 6-8, 2014}, pages 205--210. IEEE, 2014.

\bibitem{CLM14gadi-tcs}
Maxime Crochemore, Alessio Langiu, and Filippo Mignosi.
\newblock Note on the greedy parsing optimality for dictionary-based text
  compression.
\newblock {\em Theoretical Computer Science}, 525:55--59, 2014.
\newblock See \texttt{http://arxiv.org/abs/1211.5350}.

\bibitem{CCCI14gadi-tcs}
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, and Costas
  Iliopoulos.
\newblock On the average number of regularities in a word.
\newblock {\em Theoretical Computer Science}, 525:3--9, 2014.

\bibitem{CIKRRW14powers-tcs}
Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica, Jakub Radoszewski,
  Wojciech Rytter, and Tomasz Wale{\'n}.
\newblock Extracting powers and periods in a word from its runs structure.
\newblock {\em Theoretical Computer Science}, 521:29--41, 2014.
\newblock Journal version of \cite{CIKRRW10powers-spire}.

\bibitem{CDL14-jda}
Maxime Crochemore, Jacqueline~W. Daykin, and Zsuzsanna Lipt{\'{a}}k, editors.
\newblock {\em String{M}asters 2012 \& 2013 Special Issue --- {V}olume 1}.
  Elsevier, 2014.
\newblock Special issue of \textit{J. Discrete Algorithms} 28, 2014.

\bibitem{BCR14frt-rairo}
Golnaz Badkobeh, Maxime Crochemore, and Micha{\"{e}}l Rao.
\newblock Finite repetition threshold for large alphabets.
\newblock {\em {RAIRO} - Theor. Inf. and Applic.}, 48(4):419--430, 2014.

\bibitem{CCCI14-dam}
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, and Costas
  Iliopoulos.
\newblock Abelian borders in binary words.
\newblock {\em Discrete Applied Mathematics}, 171:141--146, 2014.

\bibitem{CIKRRSW14-dam}
Maxime Crochemore, Costas~S. Iliopoulos, Marcin Kubica, Jakub Radoszewski,
  Wojciech Rytter, Krzysztof Stencel, and Tomasz Walen.
\newblock New simple efficient algorithms computing powers and runs in strings.
\newblock {\em Discrete Applied Mathematics}, 163:258--267, 2014.

\bibitem{CrochemoreL14}
Maxime Crochemore and Thierry Lecroq.
\newblock Pattern matching and text compression algorithms.
\newblock In Teofilo~F. Gonzalez, Jorge Diaz{-}Herrera, and Allen Tucker,
  editors, {\em Computing Handbook, Third Edition: Computer Science and
  Software Engineering}, pages 15: 1--57. {CRC} Press, 2014.

\bibitem{CIKKLRRSW15-jda}
Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio
  Langiu, Jakub Radoszewski, Wojciech Rytter, B.~Szreder, and Tomasz Walen.
\newblock A note on the longest common compatible prefix problem for partial
  words.
\newblock {\em Journal of Discrete Algorithms}, 34:49--53, 2015.
\newblock http://dx.doi.org/10.1016/j.jda.2015.05.003.

\bibitem{CrochemoreGKL15}
Maxime Crochemore, Roberto Grossi, Juha K{\"{a}}rkk{\"{a}}inen, and Gad~M.
  Landau.
\newblock Computing the {B}urrows-{W}heeler transform in place and in small
  space.
\newblock {\em J. Discrete Algorithms}, 32:44--52, 2015.

\bibitem{CDL15-jda}
Maxime Crochemore, Jacqueline~W. Daykin, and Zsuzsanna Lipt{\'{a}}k, editors.
\newblock {\em String{M}asters 2012 \& 2013 Special Issue --- {V}olume 2}.
  Elsevier, 2015.
\newblock Special issue of \textit{J. Discrete Algorithms} 32, 2015.

\bibitem{BC15-ipl}
Golnaz Badkobeh and Maxime Crochemore.
\newblock Infinite binary words containing repetitions of odd period.
\newblock {\em Information Processing Letters}, 115(5):543--547, 2015.

\bibitem{CCCI15-seeds-jcmcc}
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, and Costas
  Iliopoulos.
\newblock On the appearance of seeds in words.
\newblock {\em Journal of Combinatorial Mathematics and Combinatorial
  Computing}, 95:147--160, 2015.

\bibitem{CrochemoreL16a}
Maxime Crochemore and Thierry Lecroq.
\newblock String matching.
\newblock In Ming-Yang Kao, editor, {\em Encyclopedia of Algorithms}, pages
  2113--2117. Springer, 2016.

\bibitem{CrochemoreL16}
Maxime Crochemore and Thierry Lecroq.
\newblock Multiple string matching.
\newblock In Ming-Yang Kao, editor, {\em Encyclopedia of Algorithms}, pages
  1378--1382. Springer, 2016.

\bibitem{CrochemoreR16}
Maxime Crochemore and Wojciech Rytter.
\newblock Squares and repetitions.
\newblock In Ming-Yang Kao, editor, {\em Encyclopedia of Algorithms}, pages
  2056--2060. Springer, 2016.

\bibitem{BCIK16-cant}
Golnaz Badkobeh, Maxime Crochemore, Costas Iliopoulos, and Marcin Kubica.
\newblock Text redundancies.
\newblock In V.~Berth{\'e} and M.~Rigo, editors, {\em Combinatorics, Words and
  Symbolic Dynamics}, chapter~5, pages 151--174. Cambridge University Press,
  2016.

\bibitem{CrochemoreFMP16}
Maxime Crochemore, Gabriele Fici, Robert Mercas, and Solon~P. Pissis.
\newblock Linear-time sequence comparison using minimal absent words {\&}
  applications.
\newblock In Evangelos Kranakis, Gonzalo Navarro, and Edgar Ch{\'{a}}vez,
  editors, {\em {LATIN} 2016: Theoretical Informatics - 12th Latin American
  Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings}, volume 9644 of
  {\em Lecture Notes in Computer Science}, pages 334--346. Springer, 2016.

\bibitem{CKK16-lata}
Maxime Crochemore, Roman Kolpakov, and Gregory Kucherov.
\newblock Optimal bounds for computing {\(\alpha\)}-gapped repeats.
\newblock In A.{-}H. Dediu, J.~Janousek, C.~Mart{\'{\i}}n{-}Vide, and
  B.~Truthe, editors, {\em Language and Automata Theory and Applications - 10th
  International Conference, {LATA} 2016, Prague, Czech Republic, March 14-18,
  2016, Proceedings}, volume 9618 of {\em Lecture Notes in Computer Science},
  pages 245--255. Springer, 2016.

\bibitem{BCMT16}
Golnaz Badkobeh, Maxime Crochemore, Manal Mohamed, and Chalita Toopsuwan.
\newblock Efficient computation of maximal anti-exponent in palindrome-free
  strings.
\newblock {\em Theor. Comput. Sci.}, 656:241--248, 2016.
\newblock In honor of Bill Smyth.

\bibitem{CM16-tcs}
Maxime Crochemore and Robert Mercas.
\newblock On the density of {L}yndon roots in factors.
\newblock {\em Theoretical Computer Science}, 656:234--240, 2016.
\newblock In honor of Bill Smyth.

\bibitem{CEGM16-tcs}
Maxime Crochemore, Chiara Epifanio, Roberto Grossi, and Filippo Mignosi.
\newblock Linear-size suffix tries.
\newblock {\em Theor. Comput. Sci.}, 638:171--178, 2016.

\bibitem{CIKKLPRRW16-tcs}
Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio
  Langiu, Solon~P. Pissis, Jakub Radoszewski, Wojciech Rytter, and Tomasz
  Walen.
\newblock Order-preserving indexing.
\newblock {\em Theor. Comput. Sci.}, 638:122--135, 2016.

\bibitem{CIKMV16-eaai}
Maxime Crochemore, Costas~S. Iliopoulos, Ritu Kundu, Manal Mohamed, and Fatima
  Vayani.
\newblock Linear algorithm for conservative degenerate pattern matching.
\newblock {\em Eng. Appl. of {AI}}, 51:109--114, 2016.

\bibitem{ACFGM16-cacm}
Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, and
  S.~Muthukrishnan.
\newblock 40 years of suffix trees.
\newblock {\em Communications of the ACM}, 59(4):66--73, 2016.

\bibitem{BC16mef-jcss}
Golnaz Badkobeh and Maxime Crochemore.
\newblock Computing maximal-exponent factors in an overlap-free string.
\newblock {\em Journal of Computer and System Sciences}, 82(3):477--487, 2016.

\bibitem{CrochemoreIKKPR16}
Maxime Crochemore, Costas~S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon~P.
  Pissis, Jakub Radoszewski, Wojciech Rytter, and Tomasz Walen.
\newblock Near-optimal computation of runs over general alphabet via
  non-crossing {LCE} queries.
\newblock In Shunsuke Inenaga, Kunihiko Sadakane, and Tetsuya Sakai, editors,
  {\em String Processing and Information Retrieval - 23rd International
  Symposium, {SPIRE} 2016, Beppu, Japan, October 18-20, 2016, Proceedings},
  volume 9954 of {\em Lecture Notes in Computer Science}, pages 22--34, 2016.

\bibitem{ChristouCI16}
Michalis Christou, Maxime Crochemore, and Costas~S. Iliopoulos.
\newblock Quasiperiodicities in {F}ibonacci strings.
\newblock {\em Ars Comb.}, 129:211--225, 2016.

\bibitem{RahmanAACR16}
Mohammad~Saifur Rahman, Ali Alatabbi, Tanver Athar, Maxime Crochemore, and
  M.~Sohel Rahman.
\newblock Absent words and the (dis)similarity analysis of dna sequences: an
  experimental study.
\newblock {\em BMC Research Notes}, 9(186):1--8, 2016.

\bibitem{CILM17-mscs}
Maxime Crochemore, Costas~S. Iliopoulos, Alessio Langiu, and Filippo Mignosi.
\newblock The longest common substring problem.
\newblock {\em Mathematical Structures in Computer Science}, 27(2):277--295,
  2017.

\bibitem{BCM17-tcs}
Golnaz Badkobeh, Maxime Crochemore, and Robert Mercas.
\newblock Counting maximal-exponent factors in words.
\newblock {\em Theoretical Computer Science}, 658:27--35, 2017.
\newblock In honor of A. Restivo.

\bibitem{CIKRRW17-tcs}
Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski,
  Wojciech Rytter, and Tomasz Walen.
\newblock Covering problems for partial words and for indeterminate strings.
\newblock {\em Theoretical Computer Science}, 698:25--39, 2017.
\newblock In honor of Raffaele Giancarlo.

\bibitem{AmitCLS17-runs}
Mika Amit, Maxime Crochemore, Gad~M. Landau, and Dina Sokol.
\newblock Locating maximal approximate runs in a string.
\newblock {\em Theoretical Computer Science}, 700(Supplement C):45--62, 2017.

\bibitem{ChairungseeC17}
Supaporn Chairungsee and Maxime Crochemore.
\newblock Longest previous non-overlapping factors table computation.
\newblock In Xiaofeng Gao, Hongwei Du, and Meng Han, editors, {\em
  Combinatorial Optimization and Applications - 11th International Conference,
  {COCOA} 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part {II}},
  volume 10628 of {\em Lecture Notes in Computer Science}, pages 483--491.
  Springer, 2017.

\bibitem{CCIKPRRW17-cocoon}
Panagiotis Charalampopoulos, Maxime Crochemore, Costas~S. Iliopoulos, Tomasz
  Kociumaka, Solon~P. Pissis, Jakub Radoszewski, Wojciech Rytter, and Tomasz
  Walen.
\newblock Efficient enumeration of non-equivalent squares in partial words with
  few holes.
\newblock In Yixin Cao and Jianer Chen, editors, {\em Computing and
  Combinatorics - 23rd International Conference, {COCOON} 2017, Hong Kong,
  China, August 3-5, 2017, Proceedings}, volume 10392 of {\em Lecture Notes in
  Computer Science}, pages 99--111. Springer, 2017.

\bibitem{CHKMPR17-fct}
Maxime Crochemore, Alice H{\'e}liou, Gregory Kucherov, Laurent Mouchard,
  Solon~P. Pissis, and Yann Ramusat.
\newblock Minimal absent words in a sliding window and applications to on-line
  pattern matching.
\newblock In Ralf Klasing and Marc Zeitoun, editors, {\em Fundamentals of
  Computation Theory - 21st International Symposium, {FCT} 2017, Bordeaux,
  France, September 11-13, 2017, Proceedings}, volume 10472 of {\em Lecture
  Notes in Computer Science}, pages 164--176. Springer, 2017.

\bibitem{CFPV17-wabi}
Maxime Crochemore, Alexandre~P. Francisco, Solon~P. Pissis, and C{\'a}tia Vaz.
\newblock Towards distance-based phylogenetic inference in average-case
  linear-time.
\newblock In Russell Schwartz and Knut Reinert, editors, {\em 17th
  International Workshop on Algorithms in Bioinformatics, {WABI} 2017, August
  21-23, 2017, Boston, MA, {USA}}, volume~88 of {\em LIPIcs}, pages 9:1--9:14.
  Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.

\bibitem{CCFPV18-amb}
Jo{\~a}o~A. Carri{\c{c}}o, Maxime Crochemore, Alexandre~P. Francisco, Solon~P.
  Pissis, Bruno Ribeiro-Gon{\c{c}}alves, and C{\'a}tia Vaz.
\newblock Fast phylogenetic inference from typing data.
\newblock {\em Algorithms for Molecular Biology}, 13(4):1--14, Feb 2018.

\bibitem{CharalamCP18a}
Panagiotis Charalampopoulos, Maxime Crochemore, and Solon~P. Pissis.
\newblock Preface.
\newblock {\em Fundam. Inform.}, 163(3):i, 2018.

\bibitem{CharalamCFMP18}
Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas,
  and Solon~P. Pissis.
\newblock Alignment-free sequence comparison using absent words.
\newblock {\em Inf. Comput.}, 262:57--68, 2018.

\bibitem{CrochemoreP18}
Maxime Crochemore and Solon~P. Pissis.
\newblock Advances in algorithms {\&} combinatorics on strings (honoring 60th
  birthday for prof. costas s. iliopoulos).
\newblock {\em Theor. Comput. Sci.}, 710:1, 2018.
\newblock Foreword.

\bibitem{CharalamCIKPRRW18}
Panagiotis Charalampopoulos, Maxime Crochemore, Costas~S. Iliopoulos, Tomasz
  Kociumaka, Solon~P. Pissis, Jakub Radoszewski, Wojciech Rytter, and Tomasz
  Walen.
\newblock Linear-time algorithm for long {LCF} with $k$ mismatches.
\newblock In Gonzalo Navarro, David Sankoff, and Binhai Zhu, editors, {\em
  Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, July 2-4,
  2018 - Qingdao, China}, volume 105 of {\em LIPIcs}, pages 23:1--23:16.
  Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018.

\bibitem{AlzamelCIKKRRW18}
Mai Alzamel, Maxime Crochemore, Costas~S. Iliopoulos, Tomasz Kociumaka, Ritu
  Kundu, Jakub Radoszewski, Wojciech Rytter, and Tomasz Walen.
\newblock How much different are two words with different shortest periods.
\newblock In Lazaros~S. Iliadis, Ilias Maglogiannis, and Vassilis~P.
  Plagianakos, editors, {\em Artificial Intelligence Applications and
  Innovations - {AIAI} 2018 {IFIP} {WG} 12.5 International Workshops, SEDSEAL,
  5G-PINE, MHDW, and HEALTHIOT, Rhodes, Greece, May 25-27, 2018, Proceedings},
  volume 520 of {\em {IFIP} Advances in Information and Communication
  Technology}, pages 168--178. Springer, 2018.

\bibitem{CharalamCP18}
Panagiotis Charalampopoulos, Maxime Crochemore, and Solon~P. Pissis.
\newblock On extended special factors of a word.
\newblock In Travis Gagie, Alistair Moffat, Gonzalo Navarro, and Ernesto
  Cuadros{-}Vargas, editors, {\em String Processing and Information Retrieval -
  25th International Symposium, {SPIRE} 2018, Lima, Peru, October 9-11, 2018,
  Proceedings}, volume 11147, pages 131--138. Springer, 2018.

\bibitem{CrochemoreL18}
Maxime Crochemore and Thierry Lecroq.
\newblock Suffix tree.
\newblock In Ling Liu and M.~Tamer {\"{O}}zsu, editors, {\em Encyclopedia of
  Database Systems, Second Edition}. Springer, 2018.

\bibitem{CrochemoreL18a}
Maxime Crochemore and Thierry Lecroq.
\newblock Trie.
\newblock In Ling Liu and M.~Tamer {\"{O}}zsu, editors, {\em Encyclopedia of
  Database Systems, Second Edition}. Springer, 2018.

\bibitem{CrochemoreKK19}
Maxime Crochemore, Roman Kolpakov, and Gregory Kucherov.
\newblock Optimal bounds for computing \emph{{\(\alpha\)}}-gapped repeats.
\newblock {\em Inf. Comput.}, 268, 2019.

\bibitem{CCIKPRRW19-joco}
Panagiotis Charalampopoulos, Maxime Crochemore, Costas~S. Iliopoulos, Tomasz
  Kociumaka, Solon~P. Pissis, Jakub Radoszewski, Wojciech Rytter, and Tomasz
  Walen.
\newblock Efficient enumeration of non-equivalent squares in partial words with
  few holes.
\newblock {\em Journal of Combinatorial Optimization}, 37(2):501--522, 2019.

\bibitem{CrochemoreR19}
Maxime Crochemore and Jakub Radoszewski.
\newblock Special issue in honor of the 70th birthday of prof. wojciech rytter.
\newblock {\em Theor. Comput. Sci.}, 792:1, 2019.

\bibitem{AlzamelCIKRRSWZ19}
Mai Alzamel, Maxime Crochemore, Costas~S. Iliopoulos, Tomasz Kociumaka, Jakub
  Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, and Wiktor
  Zuba.
\newblock Quasi-linear-time algorithm for longest common circular factor.
\newblock In Nadia Pisanti and Solon~P. Pissis, editors, {\em 30th Annual
  Symposium on Combinatorial Pattern Matching, {CPM} 2019, June 18-20, 2019,
  Pisa, Italy}, volume 128 of {\em LIPIcs}, pages 25:1--25:14. Schloss Dagstuhl
  - Leibniz-Zentrum fuer Informatik, 2019.

\bibitem{BadkobehBCIIS19}
Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga,
  and Shiho Sugimoto.
\newblock \emph{k}-abelian pattern matching: Revisited, corrected, and
  extended.
\newblock In Jan Holub and Jan Zd{\'{a}}rek, editors, {\em Prague Stringology
  Conference 2019, Prague, Czech Republic, August 26-28, 2019}, pages 29--40.
  Czech Technical University in Prague, Faculty of Information Technology,
  Department of Theoretical Computer Science, 2019.

\bibitem{CrochemoreHKMPR20}
Maxime Crochemore, Alice H{\'{e}}liou, Gregory Kucherov, Laurent Mouchard,
  Solon~P. Pissis, and Yann Ramusat.
\newblock Absent words in a sliding window with applications.
\newblock {\em Inf. Comput.}, 270, 2020.

\bibitem{CrochemoreR20}
Maxime Crochemore and Lu{\'\i}s M.~S. Russo.
\newblock Cartesian and {L}yndon trees.
\newblock {\em Theoretical Computer Science}, 806:1--9, February 2020.
\newblock http://arxiv.org/abs/1712.08749.

\bibitem{CrochemoreIRRSW20a}
Maxime Crochemore, Costas~S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter,
  Juliusz Straszynski, Tomasz Walen, and Wiktor Zuba.
\newblock Shortest covers of all cyclic shifts of a string.
\newblock In M.~Sohel Rahman, Kunihiko Sadakane, and Wing{-}Kin Sung, editors,
  {\em {WALCOM:} Algorithms and Computation - 14th International Conference,
  {WALCOM} 2020, Singapore, March 31 - April 2, 2020, Proceedings}, volume
  12049 of {\em Lecture Notes in Computer Science}, pages 69--80. Springer,
  2020.

\bibitem{CrochemoreIRRSW20b}
Maxime Crochemore, Costas~S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter,
  Juliusz Straszynski, Tomasz Walen, and Wiktor Zuba.
\newblock Internal quasiperiod queries.
\newblock In Christina Boucher and Sharma~V. Thankachan, editors, {\em String
  Processing and Information Retrieval - 27th International Symposium, {SPIRE}
  2020, Orlando, FL, USA, October 13-15, 2020, Proceedings}, volume 12303 of
  {\em Lecture Notes in Computer Science}, pages 60--75. Springer, 2020.
\newblock https://arxiv.org/abs/2007.13471.

\bibitem{BadkobehC20}
Golnaz Badkobeh and Maxime Crochemore.
\newblock Left {L}yndon tree construction.
\newblock In Jan Holub and Jan Zd{\'{a}}rek, editors, {\em Prague Stringology
  Conference 2020, Prague, Czech Republic, August 31-September 2, 2020}, pages
  84--95. Czech Technical University in Prague, Faculty of Information
  Technology, Department of Theoretical Computer Science, 2020.
\newblock https://arxiv.org/abs/2011.12742.

\bibitem{CLR21cup}
Maxime Crochemore, Thierry Lecroq, and Wojciech Rytter.
\newblock {\em 125 Problems in Text Algorithms---with solutions}.
\newblock Cambridge University Press, 2021.
\newblock 334 pages.

\bibitem{CrochemoreIRRSW21}
Maxime Crochemore, Costas~S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter,
  Juliusz Straszynski, Tomasz Walen, and Wiktor Zuba.
\newblock Shortest covers of all cyclic shifts of a string.
\newblock {\em Theor. Comput. Sci.}, 866:70--81, 2021.

\bibitem{BadkobehC22}
Golnaz Badkobeh and Maxime Crochemore.
\newblock Linear construction of a left {L}yndon tree.
\newblock {\em Inf. Comput.}, 285(Part):104884, 2022.

\bibitem{DBLP:journals/tcs/BealC22}
Marie{-}Pierre B{\'{e}}al and Maxime Crochemore.
\newblock Checking whether a word is hamming-isometric in linear time.
\newblock {\em Theor. Comput. Sci.}, 933:55--59, 2022.

\bibitem{DBLP:conf/cpm/CrochemoreIRRSW22}
Maxime Crochemore, Costas~S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter,
  Juliusz Straszynski, Tomasz Walen, and Wiktor Zuba.
\newblock Linear-time computation of shortest covers of all rotations of a
  string.
\newblock In Hideo Bannai and Jan Holub, editors, {\em 33rd Annual Symposium on
  Combinatorial Pattern Matching, {CPM} 2022, June 27-29, 2022, Prague, Czech
  Republic}, volume 223 of {\em LIPIcs}, pages 22:1--22:15. Schloss Dagstuhl -
  Leibniz-Zentrum f{\"{u}}r Informatik, 2022.

\bibitem{DBLP:conf/cpm/BadkobehCEN22}
Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, and Cyril Nicaud.
\newblock Back-to-front online lyndon forest construction.
\newblock In Hideo Bannai and Jan Holub, editors, {\em 33rd Annual Symposium on
  Combinatorial Pattern Matching, {CPM} 2022, June 27-29, 2022, Prague, Czech
  Republic}, volume 223 of {\em LIPIcs}, pages 13:1--13:23. Schloss Dagstuhl -
  Leibniz-Zentrum f{\"{u}}r Informatik, 2022.

\bibitem{DBLP:conf/dlt/BealC23}
Marie{-}Pierre B{\'{e}}al and Maxime Crochemore.
\newblock Fast detection of specific fragments against a set of sequences.
\newblock In Frank Drewes and Mikhail Volkov, editors, {\em Developments in
  Language Theory - 27th International Conference, {DLT} 2023, Ume{\aa},
  Sweden, June 12-16, 2023, Proceedings}, volume 13911 of {\em Lecture Notes in
  Computer Science}, pages 51--60. Springer, 2023.

\bibitem{beal_et_al:OASIcs.Grossi.14}
Marie-Pierre B\'{e}al and Maxime Crochemore.
\newblock {Specific Patterns Against Reference Sequences}.
\newblock In Alessio Conte, Andrea Marino, Giovanna Rosone, and Jeffrey~Scott
  Vitter, editors, {\em From Strings to Graphs, and Back Again: A Festschrift
  for Roberto Grossi's 60th Birthday}, volume 132 of {\em Open Access Series in
  Informatics (OASIcs)}, pages 14:1--14:12, Dagstuhl, Germany, 2025. Schloss
  Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik.

\end{thebibliography}
