Maxime Crochemore
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
73
Venues
21
Active years
1984–2023
Best venue rank
A*
Where they publish
Papers
73 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2023 | DLT | Fast Detection of Specific Fragments Against a Set of Sequences. | Marie-Pierre Bal, Maxime Crochemore |
| 2022 | CPM | Back-To-Front Online Lyndon Forest Construction. | Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud |
| 2022 | CPM | Linear-Time Computation of Shortest Covers of All Rotations of a String. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | SPIRE | Internal Quasiperiod Queries. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | WALCOM | Shortest Covers of All Cyclic Shifts of a String. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | CPM | Quasi-Linear-Time Algorithm for Longest Common Circular Factor. | Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2018 | CPM | Linear-Time Algorithm for Long LCF with k Mismatches. | Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2018 | SPIRE | On Extended Special Factors of a Word. | Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis |
| 2017 | COCOA | Longest Previous Non-overlapping Factors Table Computation. | Supaporn Chairungsee, Maxime Crochemore |
| 2017 | COCOON | Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. | Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2017 | FCT | Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching. | Maxime Crochemore, Alice Hliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat |
| 2017 | WABI | Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time. | Maxime Crochemore, Alexandre P. Francisco, Solon P. Pissis, Ctia Vaz |
| 2016 | LATA | Optimal Bounds for Computing \alpha α -gapped Repeats. | Maxime Crochemore, Roman Kolpakov, Gregory Kucherov |
| 2016 | LATIN | Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. | Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis |
| 2016 | SPIRE | Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | ISAAC | Covering Problems for Partial Words and for Indeterminate Strings. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2013 | CPM | Locating All Maximal Approximate Runs in a String. | Mika Amit, Maxime Crochemore, Gad M. Landau |
| 2013 | CPM | Forty Years of Text Indexing. | Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan |
| 2013 | CPM | A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. | Maxime Crochemore, Roberto Grossi, Juha Krkkinen, Gad M. Landau |
| 2013 | DCC | The Rightmost Equal-Cost Position Problem. | Maxime Crochemore, Alessio Langiu, Filippo Mignosi |
| 2013 | IWOCA | Suffix Tree of Alignment: An Efficient Index for Similar Data. | Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park |
| 2013 | SPIRE | Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2012 | CPM | The Maximum Number of Squares in a Tree. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen |
| 2012 | SPIRE | Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time. | Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan |
| 2011 | COCOON | On the Right-Seed Array of a String. | Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis |
| 2011 | CPM | Efficient Seeds Computation Revisited. | Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen |
| 2011 | DLT | Hunting Redundancies in Strings. | Golnaz Badkobeh, Supaporn Chairungsee, Maxime Crochemore |
| 2011 | SPIRE | Computing All Subtree Repeats in Ordered Ranked Trees. | Michalis Christou, Maxime Crochemore, Toms Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis |
| 2010 | CPM | Algorithms for Three Versions of the Shortest Common Superstring Problem. | Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | CPM | Cover Array String Reconstruction. | Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler |
| 2010 | IWOCA | Dictionary-Symbolwise Flexible Parsing. | Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo |
| 2010 | IWOCA | On the Maximal Sum of Exponents of Runsin a String. | Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | LATA | On the Maximal Number of Cubic Runs in a String. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | SOFSEM | Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
| 2010 | SPIRE | Extracting Powers and Periods in a String from Its Runs Structure. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | SPIRE | The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching. | Maxime Crochemore, German Tischler |
| 2009 | IWOCA | LPF Computation Revisited. | Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
| 2009 | STACS | Reverse Engineering Prefix Tables. | Julien Clment, Maxime Crochemore, Giuseppina Rindone |
| 2008 | CPM | Towards a Solution to the "Runs" Conjecture. | Maxime Crochemore, Lucian Ilie, Liviu Tinta |
| 2008 | DCC | A Simple Algorithm for Computing the Lempel Ziv Factorization. | Maxime Crochemore, Lucian Ilie, William F. Smyth |
| 2008 | DLT | Bounds on Powers in Strings. | Maxime Crochemore, Szilrd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera |
| 2008 | STACS | Understanding Maximal Repetitions in Strings. | Maxime Crochemore, Lucian Ilie |
| 2008 | STACS | Improved Algorithms for the Range Next Value Problem and Applications. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen |
| 2007 | ISIT | Minimizing local automata. | Marie-Pierre Bal, Maxime Crochemore |
| 2007 | LATA | Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. | Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo |
| 2007 | MFCS | Analysis of Maximal Repetitions in Strings. | Maxime Crochemore, Lucian Ilie |
| 2007 | MFCS | Finding Patterns in Given Intervals. | Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman |
| 2005 | ESA | Approximating the 2-Interval Pattern Problem. | Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stphane Vialette |
| 2004 | CPM | A Trie-Based Approach for Compacting Automata. | Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi |
| 2004 | LATIN | Longest Repeats with a Block of Don't Cares. | Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot |
| 2004 | SPIRE | Longest Motifs with a Functionally Equivalent Central Block. | Maxime Crochemore, Raffaele Giancarlo, Marie-France Sagot |
| 2003 | CPM | Two-Dimensional Pattern Matching with Rotations. | Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps |
| 2003 | MFCS | A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. | Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot |
| 2003 | SPIRE | A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. | Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzn |
| 2002 | CPM | Three Heuristics for delta-Matching: delta-BM Algorithms. | Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter |
| 2002 | SODA | A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. | Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson |
| 2002 | SPIRE | On the Size of DASG for Multiple Texts. | Maxime Crochemore, Zdenek Troncek |
| 2001 | CPM | Efficient Experimental String Matching by Weak Factor Recognition. | Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot |
| 2001 | SPIRE | Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. | Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzn |
| 2000 | SOFSEM | Fast Evolutionary Chains. | Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzn |
| 1999 | ICALP | Text Compression Using Antidictionaries. | Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi |
| 1999 | SOFSEM | Factor Oracle: A New Structure for Pattern Matching. | Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot |
| 1998 | MFCS | Minimal Forbidden Words and Factor Automata. | Maxime Crochemore, Filippo Mignosi, Antonio Restivo |
| 1997 | CPM | Direct Construction of Compact Directed Acyclic Word Graphs. | Maxime Crochemore, Renaud Vrin |
| 1996 | CPM | Boyer-Moore Strategy to Efficient Approximate String Matching. | Nadia El-Mabrouk, Maxime Crochemore |
| 1995 | LATIN | On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. | Maxime Crochemore, Wojciech Rytter |
| 1995 | STACS | Two-Dimensional Pattern Matching in Linear Time and Small Space. | Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter |
| 1993 | FOCS | Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions | Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter |
| 1992 | STACS | Speeding Up Two String-Matching Algorithms. | Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter |
| 1990 | MFCS | Parallel Construction of Minimal Suffix and Factor Automata. | Maxime Crochemore, Wojciech Rytter |
| 1990 | STACS | Parallel Computations on Strings and Arrays. | Maxime Crochemore, Wojciech Rytter |
| 1988 | MFCS | String Matching with Constraints. | Maxime Crochemore |
| 1984 | ICALP | Linear Searching for a Squre in a Word (Abstract). | Maxime Crochemore |