Maxime Crochemore

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Christophe Hancart

> Home > Persons > Maxime Crochemore

Publications

2007
[b3]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - books/daglib/0020103
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/daglib/0020103
Maxime Crochemore, Christophe Hancart, Thierry Lecroq:
Algorithms on strings. Cambridge University Press 2007, ISBN 978-0-521-84899-2, pp. I-VIII, 1-383
2003
[j43]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jda/CrochemoreHL03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/CrochemoreHL03
Maxime Crochemore, Christophe Hancart, Thierry Lecroq:
A unifying look at the Apostolico-Giancarlo string-matching algorithm. J. Discrete Algorithms 1(1): 37-52 (2003)
1999
[p4]
- view
  authority control:
- export record
  dblp key:
  - books/crc/99/CrochemoreH99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/crc/99/CrochemoreH99
Maxime Crochemore, Christophe Hancart:
Pattern Matching in Strings. Algorithms and Theory of Computation Handbook 1999
1997
[p1]
- view
  authority control:
- export record
  dblp key:
  - reference/hfl/CrochemoreH97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/reference/hfl/CrochemoreH97
Maxime Crochemore, Christophe Hancart:
Automata for Matching Patterns. Handbook of Formal Languages (2) 1997: 399-462

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.