| Text algorithms M Crochemore, W Rytter Maxime Crochemore, 1994 | 996 | 1994 |
| Jewels of stringology: text algorithms M Crochemore, W Rytter World Scientific, 2002 | 549 | 2002 |
| Algorithms on strings M Crochemore, C Hancart, T Lecroq Cambridge University Press, 2007 | 521 | 2007 |
| An optimal algorithm for computing the repetitions in a word M Crochemore Inf. Process. Lett. 12 (5), 244-250, 1981 | 409 | 1981 |
| Transducers and repetitions M Crochemore Theoretical Computer Science 45, 63-86, 1986 | 302 | 1986 |
| Speeding up two string-matching algorithms M Crochemore, A Czumaj, L Gasieniec, S Jarominek, T Lecroq, ... Algorithmica 12 (4), 247-267, 1994 | 269 | 1994 |
| Factor oracle: A new structure for pattern matching C Allauzen, M Crochemore, M Raffinot International Conference on Current Trends in Theory and Practice of …, 1999 | 266 | 1999 |
| Two-way string-matching M Crochemore, D Perrin Journal of the ACM (JACM) 38 (3), 650-674, 1991 | 226 | 1991 |
| A subquadratic sequence alignment algorithm for unrestricted scoring matrices M Crochemore, GM Landau, M Ziv-Ukelson SIAM journal on computing 32 (6), 1654-1673, 2003 | 191 | 2003 |
| Computer science handbook AB Tucker CRC press, 2004 | 184 | 2004 |
| Automata for matching patterns M Crochemore, C Hancart Handbook of formal languages, 399-462, 1997 | 151 | 1997 |
| Squares, cubes, and time-space efficient string searching M Crochemore, W Rytter Algorithmica 13 (5), 405-425, 1995 | 143 | 1995 |
| Automata and forbidden words M Crochemore, F Mignosi, A Restivo Information Processing Letters 67 (3), 111-117, 1998 | 142 | 1998 |
| Algorithmique du texte M Crochemore, C Hancart, T Lecroq Vuibert, 2001 | 131 | 2001 |
| Algorithms for computing approximate repetitions in musical sequences E Cambouropoulos, M Crochemore, C Iliopoulos, L Mouchard, Y Pinzon International Journal of Computer Mathematics 79 (11), 1135-1148, 2002 | 121 | 2002 |
| Direct construction of compact directed acyclic word graphs M Crochemore, R Vérin Annual Symposium on Combinatorial Pattern Matching, 116-129, 1997 | 120 | 1997 |
| Computing longest previous factor in linear time and applications M Crochemore, L Ilie Information Processing Letters 106 (2), 75-80, 2008 | 118 | 2008 |
| A fast and practical bit-vector algorithm for the longest common subsequence problem M Crochemore, CS Iliopoulos, YJ Pinzon, JF Reid Information Processing Letters 80 (6), 279-285, 2001 | 110 | 2001 |
| Sharp characterizations of squarefree morphisms M Crochemore Theoretical Computer Science 18 (2), 221-226, 1982 | 102 | 1982 |
| Data compression using antidictionaries M Crochemore, F Mignosi, A Restivo, S Salemi Proceedings of the IEEE 88 (11), 1756-1768, 2000 | 100 | 2000 |
Wojciech RytterWarsaw UniversityAdresse e-mail validée de mimuw.edu.pl
