default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaxime Crochemore
Person information
- affiliation: King's College London, UK
- affiliation: University Paris-Est Marne-la-Vallée, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c104]Marie-Pierre Béal
, Maxime Crochemore:
Fast Detection of Specific Fragments Against a Set of Sequences. DLT 2023: 51-60- 2022
- [j123]Golnaz Badkobeh, Maxime Crochemore:
Linear construction of a left Lyndon tree. Inf. Comput. 285(Part): 104884 (2022) - [j122]Marie-Pierre Béal, Maxime Crochemore:
Checking whether a word is Hamming-isometric in linear time. Theor. Comput. Sci. 933: 55-59 (2022) - [c103]Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud:
Back-To-Front Online Lyndon Forest Construction. CPM 2022: 13:1-13:23 - [c102]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Linear-Time Computation of Shortest Covers of All Rotations of a String. CPM 2022: 22:1-22:15 - [i30]Marie-Pierre Béal, Maxime Crochemore:
Fast detection of specific fragments against a set of sequences. CoRR abs/2208.03451 (2022) - 2021
- [j121]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Shortest covers of all cyclic shifts of a string. Theor. Comput. Sci. 866: 70-81 (2021) - [i29]Marie-Pierre Béal, Maxime Crochemore:
Checking whether a word is Hamming-isometric in linear time. CoRR abs/2106.10541 (2021) - 2020
- [j120]Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat:
Absent words in a sliding window with applications. Inf. Comput. 270 (2020) - [j119]Maxime Crochemore, Luís M. S. Russo:
Cartesian and Lyndon trees. Theor. Comput. Sci. 806: 1-9 (2020) - [c101]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Internal Quasiperiod Queries. SPIRE 2020: 60-75 - [c100]Golnaz Badkobeh, Maxime Crochemore:
Left Lyndon Tree Construction. Stringology 2020: 84-95 - [c99]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Shortest Covers of All Cyclic Shifts of a String. WALCOM 2020: 69-80 - [i28]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Internal Quasiperiod Queries. CoRR abs/2007.13471 (2020) - [i27]Golnaz Badkobeh, Maxime Crochemore:
Left Lyndon tree construction. CoRR abs/2011.12742 (2020)
2010 – 2019
- 2019
- [j118]Maxime Crochemore, Roman Kolpakov, Gregory Kucherov:
Optimal bounds for computing α-gapped repeats. Inf. Comput. 268 (2019) - [j117]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. 37(2): 501-522 (2019) - [j116]Maxime Crochemore, Jakub Radoszewski:
Special issue in honor of the 70th birthday of Prof. Wojciech Rytter. Theor. Comput. Sci. 792: 1 (2019) - [c98]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM 2019: 25:1-25:14 - [c97]Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto:
k-Abelian Pattern Matching: Revisited, Corrected, and Extended. Stringology 2019: 29-40 - [i26]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CoRR abs/1901.11305 (2019) - 2018
- [j115]João A. Carriço, Maxime Crochemore, Alexandre P. Francisco, Solon P. Pissis, Bruno Ribeiro-Gonçalves, Cátia Vaz:
Fast phylogenetic inference from typing data. Algorithms Mol. Biol. 13(1): 4:1-4:14 (2018) - [j114]Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis:
Preface. Fundam. Informaticae 163(3): i (2018) - [j113]Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Alignment-free sequence comparison using absent words. Inf. Comput. 262: 57-68 (2018) - [j112]Maxime Crochemore, Solon P. Pissis:
Advances in Algorithms & Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos). Theor. Comput. Sci. 710: 1 (2018) - [c96]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Algorithm for Long LCF with k Mismatches. CPM 2018: 23:1-23:16 - [c95]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) 2018: 168-178 - [c94]Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis:
On Extended Special Factors of a Word. SPIRE 2018: 131-138 - [r11]Maxime Crochemore, Thierry Lecroq:
Suffix Tree. Encyclopedia of Database Systems (2nd ed.) 2018 - [r10]Maxime Crochemore, Thierry Lecroq:
Trie. Encyclopedia of Database Systems (2nd ed.) 2018 - [i25]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Algorithm for Long LCF with k Mismatches. CoRR abs/1802.06369 (2018) - [i24]Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Alignment-free sequence comparison using absent words. CoRR abs/1806.02718 (2018) - 2017
- [j111]Maxime Crochemore, Costas S. Iliopoulos, Alessio Langiu, Filippo Mignosi:
The longest common substring problem. Math. Struct. Comput. Sci. 27(2): 277-295 (2017) - [j110]Golnaz Badkobeh, Maxime Crochemore, Robert Mercas:
Counting maximal-exponent factors in words. Theor. Comput. Sci. 658: 27-35 (2017) - [j109]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. 698: 25-39 (2017) - [j108]Mika Amit, Maxime Crochemore, Gad M. Landau, Dina Sokol:
Locating maximal approximate runs in a string. Theor. Comput. Sci. 700: 45-62 (2017) - [c93]Supaporn Chairungsee, Maxime Crochemore:
Longest Previous Non-overlapping Factors Table Computation. COCOA (2) 2017: 483-491 - [c92]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON 2017: 99-111 - [c91]Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat:
Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching. FCT 2017: 164-176 - [c90]Maxime Crochemore, Alexandre P. Francisco, Solon P. Pissis, Cátia Vaz:
Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time. WABI 2017: 9:1-9:14 - [i23]Maxime Crochemore, Luís M. S. Russo:
Cartesian trees and Lyndon trees. CoRR abs/1712.08749 (2017) - 2016
- [j107]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Quasiperiodicities in Fibonacci strings. Ars Comb. 129: 211-225 (2016) - [j106]Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan:
40 years of suffix trees. Commun. ACM 59(4): 66-73 (2016) - [j105]Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani:
Linear algorithm for conservative degenerate pattern matching. Eng. Appl. Artif. Intell. 51: 109-114 (2016) - [j104]Golnaz Badkobeh, Maxime Crochemore:
Computing maximal-exponent factors in an overlap-free word. J. Comput. Syst. Sci. 82(3): 477-487 (2016) - [j103]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-preserving indexing. Theor. Comput. Sci. 638: 122-135 (2016) - [j102]Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi:
Linear-size suffix tries. Theor. Comput. Sci. 638: 171-178 (2016) - [j101]Maxime Crochemore, Robert Mercas:
On the density of Lyndon roots in factors. Theor. Comput. Sci. 656: 234-240 (2016) - [j100]Golnaz Badkobeh, Maxime Crochemore, Manal Mohamed, Chalita Toopsuwan:
Efficient computation of maximal anti-exponent in palindrome-free strings. Theor. Comput. Sci. 656: 241-248 (2016) - [c89]Maxime Crochemore, Roman Kolpakov, Gregory Kucherov:
Optimal Bounds for Computing \alpha α -gapped Repeats. LATA 2016: 245-255 - [c88]Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. LATIN 2016: 334-346 - [c87]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE 2016: 22-34 - [r9]Maxime Crochemore, Thierry Lecroq:
Multiple String Matching. Encyclopedia of Algorithms 2016: 1378-1382 - [r8]Maxime Crochemore, Wojciech Rytter:
Squares and Repetitions. Encyclopedia of Algorithms 2016: 2056-2060 - [r7]Maxime Crochemore, Thierry Lecroq:
String Matching. Encyclopedia of Algorithms 2016: 2113-2117 - [i22]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR abs/1606.08275 (2016) - 2015
- [j99]Golnaz Badkobeh, Maxime Crochemore:
Infinite binary words containing repetitions of odd period. Inf. Process. Lett. 115(5): 543-547 (2015) - [j98]Maxime Crochemore, Jacqueline W. Daykin, Zsuzsanna Lipták:
StringMasters 2012 & 2013 special issue - volume 2. J. Discrete Algorithms 32: 1-2 (2015) - [j97]Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau:
Computing the Burrows-Wheeler transform in place and in small space. J. Discrete Algorithms 32: 44-52 (2015) - [j96]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms 34: 49-53 (2015) - [i21]Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani:
Linear Algorithm for Conservative Degenerate Pattern Matching. CoRR abs/1506.04559 (2015) - [i20]Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. CoRR abs/1506.04917 (2015) - [i19]Maxime Crochemore, Roman Kolpakov, Gregory Kucherov:
Optimal searching of gapped repeats in a word. CoRR abs/1509.01221 (2015) - 2014
- [j95]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen:
New simple efficient algorithms computing powers and runs in strings. Discret. Appl. Math. 163: 258-267 (2014) - [j94]Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Abelian borders in binary words. Discret. Appl. Math. 171: 141-146 (2014) - [j93]Golnaz Badkobeh, Maxime Crochemore, Michaël Rao:
Finite repetition threshold for large alphabets. RAIRO Theor. Informatics Appl. 48(4): 419-430 (2014) - [j92]Maxime Crochemore, Jacqueline W. Daykin, Zsuzsanna Lipták:
StringMasters 2012 & 2013 special issue - volume 1. J. Discrete Algorithms 28: 1 (2014) - [j91]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. 521: 29-41 (2014) - [j90]Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
On the average number of regularities in a word. Theor. Comput. Sci. 525: 3-9 (2014) - [j89]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
Note on the greedy parsing optimality for dictionary-based text compression. Theor. Comput. Sci. 525: 55-59 (2014) - [c86]Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan:
Maximal anti-exponent of gapped palindromes. DICTAP 2014: 205-210 - [c85]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering Problems for Partial Words and for Indeterminate Strings. ISAAC 2014: 220-232 - [p7]Maxime Crochemore, Thierry Lecroq:
Pattern Matching and Text Compression Algorithms. Computing Handbook, 3rd ed. (1) 2014: 15: 1-57 - [e7]Edleno Silva de Moura, Maxime Crochemore:
String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings. Lecture Notes in Computer Science 8799, Springer 2014, ISBN 978-3-319-11917-5 [contents] - [i18]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering Problems for Partial Words and for Indeterminate Strings. CoRR abs/1412.3696 (2014) - [i17]Maxime Crochemore, Robert Mercas:
Fewer runs than word length. CoRR abs/1412.4646 (2014) - [i16]Maxime Crochemore, James D. Currie, Gregory Kucherov, Dirk Nowotka:
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111). Dagstuhl Reports 4(3): 28-46 (2014) - 2013
- [j88]Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Overlapping factors in words. Australas. J Comb. 57: 49-64 (2013) - [j87]Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Computing the Longest Previous Factor. Eur. J. Comb. 34(1): 15-26 (2013) - [j86]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. 113(3): 74-77 (2013) - [j85]Maxime Crochemore, Jacqueline W. Daykin:
StringMasters 2011 Special Issue. J. Discrete Algorithms 20: 1-2 (2013) - [j84]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient seed computation revisited. Theor. Comput. Sci. 483: 171-181 (2013) - [c84]Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan:
Forty Years of Text Indexing. CPM 2013: 1-10 - [c83]Mika Amit, Maxime Crochemore, Gad M. Landau:
Locating All Maximal Approximate Runs in a String. CPM 2013: 13-27 - [c82]Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau:
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. CPM 2013: 74-82 - [c81]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
The Rightmost Equal-Cost Position Problem. DCC 2013: 421-430 - [c80]Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. IWOCA 2013: 337-348 - [c79]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE 2013: 84-95 - [i15]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Suffix Trees and Their Algorithmic Applications. CoRR abs/1303.6872 (2013) - [i14]Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. CoRR abs/1305.1744 (2013) - [i13]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A Note on the Longest Common Compatible Prefix Problem for Partial Words. CoRR abs/1312.2381 (2013) - 2012
- [j83]Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Evguenia Kopylova, William F. Smyth, German Tischler, Munina Yusufu:
A comparison of index-based lempel-Ziv LZ77 factorization algorithms. ACM Comput. Surv. 45(1): 5:1-5:17 (2012) - [j82]Maxime Crochemore, Laura Giambruno, Alessio Langiu:
On-Line Construction of a Small Automaton for a Finite Set of Words. Int. J. Found. Comput. Sci. 23(2): 281-301 (2012) - [j81]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems. Int. J. Found. Comput. Sci. 23(6): 1371-1384 (2012) - [j80]Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Computing all subtree repeats in ordered trees. Inf. Process. Lett. 112(24): 958-962 (2012) - [j79]Golnaz Badkobeh, Maxime Crochemore:
Fewest repetitions in infinite binary words. RAIRO Theor. Informatics Appl. 46(1): 17-31 (2012) - [j78]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
The maximal number of cubic runs in a word. J. Comput. Syst. Sci. 78(6): 1828-1836 (2012) - [j77]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Efficient algorithms for three variants of the LPF table. J. Discrete Algorithms 11: 51-61 (2012) - [j76]Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal sum of exponents of runs in a string. J. Discrete Algorithms 14: 29-36 (2012) - [j75]Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo:
Dictionary-symbolwise flexible parsing. J. Discrete Algorithms 14: 74-90 (2012) - [j74]Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis:
On left and right seeds of a string. J. Discrete Algorithms 17: 31-44 (2012) - [j73]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler, Tomasz Walen:
Improved algorithms for the range next value problem and applications. Theor. Comput. Sci. 434: 23-34 (2012) - [j72]Supaporn Chairungsee, Maxime Crochemore:
Using minimal absent words to build phylogeny. Theor. Comput. Sci. 450: 109-116 (2012) - [c78]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
The Maximum Number of Squares in a Tree. CPM 2012: 27-40 - [c77]Ali Alatabbi, Maxime Crochemore, Costas S. Iliopoulos, Tewogboye A. Okanlawon:
Overlapping repetitions in weighted sequence. CUBE 2012: 435-440 - [c76]Ali Alatabbi, Maxime Crochemore, Jacqueline W. Daykin, Laurent Mouchard:
Lyndon fountains and the Burrows-Wheeler transform. CUBE 2012: 441-446 - [c75]Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan:
Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time. SPIRE 2012: 61-72 - [i12]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Quasiperiodicities in Fibonacci strings. CoRR abs/1201.6162 (2012) - [i11]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Identifying all abelian periods of a string in quadratic time and relevant problems. CoRR abs/1207.1307 (2012) - [i10]Golnaz Badkobeh, Maxime Crochemore:
Fewest repetitions in infinite binary words. CoRR abs/1207.5723 (2012) - [i9]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A Note on Efficient Computation of All Abelian Periods in a String. CoRR abs/1208.3313 (2012) - [i8]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
The Rightmost Equal-Cost Position Problem. CoRR abs/1211.5108 (2012) - [i7]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression. CoRR abs/1211.5350 (2012) - 2011
- [j71]Maxime Crochemore, Dov M. Gabbay:
Reactive automata. Inf. Comput. 209(4): 692-704 (2011) - [j70]Maxime Crochemore, German Tischler:
Computing Longest Previous non-overlapping Factors. Inf. Process. Lett. 111(6): 291-295 (2011) - [j69]Maxime Crochemore, Lucian Ilie, Liviu Tinta:
The "runs" conjecture. Theor. Comput. Sci. 412(27): 2931-2941 (2011) - [j68]Marie-Pierre Béal, Maxime Crochemore, Bruce E. Moision, Paul H. Siegel:
Periodic-Finite-Type Shift Spaces. IEEE Trans. Inf. Theory 57(6): 3677-3691 (2011) - [c74]Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis:
On the Right-Seed Array of a String. COCOON 2011: 492-502 - [c73]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: 350-363 - [c72]Golnaz Badkobeh, Supaporn Chairungsee, Maxime Crochemore:
Hunting Redundancies in Strings. Developments in Language Theory 2011: 1-14 - [c71]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: 338-343 - [c70]Supaporn Chairungsee, Maxime Crochemore:
Building Phylogeny with Minimal Absent Words. CIAA 2011: 100-109 - [c69]Golnaz Badkobeh, Maxime Crochemore:
Finite-Repetition threshold for infinite ternary words. WORDS 2011: 37-43 - [i6]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 abs/1104.3153 (2011) - [i5]Maxime Crochemore, Lila Kari, Mehryar Mohri, Dirk Nowotka:
Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081). Dagstuhl Reports 1(2): 47-66 (2011) - 2010
- [j67]Maxime Crochemore, Marcin Kubica, Tomasz Walen, Costas S. Iliopoulos, M. Sohel Rahman:
Finding Patterns In Given Intervals. Fundam. Informaticae 101(3): 173-186 (2010) - [j66]Maxime Crochemore, Ely Porat:
Fast computation of a longest increasing subsequence and application. Inf. Comput. 208(9): 1054-1059 (2010) - [j65]Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera:
Number of Occurrences of powers in Strings. Int. J. Found. Comput. Sci. 21(4): 535-547 (2010) - [c68]Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis:
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches. Algorithms and Applications 2010: 92-101 - [c67]Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler:
Cover Array String Reconstruction. CPM 2010: 251-259 - [c66]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: 299-309 - [c65]Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Maximal Sum of Exponents of Runsin a String. IWOCA 2010: 10-19 - [c64]Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo:
Dictionary-Symbolwise Flexible Parsing. IWOCA 2010: 390-403 - [c63]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: 227-238 - [c62]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: 296-307 - [c61]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: 258-269 - [c60]Maxime Crochemore, German Tischler:
The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching. SPIRE 2010: 359-364 - [c59]Maxime Crochemore, Dov M. Gabbay:
Reactive Links to Save Automata States. Stringology 2010: 1-8 - [c58]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen:
New Simple Efficient Algorithms Computing Powers and Runs in Strings. Stringology 2010: 138-149 - [c57]Golnaz Badkobeh, Maxime Crochemore:
Bounded Number of Squares in Infinite Repetition-Constrained Binary Words. Stringology 2010: 161-166 - [i4]Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal sum of exponents of runs in a string. CoRR abs/1003.4866 (2010)
2000 – 2009
- 2009
- [j64]Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi:
From Nerode's congruence to suffix automata with mismatches. Theor. Comput. Sci. 410(37): 3471-3480 (2009) - [j63]Maxime Crochemore, Lucian Ilie, Wojciech Rytter:
Repetitions in strings: Algorithms and combinatorics. Theor. Comput. Sci. 410(50): 5227-5235 (2009) - [c56]Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
LPF Computation Revisited. IWOCA 2009: 158-169 - [c55]Julien Clément, Maxime Crochemore, Giuseppina Rindone:
Reverse Engineering Prefix Tables. STACS 2009: 289-300 - [c54]Maxime Crochemore, Laura Giambruno:
On-line Construction of a Small Automaton for a Finite Set of Words. Stringology 2009: 15-28 - [r6]Maxime Crochemore, Thierry Lecroq:
Suffix Tree. Encyclopedia of Database Systems 2009: 2876-2880 - [r5]Maxime Crochemore, Thierry Lecroq:
Trie. Encyclopedia of Database Systems 2009: 3179-3182 - [i3]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 abs/0907.2157 (2009) - 2008
- [j62]Kangho Roh, Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park:
External Memory Algorithms for String Problems. Fundam. Informaticae 84(1): 17-32 (2008) - [j61]Maxime Crochemore, Lucian Ilie:
Computing Longest Previous Factor in linear time and applications. Inf. Process. Lett. 106(2): 75-80 (2008) - [j60]Maxime Crochemore, Costas S. Iliopoulos, Mohammad Sohel Rahman:
Optimal prefix and suffix queries on texts. Inf. Process. Lett. 108(5): 320-325 (2008) - [j59]Maxime Crochemore, Lucian Ilie:
Maximal repetitions in strings. J. Comput. Syst. Sci. 74(5): 796-807 (2008) - [j58]Joseph Wun-Tat Chan, Maxime Crochemore:
Foreword. Math. Comput. Sci. 1(4): 541-542 (2008) - [j57]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) - [c53]Maxime Crochemore, Ely Porat:
Computing a Longest Increasing Subsequence of Length k in Time O(n log log k). BCS Int. Acad. Conf. 2008: 69-74 - [c52]Maxime Crochemore, Lucian Ilie, Liviu Tinta:
Towards a Solution to the "Runs" Conjecture. CPM 2008: 290-302 - [c51]Maxime Crochemore, Lucian Ilie, William F. Smyth:
A Simple Algorithm for Computing the Lempel Ziv Factorization. DCC 2008: 482-488 - [c50]Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera:
Bounds on Powers in Strings. Developments in Language Theory 2008: 206-215 - [c49]Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi:
On the Longest Common Factor Problem. IFIP TCS 2008: 143-155 - [c48]Maxime Crochemore, Lucian Ilie:
Understanding Maximal Repetitions in Strings. STACS 2008: 11-16 - [c47]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 - [c46]Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau:
Conservative String Covering of Indeterminate Strings. Stringology 2008: 108-115 - [p6]Maxime Crochemore, Thierry Lecroq:
Alignments and Approximate String Matching. New Developments in Formal Languages and Applications 2008: 59-93 - [r4]Maxime Crochemore, Thierry Lecroq:
Sequential Exact String Matching. Encyclopedia of Algorithms 2008 - [r3]Maxime Crochemore, Thierry Lecroq:
Sequential Multiple String Matching. Encyclopedia of Algorithms 2008 - [r2]Maxime Crochemore, Wojciech Rytter:
Squares and Repetitions. Encyclopedia of Algorithms 2008 - [i2]Maxime Crochemore, Lucian Ilie:
Understanding maximal repetitions in strings. CoRR abs/0802.2829 (2008) - 2007
- [b3]Maxime Crochemore, Christophe Hancart, Thierry Lecroq:
Algorithms on strings. Cambridge University Press 2007, ISBN 978-0-521-84899-2, pp. I-VIII, 1-383 - [j56]Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi:
The Structure of Factor Oracles. Int. J. Found. Comput. Sci. 18(4): 781-797 (2007) - [j55]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) - [c45]Marie-Pierre Béal, Maxime Crochemore:
Minimizing local automata. ISIT 2007: 1376-1380 - [c44]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: 57-66 - [c43]Maxime Crochemore, Lucian Ilie:
Analysis of Maximal Repetitions in Strings. MFCS 2007: 465-476 - [c42]Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman:
Finding Patterns in Given Intervals. MFCS 2007: 645-656 - [c41]Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi:
On the Suffix Automaton with Mismatches. CIAA 2007: 144-156 - 2006
- [j54]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) - [c40]Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi:
Factor Oracles. CIAA 2006: 78-89 - [p5]Maxime Crochemore, Thierry Lecroq:
Text Searching and Indexing. Recent Advances in Formal Languages and Applications 2006: 43-80 - 2005
- [j53]Ricardo A. Baeza-Yates, Maxime Crochemore:
Foreword. J. Discrete Algorithms 3(2-4): 125 (2005) - [j52]Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzón, Alejandro Salinger:
Bit-parallel (delta, gamma)-matching and suffix automata. J. Discrete Algorithms 3(2-4): 198-214 (2005) - [j51]Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot:
Bases of Motifs for Generating Repeated Patterns with Wild Cards. IEEE ACM Trans. Comput. Biol. Bioinform. 2(1): 40-50 (2005) - [j50]Maxime Crochemore, Jacques Désarménien, Dominique Perrin:
A note on the Burrows - CWheeler transformation. Theor. Comput. Sci. 332(1-3): 567-572 (2005) - [j49]Marie-Pierre Béal, Maxime Crochemore, Gabriele Fici:
Presentations of constrained systems with unconstrained positions. IEEE Trans. Inf. Theory 51(5): 1891-1900 (2005) - [c39]Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette:
Approximating the 2-Interval Pattern Problem. ESA 2005: 426-437 - [c38]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 - [e6]Alberto Apostolico, Maxime Crochemore, Kunsoo Park:
Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings. Lecture Notes in Computer Science 3537, Springer 2005, ISBN 3-540-26201-6 [contents] - [i1]Maxime Crochemore, Jacques Désarménien, Dominique Perrin:
A note on the Burrows-Wheeler transformation. CoRR abs/cs/0502073 (2005) - 2004
- [j48]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) - [c37]Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi:
A Trie-Based Approach for Compacting Automata. CPM 2004: 145-158 - [c36]Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot:
Longest Repeats with a Block of Don't Cares. LATIN 2004: 271-278 - [c35]Maxime Crochemore, Raffaele Giancarlo, Marie-France Sagot:
Longest Motifs with a Functionally Equivalent Central Block. SPIRE 2004: 298-209 - 2003
- [j47]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq:
Occurrence and Substring Heuristics for i-Matching. Fundam. Informaticae 56(1-2): 1-21 (2003) - [j46]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. Fundam. Informaticae 56(1-2): 89-103 (2003) - [j45]Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Computing forbidden words of regular languages. Fundam. Informaticae 56(1-2): 121-135 (2003) - [j44]Maxime Crochemore, Valery T. Stefanov:
Waiting time and complexity for matching patterns with automata. Inf. Process. Lett. 87(3): 119-125 (2003) - [j43]Maxime Crochemore, Christophe Hancart, Thierry Lecroq:
A unifying look at the Apostolico-Giancarlo string-matching algorithm. J. Discrete Algorithms 1(1): 37-52 (2003) - [j42]Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek:
Directed acyclic subsequence graph - Overview. J. Discrete Algorithms 1(3-4): 255-280 (2003) - [j41]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) - [j40]Maxime Crochemore:
Reducing space for index implementation. Theor. Comput. Sci. 292(1): 185-197 (2003) - [c34]Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps:
Two-Dimensional Pattern Matching with Rotations. CPM 2003: 17-31 - [c33]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 - [c32]Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzón:
A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. SPIRE 2003: 211-223 - [e5]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. Lecture Notes in Computer Science 2676, Springer 2003, ISBN 3-540-40311-6 [contents] - 2002
- [b2]Maxime Crochemore, Wojciech Rytter:
Jewels of stringology. World Scientific 2002, ISBN 978-981-02-4782-9, pp. I-X, 1-310 - [j39]Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzón:
Algorithms for Computing Approximate Repetitions in Musical Sequences. Int. J. Comput. Math. 79(11): 1135-1148 (2002) - [j38]Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, Kostas Tsichlas:
Approximate String Matching with Gaps. Nord. J. Comput. 9(1): 54-65 (2002) - [c31]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
Three Heuristics for delta-Matching: delta-BM Algorithms. CPM 2002: 178-189 - [c30]Maxime Crochemore, Gonzalo Navarro:
Improved Antidictionary Based Compression. SCCC 2002: 7-13 - [c29]Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson:
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. SODA 2002: 679-688 - [c28]Maxime Crochemore, Zdenek Tronícek:
On the Size of DASG for Multiple Texts. SPIRE 2002: 58-64 - [c27]Jan Holub, Maxime Crochemore:
On the Implementation of Compact DAWG's. CIAA 2002: 289-294 - 2001
- [j37]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Computing Evolutionary Chains in Musical Sequences. Electron. J. Comb. 8(2) (2001) - [j36]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón, James F. Reid:
A fast and practical bit-vector algorithm for the Longest Common Subsequence problem. Inf. Process. Lett. 80(6): 279-285 (2001) - [c26]Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot:
Efficient Experimental String Matching by Weak Factor Recognition. CPM 2001: 51-72 - [c25]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. SPIRE 2001: 59-67 - [c24]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzón:
Approximate String Matching in Musical Sequences. Stringology 2001: 26-36 - 2000
- [j35]Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi:
Data compression using antidictionaries. Proc. IEEE 88(11): 1756-1768 (2000) - [c23]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Finding Motifs with Gaps. ISMIR 2000 - [c22]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Fast Evolutionary Chains. SOFSEM 2000: 307-318
1990 – 1999
- 1999
- [j34]Maxime Crochemore, Renaud Vérin:
Zones of Low Entropy in Genomic Sequences. Comput. Chem. 23(3-4): 275-282 (1999) - [j33]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) - [j32]Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter:
Constant-Space String-Matching in Sublinear Average Time. Theor. Comput. Sci. 218(1): 197-203 (1999) - [c21]Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi:
Text Compression Using Antidictionaries. ICALP 1999: 261-270 - [c20]Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot:
Factor Oracle: A New Structure for Pattern Matching. SOFSEM 1999: 295-310 - [p4]Maxime Crochemore, Christophe Hancart:
Pattern Matching in Strings. Algorithms and Theory of Computation Handbook 1999 - [p3]Maxime Crochemore, Thierry Lecroq:
Text Data Compression Algorithms. Algorithms and Theory of Computation Handbook 1999 - [e4]Maxime Crochemore, Mike Paterson:
Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings. Lecture Notes in Computer Science 1645, Springer 1999, ISBN 3-540-66278-2 [contents] - 1998
- [j31]Maxime Crochemore, Costas S. Iliopoulos, Maureen Korda:
Two-Dimensional Prefix String Matching and Covering on Square Matrices. Algorithmica 20(4): 353-373 (1998) - [j30]Maxime Crochemore, Filippo Mignosi, Antonio Restivo:
Automata and Forbidden Words. Inf. Process. Lett. 67(3): 111-117 (1998) - [j29]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) - [c19]Maxime Crochemore, Filippo Mignosi, Antonio Restivo:
Minimal Forbidden Words and Factor Automata. MFCS 1998: 665-673 - 1997
- [j28]Maxime Crochemore, Thierry Lecroq:
Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm. Inf. Process. Lett. 63(4): 195-203 (1997) - [j27]Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter:
Constant-Time Randomized Parallel String Matching. SIAM J. Comput. 26(4): 950-960 (1997) - [c18]Maxime Crochemore, Renaud Vérin:
On Compact Directed Acyclic Word Graphs. Structures in Logic and Computer Science 1997: 192-211 - [c17]Maxime Crochemore, Renaud Vérin:
Direct Construction of Compact Directed Acyclic Word Graphs. CPM 1997: 116-129 - [c16]Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter:
Constant-space string-matching in sublinear average time. SEQUENCES 1997: 230-239 - [p2]Maxime Crochemore:
Off-line serial exact string searching. Pattern Matching Algorithms 1997: 1-53 - [p1]Maxime Crochemore, Christophe Hancart:
Automata for Matching Patterns. Handbook of Formal Languages (2) 1997: 399-462 - [r1]Maxime Crochemore, Thierry Lecroq:
Pattern Matching and Text Compression Algorithms. The Computer Science and Engineering Handbook 1997: 161-202 - 1996
- [j26]Maxime Crochemore, Thierry Lecroq:
Pattern-Matching and Text-Compression Algorithms. ACM Comput. Surv. 28(1): 39-41 (1996) - [c15]Nadia El-Mabrouk, Maxime Crochemore:
Boyer-Moore Strategy to Efficient Approximate String Matching. CPM 1996: 24-38 - 1995
- [j25]Maxime Crochemore, Wojciech Rytter:
Squares, Cubes, and Time-Space Efficient String Searching. Algorithmica 13(5): 405-425 (1995) - [j24]Alberto Apostolico, Maxime Crochemore:
Fast Parallel Lyndon Factorization with Applications. Math. Syst. Theory 28(2): 89-108 (1995) - [c14]Maxime Crochemore, Wojciech Rytter:
On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. LATIN 1995: 220-229 - [c13]Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter:
Two-Dimensional Pattern Matching in Linear Time and Small Space. STACS 1995: 181-192 - 1994
- [b1]Maxime Crochemore, Wojciech Rytter:
Text Algorithms. Oxford University Press 1994, ISBN 0-19-508609-0 - [j23]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) - [j22]Maxime Crochemore, Wojciech Rytter:
On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. Theor. Comput. Sci. 132(2): 403-414 (1994) - [e3]Maxime Crochemore, Dan Gusfield:
Combinatorial Pattern Matching, 5th Annual Symposium, CPM 94, Asilomar, California, USA, June 5-8, 1994, Proceedings. Lecture Notes in Computer Science 807, Springer 1994, ISBN 3-540-58094-8 [contents] - 1993
- [j21]Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter:
Two-Dimensional Pattern Matching by Sampling. Inf. Process. Lett. 46(4): 159-162 (1993) - [c12]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 - [e2]Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber:
Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings. Lecture Notes in Computer Science 684, Springer 1993, ISBN 3-540-56764-X [contents] - 1992
- [j20]Maxime Crochemore:
String-Matching on Ordered Alphabets. Theor. Comput. Sci. 92(1): 33-47 (1992) - [j19]Jean Néraud, Maxime Crochemore:
A String-Matching Interpretation of the Equation xmyn = zp. Theor. Comput. Sci. 92(1): 145-164 (1992) - [c11]Maxime Crochemore, Wojciech Rytter:
Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. ICPIA 1992: 100-112 - [c10]Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter:
Speeding Up Two String-Matching Algorithms. STACS 1992: 589-600 - [e1]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. Lecture Notes in Computer Science 644, Springer 1992, ISBN 3-540-56024-6 [contents] - 1991
- [j18]Alberto Apostolico, Maxime Crochemore:
Optimal Canonization of All Substrings of a String. Inf. Comput. 95(1): 76-95 (1991) - [j17]Maxime Crochemore, Pavel Goralcik:
Mutually Avoiding Ternary Words of Small Exponent. Int. J. Algebra Comput. 1(4): 407-410 (1991) - [j16]Maxime Crochemore, Wojciech Rytter:
Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings. Inf. Process. Lett. 38(2): 57-60 (1991) - [j15]Maxime Crochemore, Dominique Perrin:
Two-Way String Matching. J. ACM 38(3): 651-675 (1991) - [j14]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) - [j13]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
- [j12]Maxime Crochemore, Wojciech Rytter:
Parallel Construction of Minimal Suffix and Factor Automata. Inf. Process. Lett. 35(3): 121-128 (1990) - [c9]Maxime Crochemore, Jean Néraud:
Unitary Monoid with Two Generators: An Algorithmic Point of View. CAAP 1990: 117-131 - [c8]Maxime Crochemore, Wojciech Rytter:
Parallel Construction of Minimal Suffix and Factor Automata. MFCS 1990: 217-223 - [c7]Maxime Crochemore, Wojciech Rytter:
Parallel Computations on Strings and Arrays. STACS 1990: 109-125
1980 – 1989
- 1989
- [j11]Jean Berstel, Maxime Crochemore, Jean-Eric Pin:
Thue-Morse sequence and p-adic topology for the free monoid. Discret. Math. 76(2): 89-94 (1989) - [j10]Maxime Crochemore:
String-matching and periods. Bull. EATCS 39: 149-153 (1989) - 1988
- [j9]Maxime Crochemore, Dominique Perrin:
Critical factorizations of words. Bull. EATCS 34: 47-51 (1988) - [c6]Maxime Crochemore:
Constant-Space String-Matching. FSTTCS 1988: 80-87 - [c5]Maxime Crochemore:
Algorithms and automata. Formal Properties of Finite Automata and Applications 1988: 166-175 - [c4]Maxime Crochemore:
String Matching with Constraints. MFCS 1988: 44-58 - 1987
- [c3]Maxime Crochemore:
Data Compression with Substitution. Electronic Dictionaries and Automata in Computational Linguistics 1987: 1-16 - [c2]Maxime Crochemore:
Longest Common Factor of Two Words. TAPSOFT, Vol.1 1987: 26-36 - 1986
- [j8]Maxime Crochemore:
Computing LCF in linear time. Bull. EATCS 30: 57-60 (1986) - [j7]Jean-Jacques Hébrard, Maxime Crochemore:
Calcul de La Distance Par Les Sous-Mots. RAIRO Theor. Informatics Appl. 20(4): 441-456 (1986) - [j6]Maxime Crochemore:
Transducers and Repetitions. Theor. Comput. Sci. 45(1): 63-86 (1986) - 1984
- [c1]Maxime Crochemore:
Linear Searching for a Squre in a Word (Abstract). ICALP 1984: 137 - 1983
- [j5]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
- [j4]Maxime Crochemore:
Sharp Characterizations of Squarefree Morphisms. Theor. Comput. Sci. 18: 221-226 (1982) - [j3]A. Cardon, Maxime Crochemore:
Partitioning a Graph in O(|A| log2 |V|). Theor. Comput. Sci. 19: 85-98 (1982) - 1981
- [j2]Maxime Crochemore:
An Optimal Algorithm for Computing the Repetitions in a Word. Inf. Process. Lett. 12(5): 244-250 (1981) - 1980
- [j1]A. Cardon, Maxime Crochemore:
Détermination de la Représentation Standard d'une Série Reconnaissable. RAIRO Theor. Informatics Appl. 14(4): 371-379 (1980)
Coauthor Index
[c102] [j121] [c101] [c99] [i28] [j117] [c98] [i26] [c96] [c95] [i25] [j111] [j109] [c92] [j107] [j105] [j103] [c87] [i22] [j96] [i21] [j95] [j94] [j91] [j90] [c85] [i18] [j88] [j87] [j86] [j84] [c80] [c79] [i15] [i14] [i13] [j81] [j80] [j78] [j77] [j74] [j73] [c78] [c77] [i12] [i11] [i9] [c74] [c73] [c71] [i6] [j67] [j65] [c68] [c67] [c66] [c63] [c62] [c61] [c58] [c56] [i3] [j62] [j60] [c50] [c47] [c46] [j55] [c44] [c42] [j54] [j52] [c38] [c36] [j47] [j46] [c32] [j39] [j38] [c31] [j37] [j36] [c25] [c24] [c23] [c22] [j31]
[c102] [j121] [c101] [c99] [i28] [j117] [c98] [i26] [c96] [c95] [i25] [j109] [c92] [j103] [c87] [r8] [i22] [j96] [j95] [j91] [c85] [i18] [j87] [j86] [j84] [c79] [i15] [i13] [j78] [j77] [j76] [c78] [i9] [c73] [i6] [c66] [c65] [c63] [c62] [c61] [c58] [i4] [j63] [c56] [i3] [r2] [b2] [j38] [c31] [j33] [j32] [j29] [j27] [c16] [j25] [c14] [c13] [b1] [j23] [j22] [j21] [c12] [c11] [c10] [j16] [j14] [j13] [j12] [c8] [c7]
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
