| 2009 |
|---|
| 121 | EE | Julien Clément,
Maxime Crochemore,
Giuseppina Rindone:
Reverse Engineering Prefix Tables.
STACS 2009: 289-300 |
| 2008 |
|---|
| 120 | EE | Maxime Crochemore,
Lucian Ilie,
Liviu Tinta:
Towards a Solution to the "Runs" Conjecture.
CPM 2008: 290-302 |
| 119 | EE | Maxime Crochemore,
Lucian Ilie,
W. F. Smyth:
A Simple Algorithm for Computing the Lempel Ziv Factorization.
DCC 2008: 482-488 |
| 118 | EE | Maxime Crochemore,
Szilárd Zsolt Fazekas,
Costas S. Iliopoulos,
Inuka Jayasekera:
Bounds on Powers in Strings.
Developments in Language Theory 2008: 206-215 |
| 117 | EE | Maxime Crochemore,
Alessandra Gabriele,
Filippo Mignosi,
Mauriana Pesaresi:
On the Longest Common Factor Problem.
IFIP TCS 2008: 143-155 |
| 116 | EE | Maxime Crochemore,
Lucian Ilie:
Understanding Maximal Repetitions in Strings.
STACS 2008: 11-16 |
| 115 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Marcin Kubica,
Mohammad Sohel Rahman,
Tomasz Walen:
Improved Algorithms for the Range Next Value Problem and Applications.
STACS 2008: 205-216 |
| 114 | EE | Maxime Crochemore,
Thierry Lecroq:
Sequential Exact String Matching.
Encyclopedia of Algorithms 2008 |
| 113 | EE | Maxime Crochemore,
Thierry Lecroq:
Sequential Multiple String Matching.
Encyclopedia of Algorithms 2008 |
| 112 | EE | Maxime Crochemore,
Wojciech Rytter:
Squares and Repetitions.
Encyclopedia of Algorithms 2008 |
| 111 | EE | Maxime Crochemore,
Lucian Ilie:
Understanding maximal repetitions in strings
CoRR abs/0802.2829: (2008) |
| 110 | EE | Kangho Roh,
Maxime Crochemore,
Costas S. Iliopoulos,
Kunsoo Park:
External Memory Algorithms for String Problems.
Fundam. Inform. 84(1): 17-32 (2008) |
| 109 | EE | Maxime Crochemore,
Lucian Ilie:
Computing Longest Previous Factor in linear time and applications.
Inf. Process. Lett. 106(2): 75-80 (2008) |
| 108 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Mohammad Sohel Rahman:
Optimal prefix and suffix queries on texts.
Inf. Process. Lett. 108(5): 320-325 (2008) |
| 107 | EE | Maxime Crochemore,
Lucian Ilie:
Maximal repetitions in strings.
J. Comput. Syst. Sci. 74(5): 796-807 (2008) |
| 106 | EE | Joseph Wun-Tat Chan,
Maxime Crochemore:
Foreword.
Mathematics in Computer Science 1(4): 541-542 (2008) |
| 105 | EE | Maxime Crochemore,
Danny Hermelin,
Gad M. Landau,
Dror Rawitz,
Stéphane Vialette:
Approximating the 2-interval pattern problem.
Theor. Comput. Sci. 395(2-3): 283-297 (2008) |
| 2007 |
|---|
| 104 | EE | Maxime Crochemore,
Chiara Epifanio,
Alessandra Gabriele,
Filippo Mignosi:
On the Suffix Automaton with Mismatches.
CIAA 2007: 144-156 |
| 103 | EE | Maxime Crochemore,
Lucian Ilie:
Analysis of Maximal Repetitions in Strings.
MFCS 2007: 465-476 |
| 102 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
M. Sohel Rahman:
Finding Patterns in Given Intervals.
MFCS 2007: 645-656 |
| 101 | EE | Emilios Cambouropoulos,
Maxime Crochemore,
Costas S. Iliopoulos,
Manal Mohamed,
Marie-France Sagot:
All maximal-pairs in step-leap representation of melodic sequence.
Inf. Sci. 177(9): 1954-1962 (2007) |
| 100 | EE | Maxime Crochemore,
Lucian Ilie,
Emine Seid-Hilmi:
The Structure of Factor Oracles.
Int. J. Found. Comput. Sci. 18(4): 781-797 (2007) |
| 2006 |
|---|
| 99 | EE | Maxime Crochemore,
Lucian Ilie,
Emine Seid-Hilmi:
Factor Oracles.
CIAA 2006: 78-89 |
| 98 | EE | Maxime Crochemore,
Thierry Lecroq:
Text Searching and Indexing.
Recent Advances in Formal Languages and Applications 2006: 43-80 |
| 97 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Manal Mohamed,
Marie-France Sagot:
Longest repeats with a block of k don't cares.
Theor. Comput. Sci. 362(1-3): 248-254 (2006) |
| 2005 |
|---|
| 96 | | Alberto Apostolico,
Maxime Crochemore,
Kunsoo Park:
Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings
Springer 2005 |
| 95 | EE | Maxime Crochemore,
Danny Hermelin,
Gad M. Landau,
Stéphane Vialette:
Approximating the 2-Interval Pattern Problem.
ESA 2005: 426-437 |
| 94 | EE | Emilios Cambouropoulos,
Maxime Crochemore,
Costas S. Iliopoulos,
Manal Mohamed,
Marie-France Sagot:
A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories.
ISMIR 2005: 167-174 |
| 93 | EE | Maxime Crochemore,
Jacques Désarménien,
Dominique Perrin:
A note on the Burrows-Wheeler transformation
CoRR abs/cs/0502073: (2005) |
| 92 | EE | Marie-Pierre Béal,
Maxime Crochemore,
Gabriele Fici:
Presentations of constrained systems with unconstrained positions.
IEEE Transactions on Information Theory 51(5): 1891-1900 (2005) |
| 91 | EE | Nadia Pisanti,
Maxime Crochemore,
Roberto Grossi,
Marie-France Sagot:
Bases of Motifs for Generating Repeated Patterns with Wild Cards.
IEEE/ACM Trans. Comput. Biology Bioinform. 2(1): 40-50 (2005) |
| 90 | EE | Ricardo A. Baeza-Yates,
Maxime Crochemore:
Foreword.
J. Discrete Algorithms 3(2-4): 125 (2005) |
| 89 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Gonzalo Navarro,
Yoan J. Pinzon,
Alejandro Salinger:
Bit-parallel (delta, gamma)-matching and suffix automata.
J. Discrete Algorithms 3(2-4): 198-214 (2005) |
| 88 | EE | Maxime Crochemore,
Jacques Désarménien,
Dominique Perrin:
A note on the Burrows - CWheeler transformation.
Theor. Comput. Sci. 332(1-3): 567-572 (2005) |
| 2004 |
|---|
| 87 | EE | Maxime Crochemore,
Chiara Epifanio,
Roberto Grossi,
Filippo Mignosi:
A Trie-Based Approach for Compacting Automata.
CPM 2004: 145-158 |
| 86 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Manal Mohamed,
Marie-France Sagot:
Longest Repeats with a Block of Don't Cares.
LATIN 2004: 271-278 |
| 85 | EE | Maxime Crochemore,
Raffaele Giancarlo,
Marie-France Sagot:
Longest Motifs with a Functionally Equivalent Central Block.
SPIRE 2004: 298-209 |
| 84 | EE | Amihood Amir,
Ayelet Butman,
Maxime Crochemore,
Gad M. Landau,
Malka Schaps:
Two-dimensional pattern matching with rotations.
Theor. Comput. Sci. 314(1-2): 173-187 (2004) |
| 2003 |
|---|
| 83 | | Ricardo A. Baeza-Yates,
Edgar Chávez,
Maxime Crochemore:
Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings
Springer 2003 |
| 82 | EE | Amihood Amir,
Ayelet Butman,
Maxime Crochemore,
Gad M. Landau,
Malka Schaps:
Two-Dimensional Pattern Matching with Rotations.
CPM 2003: 17-31 |
| 81 | EE | Nadia Pisanti,
Maxime Crochemore,
Roberto Grossi,
Marie-France Sagot:
A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum.
MFCS 2003: 622-631 |
| 80 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Gonzalo Navarro,
Yoan J. Pinzon:
A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval.
SPIRE 2003: 211-223 |
| 79 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Thierry Lecroq:
Occurrence and Substring Heuristics for i-Matching.
Fundam. Inform. 56(1-2): 1-21 (2003) |
| 78 | EE | Marie-Pierre Béal,
Maxime Crochemore,
Filippo Mignosi:
Computing forbidden words of regular languages.
Fundam. Inform. 56(1-2): 121-135 (2003) |
| 77 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Yoan J. Pinzon:
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
Fundam. Inform. 56(1-2): 89-103 (2003) |
| 76 | EE | Maxime Crochemore,
Valery T. Stefanov:
Waiting time and complexity for matching patterns with automata.
Inf. Process. Lett. 87(3): 119-125 (2003) |
| 75 | EE | Maxime Crochemore,
Christophe Hancart,
Thierry Lecroq:
A unifying look at the Apostolico-Giancarlo string-matching algorithm.
J. Discrete Algorithms 1(1): 37-52 (2003) |
| 74 | EE | Maxime Crochemore,
Borivoj Melichar,
Zdenek Tronícek:
Directed acyclic subsequence graph - Overview.
J. Discrete Algorithms 1(3-4): 255-280 (2003) |
| 73 | EE | Maxime Crochemore,
Gad M. Landau,
Michal Ziv-Ukelson:
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices.
SIAM J. Comput. 32(6): 1654-1673 (2003) |
| 72 | | Maxime Crochemore:
Reducing space for index implementation.
Theor. Comput. Sci. 292(1): 185-197 (2003) |
| 2002 |
|---|
| 71 | EE | Jan Holub,
Maxime Crochemore:
On the Implementation of Compact DAWG's.
CIAA 2002: 289-294 |
| 70 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Thierry Lecroq,
Wojciech Plandowski,
Wojciech Rytter:
Three Heuristics for delta-Matching: delta-BM Algorithms.
CPM 2002: 178-189 |
| 69 | EE | Maxime Crochemore,
Gonzalo Navarro:
Improved Antidictionary Based Compression.
SCCC 2002: 7-13 |
| 68 | EE | Maxime Crochemore,
Gad M. Landau,
Michal Ziv-Ukelson:
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices.
SODA 2002: 679-688 |
| 67 | EE | Maxime Crochemore,
Zdenek Tronícek:
On the Size of DASG for Multiple Texts.
SPIRE 2002: 58-64 |
| 66 | EE | Emilios Cambouropoulos,
Maxime Crochemore,
Costas S. Iliopoulos,
Laurent Mouchard,
Yoan J. Pinzon:
Algorithms for Computing Approximate Repetitions in Musical Sequences.
Int. J. Comput. Math. 79(11): 1135-1148 (2002) |
| 65 | | Maxime Crochemore,
Costas S. Iliopoulos,
Christos Makris,
Wojciech Rytter,
Athanasios K. Tsakalidis,
T. Tsichlas:
Approximate String Matching with Gaps.
Nord. J. Comput. 9(1): 54-65 (2002) |
| 2001 |
|---|
| 64 | EE | Cyril Allauzen,
Maxime Crochemore,
Mathieu Raffinot:
Efficient Experimental String Matching by Weak Factor Recognition.
CPM 2001: 51-72 |
| 63 | | Maxime Crochemore,
Costas S. Iliopoulos,
Yoan J. Pinzon:
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
SPIRE 2001: 59-67 |
| 62 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Yoan J. Pinzon:
Computing Evolutionary Chains in Musical Sequences.
Electr. J. Comb. 8(2): (2001) |
| 2000 |
|---|
| 61 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Yoan J. Pinzon:
Finding Motifs with Gaps.
ISMIR 2000 |
| 60 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Yoan J. Pinzon:
Fast Evolutionary Chains.
SOFSEM 2000: 307-318 |
| 1999 |
|---|
| 59 | | Maxime Crochemore,
Mike Paterson:
Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings
Springer 1999 |
| 58 | EE | Maxime Crochemore,
Filippo Mignosi,
Antonio Restivo,
Sergio Salemi:
Text Compression Using Antidictionaries.
ICALP 1999: 261-270 |
| 57 | EE | Cyril Allauzen,
Maxime Crochemore,
Mathieu Raffinot:
Factor Oracle: A New Structure for Pattern Matching.
SOFSEM 1999: 295-310 |
| 56 | EE | Maxime Crochemore,
Renaud Vérin:
Zones of Low Entropy in Genomic Sequences.
Computers & Chemistry 23(3-4): 275-282 (1999) |
| 55 | EE | Maxime Crochemore,
Artur Czumaj,
Leszek Gasieniec,
Thierry Lecroq,
Wojciech Plandowski,
Wojciech Rytter:
Fast Practical Multi-Pattern Matching.
Inf. Process. Lett. 71(3-4): 107-113 (1999) |
| 54 | EE | Maxime Crochemore,
Leszek Gasieniec,
Wojciech Rytter:
Constant-Space String-Matching in Sublinear Average Time.
Theor. Comput. Sci. 218(1): 197-203 (1999) |
| 1998 |
|---|
| 53 | EE | Maxime Crochemore,
Filippo Mignosi,
Antonio Restivo:
Minimal Forbidden Words and Factor Automata.
MFCS 1998: 665-673 |
| 52 | | Maxime Crochemore,
Costas S. Iliopoulos,
Maureen Korda:
Two-Dimensional Prefix String Matching and Covering on Square Matrices.
Algorithmica 20(4): 353-373 (1998) |
| 51 | EE | Maxime Crochemore,
Filippo Mignosi,
Antonio Restivo:
Automata and Forbidden Words.
Inf. Process. Lett. 67(3): 111-117 (1998) |
| 50 | | Maxime Crochemore,
Leszek Gasieniec,
Ramesh Hariharan,
S. Muthukrishnan,
Wojciech Rytter:
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching.
SIAM J. Comput. 27(3): 668-681 (1998) |
| 1997 |
|---|
| 49 | | Maxime Crochemore,
Renaud Vérin:
Direct Construction of Compact Directed Acyclic Word Graphs.
CPM 1997: 116-129 |
| 48 | | Maxime Crochemore,
Renaud Vérin:
On Compact Directed Acyclic Word Graphs.
Structures in Logic and Computer Science 1997: 192-211 |
| 47 | | Maxime Crochemore,
Thierry Lecroq:
Pattern Matching and Text Compression Algorithms.
The Computer Science and Engineering Handbook 1997: 161-202 |
| 46 | EE | Maxime Crochemore,
Thierry Lecroq:
Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm.
Inf. Process. Lett. 63(4): 195-203 (1997) |
| 45 | | Maxime Crochemore,
Zvi Galil,
Leszek Gasieniec,
Kunsoo Park,
Wojciech Rytter:
Constant-Time Randomized Parallel String Matching.
SIAM J. Comput. 26(4): 950-960 (1997) |
| 1996 |
|---|
| 44 | | Nadia El-Mabrouk,
Maxime Crochemore:
Boyer-Moore Strategy to Efficient Approximate String Matching.
CPM 1996: 24-38 |
| 43 | | Maxime Crochemore,
Thierry Lecroq:
Pattern-Matching and Text-Compression Algorithms.
ACM Comput. Surv. 28(1): 39-41 (1996) |
| 1995 |
|---|
| 42 | | Maxime Crochemore,
Wojciech Rytter:
On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching.
LATIN 1995: 220-229 |
| 41 | | Maxime Crochemore,
Leszek Gasieniec,
Wojciech Plandowski,
Wojciech Rytter:
Two-Dimensional Pattern Matching in Linear Time and Small Space.
STACS 1995: 181-192 |
| 40 | | Maxime Crochemore,
Wojciech Rytter:
Sqares, Cubes, and Time-Space Efficient String Searching.
Algorithmica 13(5): 405-425 (1995) |
| 39 | | Alberto Apostolico,
Maxime Crochemore:
Fast Parallel Lyndon Factorization with Applications.
Mathematical Systems Theory 28(2): 89-108 (1995) |
| 1994 |
|---|
| 38 | | Maxime Crochemore,
Wojciech Rytter:
Text Algorithms
Oxford University Press 1994 |
| 37 | | Maxime Crochemore,
Dan Gusfield:
Combinatorial Pattern Matching, 5th Annual Symposium, CPM 94, Asilomar, California, USA, June 5-8, 1994, Proceedings
Springer 1994 |
| 36 | | Maxime Crochemore,
Artur Czumaj,
Leszek Gasieniec,
Stefan Jarominek,
Thierry Lecroq,
Wojciech Plandowski,
Wojciech Rytter:
Speeding Up Two String-Matching Algorithms.
Algorithmica 12(4/5): 247-267 (1994) |
| 35 | | Maxime Crochemore,
Wojciech Rytter:
On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms.
Theor. Comput. Sci. 132(2): 403-414 (1994) |
| 1993 |
|---|
| 34 | | Alberto Apostolico,
Maxime Crochemore,
Zvi Galil,
Udi Manber:
Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings
Springer 1993 |
| 33 | | Richard Cole,
Maxime Crochemore,
Zvi Galil,
Leszek Gasieniec,
Ramesh Hariharan,
S. Muthukrishnan,
Kunsoo Park,
Wojciech Rytter:
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
FOCS 1993: 248-258 |
| 32 | | Maxime Crochemore,
Leszek Gasieniec,
Wojciech Rytter:
Two-Dimensional Pattern Matching by Sampling.
Inf. Process. Lett. 46(4): 159-162 (1993) |
| 1992 |
|---|
| 31 | | Alberto Apostolico,
Maxime Crochemore,
Zvi Galil,
Udi Manber:
Combinatorial Pattern Matching, Third Annual Symposium, CPM 92, Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings
Springer 1992 |
| 30 | | Maxime Crochemore,
Wojciech Rytter:
Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms.
ICPIA 1992: 100-112 |
| 29 | | Maxime Crochemore,
Thierry Lecroq,
Artur Czumaj,
Leszek Gasieniec,
Stefan Jarominek,
Wojciech Plandowski,
Wojciech Rytter:
Speeding Up Two String-Matching Algorithms.
STACS 1992: 589-600 |
| 28 | | Jean Neraud,
Maxime Crochemore:
A String-Matching Interpretation of the Equation xmyn = zp.
Theor. Comput. Sci. 92(1): 145-164 (1992) |
| 27 | | Maxime Crochemore:
String-Matching on Ordered Alphabets.
Theor. Comput. Sci. 92(1): 33-47 (1992) |
| 1991 |
|---|
| 26 | | Alberto Apostolico,
Maxime Crochemore:
Optimal Canonization of All Substrings of a String
Inf. Comput. 95(1): 76-95 (1991) |
| 25 | | Maxime Crochemore,
Wojciech Rytter:
Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings.
Inf. Process. Lett. 38(2): 57-60 (1991) |
| 24 | EE | Maxime Crochemore,
Dominique Perrin:
Two-Way String Matching.
J. ACM 38(3): 651-675 (1991) |
| 23 | | Michal Chytil,
Maxime Crochemore,
Burkhard Monien,
Wojciech Rytter:
On the Parallel Recognition of Unambiguous Context-Free Languages.
Theor. Comput. Sci. 81(2): 311-316 (1991) |
| 22 | | Maxime Crochemore,
Wojciech Rytter:
Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays.
Theor. Comput. Sci. 88(1): 59-82 (1991) |
| 1990 |
|---|
| 21 | | Maxime Crochemore,
Jean Neraud:
Unitary Monoid with Two Generators: An Algorithmic Point of View.
CAAP 1990: 117-131 |
| 20 | | Maxime Crochemore,
Wojciech Rytter:
Parallel Construction of Minimal Suffix and Factor Automata.
MFCS 1990: 217-223 |
| 19 | | Maxime Crochemore,
Wojciech Rytter:
Parallel Computations on Strings and Arrays.
STACS 1990: 109-125 |
| 18 | | Maxime Crochemore,
Wojciech Rytter:
Parallel Construction of Minimal Suffix and Factor Automata.
Inf. Process. Lett. 35(3): 121-128 (1990) |
| 1989 |
|---|
| 17 | | Maxime Crochemore:
String-matching and periods.
Bulletin of the EATCS 39: 149-153 (1989) |
| 16 | EE | Jean Berstel,
Maxime Crochemore,
Jean-Eric Pin:
Thue-Morse sequence and p-adic topology for the free monoid.
Discrete Mathematics 76(2): 89-94 (1989) |
| 1988 |
|---|
| 15 | | Maxime Crochemore:
Constant-Space String-Matching.
FSTTCS 1988: 80-87 |
| 14 | | Maxime Crochemore:
Algorithms and automata.
Formal Properties of Finite Automata and Applications 1988: 166-175 |
| 13 | | Maxime Crochemore:
String Matching with Constraints.
MFCS 1988: 44-58 |
| 12 | | Maxime Crochemore,
Dominique Perrin:
Critical factorizations of words.
Bulletin of the EATCS 34: 47-51 (1988) |
| 1987 |
|---|
| 11 | | Maxime Crochemore:
Data Compression with Substitution.
Electronic Dictionaries and Automata in Computational Linguistics 1987: 1-16 |
| 10 | | Maxime Crochemore:
Longest Common Factor of Two Words.
TAPSOFT, Vol.1 1987: 26-36 |
| 1986 |
|---|
| 9 | | Maxime Crochemore:
Computing LCF in linear time.
Bulletin of the EATCS 30: 57-60 (1986) |
| 8 | | Jean-Jacques Hébrard,
Maxime Crochemore:
Calcul de La Distance Par Les Sous-Mots.
ITA 20(4): 441-456 (1986) |
| 7 | | Maxime Crochemore:
Transducers and Repetitions.
Theor. Comput. Sci. 45(1): 63-86 (1986) |
| 1984 |
|---|
| 6 | | Maxime Crochemore:
Linear Searching for a Squre in a Word (Abstract).
ICALP 1984: 137 |
| 1983 |
|---|
| 5 | | Maxime Crochemore,
Michael Le Rest,
Philippe Wender:
An Optimal Test on Finite Unavoidable Sets of Words.
Inf. Process. Lett. 16(4): 179-180 (1983) |
| 1982 |
|---|
| 4 | | Maxime Crochemore:
Sharp Characterizations of Squarefree Morphisms.
Theor. Comput. Sci. 18: 221-226 (1982) |
| 3 | | A. Cardon,
Maxime Crochemore:
Partitioning a Graph in O(|A| log2 |V|).
Theor. Comput. Sci. 19: 85-98 (1982) |
| 1981 |
|---|
| 2 | | Maxime Crochemore:
An Optimal Algorithm for Computing the Repetitions in a Word.
Inf. Process. Lett. 12(5): 244-250 (1981) |
| 1980 |
|---|
| 1 | | A. Cardon,
Maxime Crochemore:
Détermination de la Représentation Standard d'une Série Reconnaissable.
ITA 14(4): 371-379 (1980) |
