| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Maxime Crochemore, Laura Giambruno, Alessio Langiu |
On-Line Construction of a Small Automaton for a Finite Set of Words.  |
Int. J. Found. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos |
Quasiperiodicities in Fibonacci strings |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
Efficient algorithms for three variants of the LPF table. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, German Tischler |
Computing Longest Previous non-overlapping Factors. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Lucian Ilie, Liviu Tinta |
The "runs" conjecture. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Dov M. Gabbay |
Reactive automata. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen |
Efficient Seeds Computation Revisited |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Golnaz Badkobeh, Maxime Crochemore |
Finite-Repetition threshold for infinite ternary words |
WORDS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Lila Kari, Mehryar Mohri, Dirk Nowotka |
Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081). |
Dagstuhl Reports |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marie-Pierre Béal, Maxime Crochemore, Bruce E. Moision, Paul H. Siegel |
Periodic-Finite-Type Shift Spaces. |
IEEE Transactions on Information Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Golnaz Badkobeh, Supaporn Chairungsee, Maxime Crochemore |
Hunting Redundancies in Strings. |
Developments in Language Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen |
Efficient Seeds Computation Revisited. |
CPM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis |
On the Right-Seed Array of a String. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Supaporn Chairungsee, Maxime Crochemore |
Building Phylogeny with Minimal Absent Words. |
CIAA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis |
Computing All Subtree Repeats in Ordered Ranked Trees. |
SPIRE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera |
Number of Occurrences of powers in Strings. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Ely Porat |
Fast computation of a longest increasing subsequence and application. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Marcin Kubica, Tomasz Walen, Costas S. Iliopoulos, M. Sohel Rahman |
Finding Patterns In Given Intervals. |
Fundam. Inform. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
On the maximal sum of exponents of runs in a string |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
On the Maximal Number of Cubic Runs in a String. |
LATA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
Algorithms for Three Versions of the Shortest Common Superstring Problem. |
CPM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler |
Cover Array String Reconstruction. |
CPM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis |
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches. |
Algorithms and Applications |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. |
SOFSEM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo |
Dictionary-Symbolwise Flexible Parsing. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
On the Maximal Sum of Exponents of Runsin a String. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, German Tischler |
The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching. |
SPIRE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
Extracting Powers and Periods in a String from Its Runs Structure. |
SPIRE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Lucian Ilie, Wojciech Rytter |
Repetitions in strings: Algorithms and combinatorics. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi |
From Nerode's congruence to suffix automata with mismatches. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
On the maximal number of highly periodic runs in a string |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Thierry Lecroq |
Trie. |
Encyclopedia of Database Systems |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Thierry Lecroq |
Suffix Tree. |
Encyclopedia of Database Systems |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien Clément, Maxime Crochemore, Giuseppina Rindone |
Reverse Engineering Prefix Tables. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Laura Giambruno |
On-line Construction of a Small Automaton for a Finite Set of Words. |
Stringology |
2009 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
LPF Computation Revisited. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
longest previous factor, Ziv-Lempel factorisation, detection of repetitions, suffix array, text compression |
| 1 | Maxime Crochemore, Lucian Ilie |
Computing Longest Previous Factor in linear time and applications. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Mohammad Sohel Rahman |
Optimal prefix and suffix queries on texts. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette |
Approximating the 2-interval pattern problem. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Wun-Tat Chan, Maxime Crochemore |
Foreword. |
Mathematics in Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kangho Roh, Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park |
External Memory Algorithms for String Problems. |
Fundam. Inform. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Lucian Ilie |
Understanding maximal repetitions in strings |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Lucian Ilie |
Maximal repetitions in strings. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Thierry Lecroq |
Sequential Multiple String Matching. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Wojciech Rytter |
Squares and Repetitions. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Thierry Lecroq |
Sequential Exact String Matching. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Thierry Lecroq |
Alignments and Approximate String Matching. |
New Developments in Formal Languages and Applications |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Ely Porat |
Computing a Longest Increasing Subsequence of Length k in Time O(n log log k). |
BCS Int. Acad. Conf. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen |
Improved Algorithms for the Range Next Value Problem and Applications. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Lucian Ilie |
Understanding Maximal Repetitions in Strings. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera |
Bounds on Powers in Strings. |
Developments in Language Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi |
On the Longest Common Factor Problem. |
IFIP TCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau |
Conservative String Covering of Indeterminate Strings. |
Stringology |
2008 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Lucian Ilie, Liviu Tinta |
Towards a Solution to the "Runs" Conjecture. |
CPM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Lucian Ilie, William F. Smyth |
A Simple Algorithm for Computing the Lempel Ziv Factorization. |
DCC |
2008 |
DBLP DOI BibTeX RDF |
longest common prefix, longest previous factor, Lempel-Ziv factorization, strings, suffix array, algorithms design, runs, repetitions |
| 1 | Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi |
The Structure of Factor Oracles. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot |
All maximal-pairs in step-leap representation of melodic sequence. |
Inf. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Christophe Hancart, Thierry Lecroq |
Algorithms on strings. |
|
2007 |
RDF |
|
| 1 | Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo |
Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. |
LATA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Lucian Ilie |
Analysis of Maximal Repetitions in Strings. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
repetitions in strings, maximal repetitions, maximal periodicities, sum of exponents, runs, Combinatorics on words |
| 1 | Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman |
Finding Patterns in Given Intervals. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi |
On the Suffix Automaton with Mismatches. |
CIAA |
2007 |
DBLP DOI BibTeX RDF |
suffix automata, languages with mismatches, approximate string matching, combinatorics on words |
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot |
Longest repeats with a block of k don't cares. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Thierry Lecroq |
Text Searching and Indexing. |
Recent Advances in Formal Languages and Applications |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi |
Factor Oracles. |
CIAA |
2006 |
DBLP DOI BibTeX RDF |
factor oracle, suffix trie, graph quotient, string matching, suffix tree |
| 1 | Maxime Crochemore, Jacques Désarménien, Dominique Perrin |
A note on the Burrows - CWheeler transformation. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Jacques Désarménien, Dominique Perrin |
A note on the Burrows-Wheeler transformation |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
Motifs basis, repeated motifs |
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon, Alejandro Salinger |
Bit-parallel (delta, gamma)-matching and suffix automata. |
J. Discrete Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ricardo A. Baeza-Yates, Maxime Crochemore |
Foreword. |
J. Discrete Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marie-Pierre Béal, Maxime Crochemore, Gabriele Fici |
Presentations of constrained systems with unconstrained positions. |
IEEE Transactions on Information Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette |
Approximating the 2-Interval Pattern Problem. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Apostolico, Maxime Crochemore, Kunsoo Park (eds.) |
Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings |
CPM |
2005 |
DBLP BibTeX RDF |
|
| 1 | Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps |
Two-dimensional pattern matching with rotations. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot |
Longest Repeats with a Block of Don't Cares. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
Repeat Extraction, Dont Care, Efficient Merging, Suffix Tree, String, Combinatorial Problems, Lowest Common Ancestor |
| 1 | Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi |
A Trie-Based Approach for Compacting Automata. |
CPM |
2004 |
DBLP DOI BibTeX RDF |
factor and suffix automata, suffix tree, index, text compression, Automata and formal languages |
| 1 | Maxime Crochemore, Raffaele Giancarlo, Marie-France Sagot |
Longest Motifs with a Functionally Equivalent Central Block. |
SPIRE |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Valery T. Stefanov |
Waiting time and complexity for matching patterns with automata. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore |
Reducing space for index implementation. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq |
Occurrence and Substring Heuristics for i-Matching. |
Fundam. Inform. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon |
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. |
Fundam. Inform. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino |
Computing forbidden words of regular languages. |
Fundam. Inform. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson |
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek |
Directed acyclic subsequence graph - Overview. |
J. Discrete Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Christophe Hancart, Thierry Lecroq |
A unifying look at the Apostolico-Giancarlo string-matching algorithm. |
J. Discrete Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ricardo A. Baeza-Yates, Edgar Chávez, Maxime Crochemore (eds.) |
Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings |
CPM |
2003 |
DBLP BibTeX RDF |
|
| 1 | Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps |
Two-Dimensional Pattern Matching with Rotations. |
CPM |
2003 |
DBLP DOI BibTeX RDF |
two-dimensional pattern matching, rotation, Design and analysis of algorithms |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzon |
Algorithms for Computing Approximate Repetitions in Musical Sequences. |
Int. J. Comput. Math. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, T. Tsichlas |
Approximate String Matching with Gaps. |
Nord. J. Comput. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Wojciech Rytter |
Jewels of stringology. |
|
2002 |
RDF |
|
| 1 | Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson |
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Gonzalo Navarro |
Improved Antidictionary Based Compression. |
SCCC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter |
Three Heuristics for delta-Matching: delta-BM Algorithms. |
CPM |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Holub, Maxime Crochemore |
On the Implementation of Compact DAWG's. |
CIAA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Zdenek Tronícek |
On the Size of DASG for Multiple Texts. |
SPIRE |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon |
Computing Evolutionary Chains in Musical Sequences. |
Electr. J. Comb. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot |
Efficient Experimental String Matching by Weak Factor Recognition. |
CPM |
2001 |
DBLP BibTeX RDF |
information retrieval, string matching, algorithm design, Finite automaton |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")