|
PDF
|
\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.
|
|
PDF
|
\bibitem{CL96acm}
Maxime Crochemore and Thierry Lecroq.
\newblock Pattern matching and text compression algorithms.
\newblock {\em ACM Computing Surveys}, 28, 1:39--41, 1996.
|
|
PDF
|
\bibitem{CR95algo}
Maxime Crochemore and Wojciech Rytter.
\newblock Squares, cubes and time-space efficient string-searching.
\newblock {\em Algorithmica}, 13(5):405--425, 1995.
|
|
PDF
|
\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.
|
|
PDF
|
\bibitem{Cro92tcs}
Maxime Crochemore.
\newblock String-matching on ordered alphabets.
\newblock {\em Theoretical Computer Science}, 92(1):33--47, 1992.
|
|
PDF
|
\bibitem{CP91jacm}
Maxime Crochemore and Dominique Perrin.
\newblock Two-way string-matching.
\newblock {\em J. Assoc. Comput. Mach.}, 38(3):651--675, 1991.
|
|
PDF
|
\bibitem{Cro86tcs}
Maxime Crochemore.
\newblock Transducers and repetitions.
\newblock {\em Theoretical Computer Science}, 45(1):63--86, 1986.
|
|
PDF
|
\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.
|
|
PDF
|
\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.
|
|
PDF
|
\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.
|
|
PDF
|
\bibitem{Cro82tcs}
Maxime Crochemore.
\newblock Sharp characterization of square-free morphisms.
\newblock {\em Theoretical Computer Science}, 18(2):221--226, 1982.
|
|
PDF
|
\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.
|