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]