Publications of Maxime.Crochemore@univ-mlv.fr

November 2008

Corresponding bib file

Journals  (-)

  1. [bib]Guillaume Blin, Maxime Crochemore, Sylvie Hamel, and Stéphane Vialette. Median of an odd number of permutations. Pure Mathematics and Applications.  2011. Note: electronic version (12 pp.) To appear
  2. [bib]Marie-Pierre Béal, Maxime Crochemore, Bruce Moision, and Paul Siegel. Periodic-Finite-Type Shift Spaces. IEEE Transactions on Information Theory. 57 (6).  2011. pp. 3677–3691.
  3. [bib]Maxime Crochemore, Danny Hermelin, Gad Landau, Dror Rawitz , and Stéphane Vialette. Approximating the 2-Interval Pattern problem. Theoretical Computer Science. 395 (2-3).  2008. pp. 283–297. Note: Special issue in honor of the 60th Birthday of Professor Alberto Apostolico
  4. [bib]Maxime Crochemore and Lucian Ilie. Computing Longest Previous Factor in linear time and applications. Information Processing Letters. 106 (2).  2008. pp. 75–80. Note: DOI: 10.1016/j.ipl.2007.10.006
  5. [bib]Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park, and Kangho Roh. External memory algorithms for string problems. Fundamenta Informaticae. vol. 84. 2008. pp. 1–16.
  6. [bib]Maxime Crochemore and Lucian Ilie. Maximal repetitions in strings. Journal of Computer and System Sciences. vol. 74. 2008. pp. 796–807. Note: DOI: 10.1016/j.jcss.2007.09.003
  7. [bib]Maxime Crochemore, Costas S. Iliopoulos, and Mohammad Sohel Rahman. Optimal Prefix and Suffix Queries on Texts. Information Processing Letters. 108 (5).  2008. pp. 320–325.
  8. [bib]Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, and Marie-France Sagot. All Maximal Pairs in Step-Leap Representation of Melodic Sequences. Information Sciences. 177 (9).  2007. pp. 1954–1962.
  9. [bib]Maxime Crochemore, Lucian Ilie, and Emine Seid-Hilmi. The structure of Factor Oracles. International Journal of Foundations of Computer Science. 18 (4).  2007. pp. 781–797.
  10. [bib]Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, and Marie-France Sagot. Longest Repeats with a Block of k Don't Cares. Theoretical Computer Science. 362 (1-3).  2006. pp. 248–254.
  11. [bib]Gaël Harry Diaz, Simao Melo de Souza, and Maxime Crochemore. Passage à l'échelle : complexité, algorithmique et architectures. Traitement automatique des langues. 46 (2).  2006. pp. 7–12.
  12. [bib]Maxime Crochemore, Jacques Désarménien, and Dominique Perrin. A note on the Burrows-Wheeler transformation. Theoretical Computer Science. 332 (1-3).  2005. pp. 567–572.
  13. [bib]Nadia Pisanti, Maxime Crochemore, Roberto Grossi, and Marie-France Sagot. Bases of Motifs for Generating Repeated Patterns with Wild Cards. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2 (1).  2005. pp. 40–50.
  14. [bib]Maxime Crochemore, Costas Iliopoulos, Gonzalo Navarro, Yoan Pinzon, and Alejandro Salinger. Bit-parallel (\gamma,\delta)-matching and suffix automata. Journal of Discrete Algorithms. 3 (2-4).  2005. pp. 198–214.
  15. [bib]Marie-Pierre Béal, Maxime Crochemore, and Gabriele Fici. Presentations of constrained systems with unconstrained positions. IEEE Transactions on Information Theory. 51 (5).  2005. pp. 1891–1900.
  16. [bib]Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, and Mary Schaps. Two-dimensional Pattern Matching with Rotations. Theoretical Computer Science. vol. 314. 2004. pp. 173–187.
  17. [bib]Maxime Crochemore, Gad M. Landau, and Michal Ziv-Ukelson. A Sub-quadratic Sequence Alignment Algorithm for Unrestricted Cost Matrices. SIAM Journal on Computing. 32 (6).  2003. pp. 1654–1673.
  18. [bib]Maxime Crochemore, Christophe Hancart, and Thierry Lecroq. A unifying look at the Apostolico-Giancarlo string-matching algorithm. Journal of Discrete Algorithms. 1 (1).  2003. pp. 37–52.
  19. [bib]Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, and Marinella Sciortino. Computing forbidden words of regular languages. Fundamenta Informaticae. 56 (1-2).  2003. pp. 121–135. Note: Special issue on computing patterns in strings
  20. [bib]Maxime Crochemore, Bořivoj Melichar, and Zdenĕk Troníček. Directed Acyclic Subsequence Graph - Overview. Journal of Discrete Algorithms. 1 (3-4).  2003. pp. 255–280.
  21. [bib]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzon, Wojciech Plandowski, and Wojciech Rytter. Occurrence and substring heuristics for \delta-matching. Fundamenta Informaticae. 56 (1,2).  2003. pp. 1–21.
  22. [bib]Maxime Crochemore. Reducing space for index implementation. Theoretical Computer Science. 292 (1).  2003. pp. 185–197.
  23. [bib]Maxime Crochemore, Costas S. Iliopoulos, and Yoan J. Pinzon. Speeding-up Hirschberg and Hunt-Szymanski LCS algorithms. Fundamenta Informaticae. 56 (1,2).  2003. pp. 89–103.
  24. [bib]Maxime Crochemore and Valery Stefanov. Waiting time and complexity for matching patterns with automata. Information Processing Letters. 87 (3).  2003. pp. 119–125.
  25. [bib]Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, and Yoan J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. International Journal of Computer Mathematics. 79 (11).  2002. pp. 1135–1148.
  26. [bib]Maxime Crochemore, Costas S. Iliopoulos, C. Makris, Wojciech Rytter, A. Tsakalidis, and K. Tsichlas. Approximate string matching with gaps. Nordic Journal of Computing. 9 (1).  2002. pp. 54–65.
  27. [bib]Maxime Crochemore, Costas S. Iliopoulos, and Yoan J. Pinzon. Recovering an LCS in O(n^{2}/w) time and space. Colombian Journal of Computation. 3 (1).  2002. pp. 41–52.
  28. [bib]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon, and James Reid. A fast and practical bit-vector algorithms for the longest common subsequence problem. Information Processing Letters. 80 (6).  2001. pp. 279–285.
  29. [bib]Maxime Crochemore, Costas S. Iliopoulos, and Yoan J. Pinzon. Computing Evolutionary Chains in Musical Sequences. Electronic Journal of Combinatorics. 8 (2).  2001.
  30. [bib]Maxime Crochemore, Costas Iliopoulos, Maureen Korda, and James Reid. A failure function for multiple two-dimensional pattern matching. Combinatorial Mathematics and Combinatorial Computing. vol. 35. 2000. pp. 225–238.
  31. [bib]Maxime Crochemore, Filippo Mignosi, Antonio Restivo, and Sergio Salemi. Data compression using antidictonaries. Proceedings of the I.E.E.E.. 88 (11).  2000. pp. 1756–1768. Note: Special issue \textit{Lossless data compression} edited by J. Storer
  32. [bib]Maxime Crochemore, Leszek Gąsieniec, and Wojciech Rytter. Constant-space string matching in sublinear average time. Theoretical Computer Science. 218 (1).  1999. pp. 197–203.
  33. [bib]Maxime Crochemore, Artur Czumaj, Leszek Gąsieniec, Thierry Lecroq, Wojciech Plandowski, and Wojciech Rytter. Fast practical multi-pattern matching. Information Processing Letters. 71 (3–4).  1999. pp. 107–113.
  34. [bib]Maxime Crochemore and Renaud Vérin. Zones of low entropy in genomic sequences. Computers and Chemistry. 324 (23).  1999. pp. 275–282.
  35. [bib]Maxime Crochemore, Leszek Gąsieniec, Ramesh Hariharan, S. Muthukrishnan, and Wojciech Rytter. A constant-time optimal parallel algorithm for two-dimensional pattern matching. SIAM Journal on Computing. 27 (3).  1998. pp. 668–681.
  36. [bib]Maxime Crochemore, Filippo Mignosi, and Antonio Restivo. Automata and forbidden words. Information Processing Letters. 67 (3).  1998. pp. 111–117.
  37. [bib]Maxime Crochemore, Costas S. Iliopoulos, and Maureen Korda. Two-dimensional prefix string matching and covering on square matrices. Algorithmica. vol. 20. 1998. pp. 353–373.
  38. [bib]Maxime Crochemore, Zvi Galil, Leszek Gąsieniec, Kunsoo Park, and Wojciech Rytter. Constant-time randomized parallel string matching. SIAM Journal on Computing. 26 (4).  1997. pp. 950–960.
  39. [bib]Maxime Crochemore and Thierry Lecroq. Tight bounds on the complexity of the Apostolico-Giancarlo algorithm. Information Processing Letters. 63 (4).  1997. pp. 195–203.
  40. [bib]Maxime Crochemore and Thierry Lecroq. Pattern matching and text compression algorithms. ACM Computing Surveys. vol. 28, 1. 1996. pp. 39–41.
  41. [bib]Alberto Apostolico and Maxime Crochemore. Fast parallel Lyndon factorization and applications. Mathematical System Theory. vol. 28. 1995. pp. 89–108.
  42. [bib]Maxime Crochemore and Wojciech Rytter. Squares, cubes and time-space efficient string-searching. Algorithmica. 13 (5).  1995. pp. 405–425.
  43. [bib]Maxime Crochemore and Wojciech Rytter. On two-dimensional pattern matching by optimal parallel algorithms. Theoretical Computer Science. 132 (1–2).  1994. pp. 403–414.
  44. [bib]Maxime Crochemore, Artur Czumaj, Leszek Gąsieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, and Wojciech Rytter. Speeding up two string-matching algorithms. Algorithmica. 12 (4–5).  1994. pp. 247–267.
  45. [bib]Maxime Crochemore, Leszek Gąsieniec, and Wojciech Rytter. Two-dimensional pattern matching by sampling. Information Processing Letters. 46 (4).  1993. pp. 159–162.
  46. [bib]Jean Néraud and Maxime Crochemore. A string-matching interpretation of the equation x^{m}y^{n}=z^{p}. Theoretical Computer Science. 92 (1).  1992. pp. 145–164.
  47. [bib]Maxime Crochemore. String-Matching on Ordered Alphabets. Theoretical Computer Science. 92 (1).  1992. pp. 33–47.
  48. [bib]Maxime Crochemore and Wojciech Rytter. Efficient parallel algorithms to test square-freeness and factorize strings. Information Processing Letters. 38 (2).  1991. pp. 57–60.
  49. [bib]Maxime Crochemore and Pavel Goralcik. Mutually avoiding ternary words of small exponent. International Journal of Algebra and Computation. 1 (4).  1991. pp. 407–410.
  50. [bib]Maxime Crochemore, Michal Chytil, Burkhard Monien, and Wojciech Rytter. On the parallel recognition of unambiguous context-free languages. Theoretical Computer Science. 81 (2).  1991. pp. 311–316.
  51. [bib]Alberto Apostolico and Maxime Crochemore. Optimal canonization of all substrings of a string. Information and Computation. 95 (1).  1991. pp. 76–95.
  52. [bib]Maxime Crochemore and Dominique Perrin. Two-way string-matching. J. Assoc. Comput. Mach.. 38 (3).  1991. pp. 651–675.
  53. [bib]Maxime Crochemore and Wojciech Rytter. Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays. Theoretical Computer Science. 88 (1).  1991. pp. 59–82.
  54. [bib]Maxime Crochemore and Wojciech Rytter. Parallel construction of minimal suffix and factor automata. Information Processing Letters. 35 (3).  1990. pp. 121–128.
  55. [bib]Maxime Crochemore. String-matching and periods. Bulletin of the European Association of Theoretical Computer Science. vol. 39. 1989. pp. 149–153.
  56. [bib]J. Berstel, M. Crochemore, and J.-E. Pin. Thue-Morse sequence and p-adic topology for the free monoid. Discrete Mathematics. 76 (2).  1989. pp. 89–94.
  57. [bib]Maxime Crochemore and Dominique Perrin. Critical factorizations of words. Bulletin of the European Association of Theoretical Computer Science. vol. 34. 1988. pp. 47–52.
  58. [bib]Jean-Jacques Hébrard and Maxime Crochemore. Calcul de la distance par les sous-mots. Informatique Theorique et Applications. 20 (4).  1986. pp. 441–456.
  59. [bib]Maxime Crochemore. Computing LCF in linear time. Bulletin of the European Association of Theoretical Computer Science. vol. 30. 1986. pp. 57–61.
  60. [bib]Maxime Crochemore. Transducers and repetitions. Theoretical Computer Science. 45 (1).  1986. pp. 63–86.
  61. [bib]Maxime Crochemore. Linear searching for a square in a word. Bulletin of the European Association of Theoretical Computer Science. vol. 24. 1984. pp. 66–72. Note: Presented at ICALP'84.
  62. [bib]Maxime Crochemore. A solution to P12. Bulletin of the European Association of Theoretical Computer Science. vol. 19. 1983. pp. 15–16.
  63. [bib]Maxime Crochemore, Michel Lerest, and Philippe Wender. An optimal test on finite unavoidable sets of words. Information Processing Letters. 16 (4).  1983. pp. 179–180.
  64. [bib]Maxime Crochemore. Recherche linéaire d'un carré dans un mot. C. R. Acad. Sci. Paris Sér. I Math.. 296 (18).  1983. pp. 781–784.
  65. [bib]Maxime Crochemore. A solution to Berstel's problem P3. Bulletin of the European Association of Theoretical Computer Science. vol. 18. 1982. pp. 9–11.
  66. [bib]Alain Cardon and Maxime Crochemore. Partitioning a graph in O(|A|\log_{2}|V|). Theoretical Computer Science. 19 (1).  1982. pp. 85–98.
  67. [bib]Maxime Crochemore. Sharp characterization of square-free morphisms. Theoretical Computer Science. 18 (2).  1982. pp. 221–226.
  68. [bib]Maxime Crochemore. An optimal algorithm for computing the repetitions in a word. Information Processing Letters. 12 (5).  1981. pp. 244–250.
  69. [bib]Alain Cardon and Maxime Crochemore. Détermination de la représentation standard d'une série reconnaissable. RAIRO Informatique Théorique/Theoretical Informatics. 14 (4).  1980. pp. 371–379.

In proceedings  (-)

  1. [bib]Maxime Crochemore, Szilárd Z. Fazekas, Costas S. Iliopoulos, and Inuka Jayasekera. Bounds on powers in strings. In, Masami Ito, Masafumi Toyama, editors, International Conference on Developments in Language Theory (DLT'09). vol. 5257. LNCS.  2009. pp. 206–215.  Springer-Verlag.
  2. [bib]Maxime Crochemore, Lucian Ilie, and William F. Smyth. A simple algorithm for computing the Lempel-Ziv factorization. In, J.A. Storer, M.W. Marcellin, editors, 18th Data Compression Conference (DCC'08).  2008. pp. 482–488.  IEEE Computer Society Press, Los Alamitos, CA.
  3. [bib]Maxime Crochemore and Ely Porat. Computing a longest increasing subsequence of length k in time O(n\log\log k). In, E. Gelenbe, S. Abramsky, V. Sassone, editors, Visions of computer science.  Swindon, UK. 2008. pp. 69–74.  The British Computer Society.
  4. [bib]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, and Tomasz Walen. Improved algorithms for the range next value problem and applications. In, S. Albers, P. Weil, editors, International Symposium on Theoretical Aspects of Computer Science (STACS'08).  2008. pp. 205–216.  IBFI Schloss Dagstuhl.  Note: ISBN: 978-3-939897-06-4
  5. [bib]Marie-Pierre Béal and Maxime Crochemore. Minimizing incomplete automata. Finite-State Methods and Natural Language Processing (FSMNLP'08). Joint Research Centre.  2008. pp. 9–16.
  6. [bib]Maxime Crochemore, Lucian Ilie, and Liviu Tinta. Towards a solution to the runs conjecture. 19th Symposium on Combinatorial Pattern Matching (CPM'08). vol. 5029. LNCS.  2008. pp. 290–302.
  7. [bib]Maxime Crochemore and Lucian Ilie. Understanding maximal repetitions in strings. In, S. Albers, P. Weil, editors, Symposium on Theoretical Aspects of Computer Science (STACS'08).  2008. pp. 11–16.  IBFI Schloss Dagstuhl.
  8. [bib]Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, and Mauriana Pesaresi. On the longest common factor problem. In, G. Ausiello, J. Karhumäki, G. Mauri, C.-H. L. Ong, editors, 5th IFIP International Conference on Theoretical Computer Science (TCS'08). vol. 273. IFIP.  8-10 September 2008. pp. 143–155.  Springer-Verlag.
  9. [bib]Maxime Crochemore and Lucian Ilie. Analysis of maximal repetitions in strings. In, L. Kucera, A. Kucera, editors, International Symposium on Mathematical Foundations of Computer Science (MFCS'07). vol. 4708. LNCS.  2007. pp. 465–476.  Springer-Verlag, Berlin.
  10. [bib]Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, and Pierre Peterlongo. Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. In, R. Loos, S. Z. Fazekas, C. Martín-Vide, editors, 1st International Conference on Language and Automata Theory and Applications (LATA'07).  2007. pp. 57–66.  Universitat Rovira i Virgili.
  11. [bib]Maxime Crochemore, Costas S. Iliopoulos, and Mohammad Sohel Rahman. Finding Patterns in Given Intervals. In, L. Kucera, A. Kucera, editors, Mathematical Foundations of Computer Science (MFCS'07). vol. 4708. LNCS.  2007. pp. 645–656.  Springer-Verlag, Berlin.
  12. [bib]Marie-Pierre Béal and Maxime Crochemore. Minimizing local automata. In, G. Caire, M. Fossorier, editors, IEEE International Symposium on Information Theory (ISIT'07). no. 07CH37924C.  2007. pp. 1376–1380.  IEEE Catalog.
  13. [bib]Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, and Filippo Mignosi. On the suffix automaton with mismatches. In, J. Holub, J. Zdárek, editors, 12th Implementation and Application of Automata (CIAA'07). vol. 4783. LNCS.  2007. pp. 144–156.  Springer-Verlag.
  14. [bib]Maxime Crochemore, Lucian Ilie, and Emine Seid-Hilmi. Factor Oracles. In, O. H. Ibarra, H.-C. Yen, editors, Implementation and Application of Automata. vol. 4094. LNCS.  2006. pp. 78–89.  Springer-Verlag.
  15. [bib]Nadia Pisanti, Maxime Crochemore, Roberto Grossi, and Marie-France Sagot. A Comparative Study of Bases for Motif Inference. In, C. Iliopoulos, T. Lecroq, editors, String Algorithmics.  2005. pp. 195–225.  King's College London Publications.
  16. [bib]Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, and Marie-France Sagot. A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories. In, T. Crawford, M. Sandler, editors, Proceedings of the 6th International Conference on Music Information Retrieval (ISMIR 2005).  2005. pp. 167–174.
  17. [bib]Maxime Crochemore, Danny Hermelin, Gad M. Landau, and Stéphane Vialette. Approximating the 2-Interval Pattern Problem. In, G. S. Brodal, S. Leonardi, editors, 13th Annual European Symposium on Algorithms (ESA'05). vol. 3669. LNCS.  Mallorca, Spain. 2005. pp. 426–437.  Springer-Verlag.
  18. [bib]Maxime Crochemore, Gad M. Landau, Baruch Schieber, and Michal Ziv-Ukelson. Re-Use Dynamic Programming for Sequence Alignment: An Algorithmic Toolkit. In, C. Iliopoulos, T. Lecroq, editors, String Algorithmics.  2005. pp. 19–59.  King's College London Publications.
  19. [bib]Maxime Crochemore, Chiara Epifanio, Roberto Grossi, and Filippo Mignosi. A trie-based approach for compacting automata. In, S. C. Sahinalp, S. Muthukrishnan, U. Dogrusoz, editors, Combinatorial Pattern Matching. vol. 3109. LNCS.  2004. pp. 145–158.  Springer-Verlag.
  20. [bib]Maxime Crochemore, Raffaele Giancarlo, and Marie-France Sagot. Longest Motifs with a Functionally Equivalent Block. In, A. Apostolico, M. Melucci, editors, 11th String Processing and Information Retrieval (SPIRE'2004). vol. 3246. LNCS.  2004. pp. 298–309.  Springer-Verlag.
  21. [bib]Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, and Marie-France Sagot. Longest repeated motif with a block of don't cares. In, M. Farach-Colton, editors, 6th Latin American Theoretical INformatics (LATIN'04). vol. 2976. LNCS.  2004. pp. 271–278.  Springer-Verlag.
  22. [bib]Nadia Pisanti, Maxime Crochemore, Roberto Grossi, and Marie-France Sagot. A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum. In, B. Rovan, P. Vojtáš, editors, International Symposium on Mathematical Foundations of Computer Science 2003. vol. 2747. LNCS.  2003. pp. 622–632.  Springer-Verlag.
  23. [bib]Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, and Yoan J. Pinzon. A bit-parallel suffix automaton approach for (\delta,\gamma)-matching in music retrieval. In, M. Nascimento, E. de Moura, A. Oliveira, editors, 10th String Processing and Information Retrieval (SPIRE'2003). vol. 2857. LNCS.  2003. pp. 211–223.  Springer-Verlag.
  24. [bib]Jan Holub and Maxime Crochemore. On the implementation of compact DAWG's. In, J.-M. Champarnaud, D. Maurel, editors, Implementation and Application of Automata. vol. 2608. LNCS.  2003. pp. 289–294.  Springer-Verlag.
  25. [bib]Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, and Malka Schaps. Two-dimensional Pattern Matching with Rotations. In, R. Baeza-Yates, E. Chavez, M. Crochemore, editors, 14th Symposium on Combinatorial Pattern Matching (CPM'2003). vol. 2676. LNCS.  2003. pp. 17–31.  Springer-Verlag.
  26. [bib]Maxime Crochemore, Gad M. Landau, and Michal Ziv-Ukelson. A Sub-quadratic Sequence Alignment Algorithm for Unrestricted Cost Matrices. In, David Eppstein, editors, Proceedings of the Thirteen Annual ACM-SIAM Symposium on Discrete Algorithms.  2002. pp. 679–688.  ACM-SIAM.  Note: Rapport I.G.M. 2001-08
  27. [bib]Maxime Crochemore and Zdenĕk Troníček. On the size of DASG for multiple texts. In, A. Laender, A. Oliveira, editors, 9th String Processing and Information Retrieval (SPIRE'2002). vol. 2476. LNCS.  2002. pp. 58–64.  Springer-Verlag.
  28. [bib]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, and Wojciech Rytter. Three Heuristics for delta-Matching: delta-BM Algorithms. In, A. Apostolico, M. Takeda, editors, Symposium on Combinatorial Pattern Matching (CPM'2002). vol. 2373. LNCS.  2002. pp. 178–189.  Springer-Verlag.
  29. [bib]Maxime Crochemore and Gonzalo Navarro. Improved antidictionary based compression. SCCC'02, Chilean Computer Science Society.  November 2002. pp. 7–13.  I.E.E.E. CS Press.
  30. [bib]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, and Yoan J. Pinzon. Approximate String Matching in Musical Sequences. In, M. Balík, M. Šimánek, editors, PSC'2001, Prague Stringoly Club (Prague, 2001).  2001. pp. 26–36.  Czech Technical University of Prague.  Note: DC-2001-06
  31. [bib]Cyril Allauzen, Maxime Crochemore, and Mathieu Raffinot. Efficient Experimental String Matching by Weak Factor Recognition. In, A. Amir, G.M. Landau, editors, 12th Symposium on Combinatorial Pattern Matching (CPM'2001). vol. 2089. LNCS.  Jerusalem, Israel. 2001. pp. 51–72.  Springer-Verlag.
  32. [bib]Maxime Crochemore, Costas S. Iliopoulos, and Yoan J. Pinzon. Speeding-up Hirschberg and Hunt-Szymanski LCS algorithms. In, G. Navarro, editors, 8th String Processing and Information Retrieval (SPIRE 2001).  Laguna de San Rafael, Chile. 2001. pp. 59–67.  IEEE Computer Society.
  33. [bib]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon, and James Reid. A fast and practical bit-vector algorithms for the longest common subsequence problem. In, L. Brankovic, J. Ryan, editors, Proceedings of the eleventh Australasian Workshop on Combinatorial Algorithms, AWOCA'2000.  2000. pp. 75–86.  University of Newcastle, NSW, Australia.
  34. [bib]Maxime Crochemore, Costas S. Iliopoulos, and Yoan J. Pinzon. Fast Evolutionary Chains. In, V. Hlaváč, K. G. Jeffery, J. Wiedermann, editors, Sofsem 2000—Theory and Practice of Informatics. vol. 1963. LNCS.  2000. pp. 306–317.  Springer-Verlag.
  35. [bib]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon, and Wojciech Rytter. Finding Motifs with Gaps. Proceedings of International Symposium on Music Information Retrieval (ISMIR'00).  Plymouth, Massachusetts. 2000. pp. 306–317.
  36. [bib]Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, and Yoan J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. In, R. Raman, J. Simpson, editors, Proceedings of the tenth Australian Workshop on Combinatorial Algorithms, AWOCA'99.  1999. pp. 129–144.  School of Computing, Curtin University of Technology, Perth, Western Australia.
  37. [bib]Maxime Crochemore, Filippo Mignosi, Antonio Restivo, and Sergio Salemi. Text compression using antidictonaries. In, J. Wiedermann, P. van Emde Boas, M. Nielsen, editors, International Conference on Automata, Languages an Programming (Prague, 1999). vol. 1644. LNCS.  1999. pp. 261–270.  Springer-Verlag.  Note: Rapport I.G.M. 98-10, Université de Marne-la-Vallée
  38. [bib]Cyril Allauzen, Maxime Crochemore, and Mathieu Raffinot. Factor oracle: a new structure for pattern matching. In, Jan Pavelka, Gerard Tel, Miroslav Bartosek, editors, 26th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'99). vol. 1725. LNCS.  Milovy, Czech Republic. November 1999. pp. 291–306.  Springer-Verlag.
  39. [bib]Maxime Crochemore, Costas S. Iliopoulos, and Hiafeng Yu. Algorithms for computing evolutionary chains in molecular and musical sequences. In, C. S. Iliopoulos, editors, Proceedings of the ninth Australian Workshop on Combinatorial Algorithms AWOCA'98 (Perth, 1998).  1998. pp. 172–184.  School of Computing, Curtin University of Technology, Perth, Western Australia.
  40. [bib]Maxime Crochemore, Leszek Gąsieniec, and Wojciech Rytter. Constant-space string matching in sublinear average time. In, B. Carpentieri, A. De Santis, U. Vaccaro, J.A. Storer, editors, Compression and Complexity of Sequences (Positano, 1997).  1998. pp. 230–239.  IEEE Computer Society.
  41. [bib]Maxime Crochemore, Filippo Mignosi, and Antonio Restivo. Minimal forbidden words and factor automata. In, L. Brim, J. Gruska, J. Zlatuška, editors, Mathematical Foundations of Computer Science (Brno, 1998). vol. 1450. LNCS.  1998. pp. 665–673.  Springer-Verlag.
  42. [bib]Maxime Crochemore, Costas S. Iliopoulos, Maureen Korda, and James F. Reid. Two-dimensional dictionary prefix-matching. In, C. S. Iliopoulos, editors, Proceedings of the ninth Australian Workshop on Combinatorial Algorithms, AWOCA'98 (Perth, 1998).  1998. pp. 147–158.  School of Computing, Curtin University of Technology, Perth, Western Australia.
  43. [bib]Maxime Crochemore and Renaud Vérin. Direct construction of compact Directed Acyclic Word Graphs. In, A Apostolico, J. Hein, editors, Combinatorial Pattern Matching (Aarhus, 1997). vol. 1264. LNCS.  1997. pp. 116–129.  Springer-Verlag.
  44. [bib]Nadia El Mabrouk and Maxime Crochemore. Boyer-Moore strategy to efficient approximate string matching. In, D. Hirschberg, E.W. Myers, editors, Combinatorial Pattern Matching (Labuna Beach, California, 1996). vol. 1075. LNCS.  1996. pp. 24–38.  Springer-Verlag.
  45. [bib]Maxime Crochemore and Thierry Lecroq. Tight bounds on the complexity of the Apostolico-Giancarlo algorithm. In, N. Ziviani, R. Baeza-Yates, K. Guimaraes, editors, South American Workshop on String Processing (WSP 1996).  1996. pp. 64–74.  Carleton University Press.
  46. [bib]Maxime Crochemore and Wojciech Rytter. On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. In, R. Baeza-Yates, E. Goles, P.V. Poblete, editors, 2nd Latin American Theoretical INformatics (LATIN'95). vol. 911. LNCS.  1995. pp. 220–229.  Springer-Verlag.
  47. [bib]Maxime Crochemore, Leszek Gąsieniec, Wojciech Plandowski, and Wojciech Rytter. Two-dimensional pattern matching in linear time and small space. In, E.W. Mayr, C. Puech, editors, 12th International Symposium on Theoretical Aspects of Computer Science (STACS 1995). vol. 900. LNCS.  1995. pp. 181–192.  Springer-Verlag.
  48. [bib]Maxime Crochemore, Jean-Paul Arcangeli, Jean-Noel Hourcastagnou, and Jean-Eric Pin. Compression for an effective management of telemetry data. SPACEOPS'92, Proc. of the Second International Symposium on Ground Data Systems for Space Operations (Pasadena, 1992).  1993. pp. 823–830.  Jet Propulsion Laboratory Publications.
  49. [bib]Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gąsieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, and Wojciech Rytter. Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions. 34th IEEE Annual Symposium on Foundations of Computer Science (FOCS'93).  Palo Alto, California. 1993. pp. 248–258.  I.E.E.E..
  50. [bib]Maxime Crochemore, Artur Czumaj, Leszek Gąsieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, and Wojciech Rytter. Deux méthodes pour accélérer l'algorithme de Boyer-Moore. In, D. Krob, editors, Théorie des automates et applications, Université de Rouen.  1992. pp. 45–63.  Université de Rouen.
  51. [bib]Maxime Crochemore and Wojciech Rytter. Note on two-dimensional pattern matching by optimal parallel algorithms. In, A. Nakamura, M. Nivat, A. Saoudi, P. S. P. Wang, K. Inoue, editors, Parallel Image Analysis (Ube, 1992). vol. 654. LNCS.  1992. pp. 100–112.  Springer-Verlag.
  52. [bib]Maxime Crochemore, Artur Czumaj, Leszek Gąsieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, and Wojciech Rytter. Speeding up two string-matching algorithms. In, A. Finkel, M. Jantzen, editors, 9th International Symposium on Theoretical Aspects of Computer Science (STACS 1992). vol. 577. LNCS.  1992. pp. 589–600.  Springer-Verlag.
  53. [bib]Maxime Crochemore. A la recherche d'un mot. In, V. Bruyère, editors, Actes des Journées Montoises (Mons, 1990).  Université de Mons-Hainaut, Belgique. 1990. pp. 34–38.
  54. [bib]Maxime Crochemore. Note on constant-space string matching. In, R. Capocelli, editors, Sequences: Combinatorics, Compression, Security, and Transmission (Positano, 1988).  1990.  Springer-Verlag.
  55. [bib]Maxime Crochemore and Wojciech Rytter. Parallel computations on strings and arrays. In, C. Choffrut, T. Lengauer, editors, 7th International Symposium on Theoretical Aspects of Computer Science (STACS 1990). vol. 415. LNCS.  1990. pp. 109–125.  Springer-Verlag.
  56. [bib]Maxime Crochemore and Wojciech Rytter. Parallel construction of minimal suffix and factor automata. In, B. Rovan, editors, International Symposium on Mathematical Foundations of Computer Science (MFCS'90). vol. 452. LNCS.  1990. pp. 217–223.  Springer-Verlag.
  57. [bib]Maxime Crochemore and Jean Néraud. Unitary monoid with two generators: an algorithmic point of view. In, A. Arnold, editors, CAAP'90, proceedings of the 15th Colloquium on Trees in Algebra and Programming (Copenhagen, 1990). vol. 431. LNCS.  1990. pp. 117–131.  Springer-Verlag.
  58. [bib]Maxime Crochemore. Automata and algorithms. In, J-E. Pin, editors, Formal Properties of Finite Automata and Applications (Ramatuelle, 1988). vol. 386. LNCS.  1989. pp. 166–175.  Springer-Verlag.
  59. [bib]Maxime Crochemore. Data compression with substitution. In, M. Gross, D. Perrin, editors, Electronic Dictionaries and Automata in Computational Linguistics (Oléron, 1987). vol. 377. LNCS.  1989. pp. 1–16.  Springer-Verlag.
  60. [bib]Maxime Crochemore. Constant-Space String Matching. In, Nori, Kumar, editors, Foundations of Software Technology, Theoretical Computer Science (Puna, 1988). vol. 338. LNCS.  1988. pp. 80–87.  Springer-Verlag.
  61. [bib]Maxime Crochemore and Dominique Perrin. Pattern matching in strings. In, V. Cantoni, V. Di Gesu, S. Levialdi, editors, Proceedings of the 4th conference on Image Analysis and Processing (Cefalù, 1988). vol. 249. LNCS.  1988. pp. 67–79.  Plenum Press.
  62. [bib]Maxime Crochemore. String Matching with Contraints. In, M. Chytil, L. Janiga, S. Koubek, editors, Mathematical Foundations of Computer Science 1988 (Carlsbad, 1988). vol. 324. LNCS.  1988. pp. 44–58.  Springer-Verlag.
  63. [bib]Maxime Crochemore. Calcul de la f-distance de deux mots. Actes du séminaire d'informatique théorique du L.I.T.P..  1986. pp. 25–36.  Universités Paris 6-7.
  64. [bib]Maxime Crochemore. Optimal factor transducers. In, A. Apostolico, Z. Galil, editors, Combinatorial Algorithms on Words (Maratea, 1984). no. 12. NATO Adv. Sci. Inst. Ser. F, Comput. Systems Sci..  1985. pp. 31–43.  Springer-Verlag.
  65. [bib]Maxime Crochemore. Mots et morphismes sans carré. Combinatorial Mathematics (Marseille-Luminy, 1981). no. 75. Math. Stud..  1983. pp. 235–245.  North-Holland.

Collections, books and book chapters  (-)

  1. [bib]Guillaume Blin, Maxime Crochemore, and Stéphane Vialette. Algorithmic Aspects of Arc-Annotated Sequences. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications. Wiley.  2009.
  2. [bib]Combinatorial Algorithms. Joseph Wun-Tat Chan, Maxime Crochemore. Birkhäuser Basel, Switzerland.  2008.
  3. [bib]Maxime Crochemore and Thierry Lecroq. Encyclopedia of Algorithms. Edited by Ming-Yang Kao. Springer-Verlag.  2008. pp. 824–826. Note: Chapter title : Sequential exact string matching
  4. [bib]Maxime Crochemore and Wojciech Rytter. Encyclopedia of Algorithms. Edited by Ming-Yang Kao. Springer-Verlag.  2008. pp. 874–877. Note: Chapter title : Squares and repetitions
  5. [bib]Maxime Crochemore and Thierry Lecroq. Sequential multiple string matching. Encyclopedia of Algorithms. Edited by Ming-Yang Kao. Springer-Verlag.  2008. pp. 826–829.
  6. [bib]Maxime Crochemore, Christophe Hancart, and Thierry Lecroq. Algorithms on Strings. Cambridge University Press.  2007. Note: 392 pages
  7. [bib]Fouille de données textuelles : complexité, algorithmique et passage à l'échelle. Maxime Crochemore, Gaël Harry Diaz, Simao Melo de Souza. Lavoisier, Paris.  2006. Note: Numéro spécial de \textit{Traitement automatique des langues} - volume 46(2)
  8. [bib]Maxime Crochemore and Thierry Lecroq. Text Searching and Indexing. Recent Advances in Formal Languages and Applications. Edited by Z. Ésik, C. Martín-Vide, V. Mitrana. Springer-Verlag.  2006. pp. 43–80.
  9. [bib]Combinatorial Pattern Matching. Alberto Apostolico, Maxime Crochemore, Kunsoo Park. Springer-Verlag.  2005.
  10. [bib]Indexing and Matching Strings. Ricardo Baeza-Yates, Maxime Crochemore. Elsevier.  2005. Note: Special issue of \textit{J. Discrete Algorithms} - volume 3(2–4)
  11. [bib]Maxime Crochemore. Structures for indexes. Applied Combinatorics on Words. Edited by M. Lothaire. Cambridge University Press.  2005. pp. 106–163.
  12. [bib]Maxime Crochemore and Marie-France Sagot. Motifs in Sequences: Localization and Extraction. Compact Handbook of Computational Biology. Edited by A. K. Konopka, M. J. C. Crabbe. Marcel Dekker, New York.  2004. pp. 47–97.
  13. [bib]Maxime Crochemore and Thierry Lecroq. Pattern matching and text compression algorithms. The Computer Science and Engineering Handbook. Edited by Allen B. Tucker. CRC Press.  2004. pp. 1–48.
  14. [bib]Combinatorial Pattern Matching. Ricardo Baeza-Yates, Edgar Chávez, Maxime Crochemore. Springer-Verlag.  2003.
  15. [bib]Genome and Informatics. Jean-Loup Risler, Maxime Crochemore, Andrzej K. Konopka, Bernard Prum, Pierre Rouzé. Pergamon.  2002. Note: Special issue of \textit{Computers and Chemistry}
  16. [bib]Maxime Crochemore and Wojciech Rytter. Jewels of Stringology. World Scientific Publishing.  Hong-Kong. 2002. Note: 310 pages
  17. [bib]Alberto Apostolico and Maxime Crochemore. String pattern matching for a deluge survival kit. Handbook of Massive Data Sets. Edited by J. Abello, P.M. Pardalos, M.G.C. Resende. Kluwer Academic Publishers.  2002. pp. 151–194.
  18. [bib]Maxime Crochemore, Christophe Hancart, and Thierry Lecroq. Algorithmique du texte. Vuibert.  2001. Note: 347 pages
  19. [bib]Matching Patterns. Maxime Crochemore, Leszek Gąsieniec. Hermès.  2000. Note: Special issue of \textit{J. Discrete Algorithms}
  20. [bib]Combinatorial Pattern Matching (Warwick, 1999). Maxime Crochemore, Mike Paterson. Springer-Verlag.  1999. Note: see http://link.springer.de/link/service/series/0558/tocs/t1645.htm
  21. [bib]Informatics and the genome. Alain Hénaut, Maxime Crochemore, Andrzej K. Konopka, Jean-Loup Risler, Pierre Rouzé. Pergamon.  1999. Note: Special issue of \textit{Computers and Chemistry}
  22. [bib]Maxime Crochemore and Christophe Hancart. Pattern matching in strings. Algorithms and Theory of Computation Handbook. Edited by Mikhail J. Atallah. CRC Press.  1998. pp. 11.1–11.28.
  23. [bib]Maxime Crochemore and Thierry Lecroq. Text data compression algorithms. Algorithms and Theory of Computation Handbook. Edited by Mikhail J. Atallah. CRC Press.  1998. pp. 12.1–12.23.
  24. [bib]Maxime Crochemore and Christophe Hancart. Automata for matching patterns. Handbook of Formal Languages. Edited by G. Rozenberg, A. Salomaa. Springer-Verlag.  1997. pp. 399–462.
  25. [bib]Maxime Crochemore. Off-line exact serial string searching. Pattern Matching Algorithms. Edited by A Apostolico, Z. Galil. Oxford University Press.  1997. pp. 1–53.
  26. [bib]Maxime Crochemore and Renaud Vérin. On Compact Directed Acyclic Word Graphs. Structures in Logic and Computer Science. Edited by J. Mycielski, G. Rozenberg, A. Salomaa. Springer-Verlag.  1997. pp. 192–211.
  27. [bib]Maxime Crochemore and Thierry Lecroq. Pattern matching and text compression algorithms. The Computer Science and Engineering Handbook. Edited by Allen B. Tucker. CRC Press.  1997. pp. 162–202.
  28. [bib]Combinatorial Pattern Matching (Asilomar, California, 1994). Maxime Crochemore, Dan Gusfield. Springer-Verlag.  1994.
  29. [bib]Maxime Crochemore and Wojciech Rytter. Text algorithms. Oxford University Press.  1994. Note: 412 pages
  30. [bib]Combinatorial Pattern Matching (Padova, 1993). Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber. Springer-Verlag.  1993.
  31. [bib]Informatique et génome (Marne-la-Vallée, 1993). Maxime Crochemore. I.G.M., Université de Marne-la-Vallée.  1993.
  32. [bib]Maxime Crochemore, Dominique Perrin, and Jean-Eric Pin. Les automates finis. Le Courrier du C.N.R.S., la recherche en informatique. C.N.R.S..  1993. pp. 48–51.
  33. [bib]Maxime Crochemore and Wojciech Rytter. Periodic prefixes in texts. Sequences II (Positano, 1991). Edited by R. Capocelli, A. De Santis, U. Vaccaro. Springer-Verlag, New York.  1993. pp. 153–165.
  34. [bib]Combinatorial Pattern Matching (Paris, 1990). Maxime Crochemore. Elsevier.  1992. Note: Special issue of \textit{Theoretical Computer Science} - volume 92(1)
  35. [bib]Combinatorial Pattern Matching (Tucson, Arizona, 1992). Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber. Springer-Verlag.  1992.
  36. [bib]Actes des journées Informatique Fondamentale et Intelligence Artificielle (Villetaneuse, 1987). Maxime Crochemore, Ahmed Saoudi. Université Paris-Nord.  1987.
  37. [bib]Maxime Crochemore. Longest common factor of two words. TAPSOFT'87 (Pisa, 1987). Edited by Ehrig, Kowalski, Levi, Montanari. Springer-Verlag.  1987. pp. 26–36.
  38. [bib]Actes des journées Informatique Fondamentale et Intelligence Artificielle (Villetaneuse, 1986). Maxime Crochemore, Ahmed Saoudi. Université Paris-Nord.  1986.
  39. [bib]Maxime Crochemore. Tests sur les morphismes faiblement sans carré. Combinatorics on Words (Waterloo, Ont., 1982). Edited by L. Cummings. Academic Press.  1983. pp. 63–89.
  40. [bib]Maxime Crochemore. Simulation des automates déterministes à pile d'après Cook et Jones. Actes du séminaire d'informatique théorique du L.I.T.P.. Universités Paris 6-7.  1980.

Phd thesis   (-)

  1. [bib]Maxime Crochemore. Régularités évitables. Thèse d'état. Université de Haute-Normandie.  1983.
  2. [bib]Alain Cardon and Maxime Crochemore. Standardisation de séries formelles et minimisation d'automates. Thèse de 3ème cycle. Université de Haute-Normandie.  1978.

Other   (-)

  1. [bib]Guillaume Blin, Maxime Crochemore, Sylvie Hamel, and Stéphane Vialette. Finding the median of three permutations under the Kendall-tau distance. Extended Abstract in the 7th annual international conference on Permutation Patterns, University of Firenze, Italy..  July 2009. Note: electronic version (6 pp.)
  2. [bib]Nadia Pisanti, Maxime Crochemore, Roberto Grossi, and Marie-France Sagot. A Basis for Repeated Motifs in Pattern Discovery and Text Mining. Institut Gaspard-Monge.  2002. Note: Rapport I.G.M. 2002-10.
  3. [bib]Maxime Crochemore and Zdenĕk Troníček. Directed acyclic subsequence graph for multiple texts. I.G.M., Université de Marne-la-Vallée. Rapport I.G.M. 99-13.  1999.
  4. [bib]Maxime Crochemore, Artur Czumaj, Leszek Gąsieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, and Wojciech Rytter. Fast Multi-Pattern Matching. I.G.M., Université de Marne-la-Vallée. Rapport I.G.M. 93-3.  1993.
  5. [bib]Maxime Crochemore, Leszek Gąsieniec, and Wojciech Rytter. Turbo-BM. Universités Paris 6-7. Rapport L.I.T.P. 92.61.  1992.
  6. [bib]Maxime Crochemore and Wojciech Rytter. Testing square-freeness of strings by an optimal parallel algorithm in logarithmic time. Universités Paris 6-7. Rapport L.I.T.P. 90-63.  1990.
  7. [bib]Maxime Crochemore and Marc Zipstein. Transducteurs arithmétiques. Universités Paris 6-7. Rapport L.I.T.P. 89-12.  1989.
  8. [bib]Maxime Crochemore. Compression de textes: les méthodes. Université Paris-Nord. Rapport L.I.P.N. 88-4.  1988.
  9. [bib]Maxime Crochemore and Jean-Pierre Pécuchet. Compression de dictionnaires. Université Paris 7. Rapport L.A.D.L..  1987.
  10. [bib]Maxime Crochemore and Jean-Pierre Pécuchet. Réduction d'un lexique pour micro-ordinateur. Université Paris 7. Rapport L.A.D.L..  1987.
  11. [bib]Maxime Crochemore. Résultats de décidabilité pour les morphismes faiblement sans carré. Universités Paris 6-7. Rapport L.I.T.P. 82-38.  1982.
  12. [bib]Maxime Crochemore. Sur les ensembles inévitables. Universités Paris 6-7. Rapport L.I.T.P. 82-56.  1982.
  13. [bib]Alain Cardon and Maxime Crochemore. Deux applications du tri lexicographique. Université de Haute-Normandie. Rapport du Laboratoire d'Informatique 78-03.  1978.
  14. [bib]Alain Cardon and Maxime Crochemore. Minimisation d'automates et algorithme de Hopcroft. Université de Haute-Normandie. Rapport du Laboratoire d'Informatique 78-02.  1978.
Institut Gaspard-Monge, Laboratoire d'informatique, le 2 novembre 2008, Maxime Crochemore