Maxime Crochemore
King's College London, UK
University Paris-Est Marne-la-Vallée, France
http://www.kcl.ac.uk/nms/depts/informatics/people/atoz/crochemorem.aspx
http://www-igm.univ-mlv.fr/~mac/
https://scholar.google.com/citations?user=rQkFVs4AAAAJ
https://dl.acm.org/profile/81100599799
https://zbmath.org/authors/?q=ai:crochemore.maxime
https://mathgenealogy.org/id.php?id=172003
https://en.wikipedia.org/wiki/Maxime_Crochemore
https://orcid.org/0000-0003-1087-1419
https://www.wikidata.org/entity/Q29032892
https://www.researcherid.com/rid/K-2041-2017
http://isni.org/isni/0000000110845005
https://id.loc.gov/authorities/names/n94041875
https://d-nb.info/gnd/121181820
https://mathscinet.ams.org/mathscinet/MRAuthorID/52860
Marie-Pierre Béal
Maxime Crochemore
Fast Detection of Specific Fragments Against a Set of Sequences.
51-60
2023
DLT
https://doi.org/10.1007/978-3-031-33264-7_5
conf/dlt/2023
db/conf/dlt/dlt2023.html#BealC23
Golnaz Badkobeh
Maxime Crochemore
Linear construction of a left Lyndon tree.
104884
2022
285
Inf. Comput.
Part
https://doi.org/10.1016/j.ic.2022.104884
db/journals/iandc/iandc285.html#BadkobehC22
Marie-Pierre Béal
Maxime Crochemore
Checking whether a word is Hamming-isometric in linear time.
55-59
2022
933
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2022.08.032
db/journals/tcs/tcs933.html#BealC22
Golnaz Badkobeh
Maxime Crochemore
Jonas Ellert
Cyril Nicaud
Back-To-Front Online Lyndon Forest Construction.
13:1-13:23
2022
CPM
https://doi.org/10.4230/LIPIcs.CPM.2022.13
conf/cpm/2022
db/conf/cpm/cpm2022.html#BadkobehCEN22
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.
22:1-22:15
2022
CPM
https://doi.org/10.4230/LIPIcs.CPM.2022.22
conf/cpm/2022
db/conf/cpm/cpm2022.html#CrochemoreIRRSW22
Marie-Pierre Béal
Maxime Crochemore
Fast detection of specific fragments against a set of sequences.
2022
abs/2208.03451
CoRR
https://doi.org/10.48550/arXiv.2208.03451
db/journals/corr/corr2208.html#abs-2208-03451
Maxime Crochemore
Costas S. Iliopoulos
Jakub Radoszewski
Wojciech Rytter
Juliusz Straszynski
Tomasz Walen
Wiktor Zuba
Shortest covers of all cyclic shifts of a string.
70-81
2021
866
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2021.03.011
db/journals/tcs/tcs866.html#CrochemoreIRRSW21
Marie-Pierre Béal
Maxime Crochemore
Checking whether a word is Hamming-isometric in linear time.
2021
abs/2106.10541
CoRR
https://arxiv.org/abs/2106.10541
db/journals/corr/corr2106.html#abs-2106-10541
Maxime Crochemore
Alice Héliou
Gregory Kucherov
Laurent Mouchard
Solon P. Pissis
Yann Ramusat
Absent words in a sliding window with applications.
2020
270
Inf. Comput.
https://doi.org/10.1016/j.ic.2019.104461
db/journals/iandc/iandc270.html#CrochemoreHKMPR20
Maxime Crochemore
Luís M. S. Russo
Cartesian and Lyndon trees.
1-9
2020
806
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2018.08.011
https://www.wikidata.org/entity/Q61677815
db/journals/tcs/tcs806.html#CrochemoreR20
Maxime Crochemore
Costas S. Iliopoulos
Jakub Radoszewski
Wojciech Rytter
Juliusz Straszynski
Tomasz Walen
Wiktor Zuba
Internal Quasiperiod Queries.
60-75
2020
SPIRE
https://doi.org/10.1007/978-3-030-59212-7_5
conf/spire/2020
db/conf/spire/spire2020.html#CrochemoreIRRSW20
Golnaz Badkobeh
Maxime Crochemore
Left Lyndon Tree Construction.
84-95
2020
Stringology
http://www.stringology.org/event/2020/p08.html
conf/stringology/2020
db/conf/stringology/stringology2020.html#BadkobehC20
Maxime Crochemore
Costas S. Iliopoulos
Jakub Radoszewski
Wojciech Rytter
Juliusz Straszynski
Tomasz Walen
Wiktor Zuba
Shortest Covers of All Cyclic Shifts of a String.
69-80
2020
WALCOM
https://doi.org/10.1007/978-3-030-39881-1_7
https://www.wikidata.org/entity/Q99204848
conf/walcom/2020
db/conf/walcom/walcom2020.html#CrochemoreIRRSW20
Maxime Crochemore
Costas S. Iliopoulos
Jakub Radoszewski
Wojciech Rytter
Juliusz Straszynski
Tomasz Walen
Wiktor Zuba
Internal Quasiperiod Queries.
2020
abs/2007.13471
CoRR
https://arxiv.org/abs/2007.13471
db/journals/corr/corr2007.html#abs-2007-13471
Golnaz Badkobeh
Maxime Crochemore
Left Lyndon tree construction.
2020
abs/2011.12742
CoRR
https://arxiv.org/abs/2011.12742
db/journals/corr/corr2011.html#abs-2011-12742
Maxime Crochemore
Roman Kolpakov
Gregory Kucherov
Optimal bounds for computing α-gapped repeats.
2019
268
Inf. Comput.
https://doi.org/10.1016/j.ic.2019.104434
db/journals/iandc/iandc268.html#CrochemoreKK19
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.
501-522
2019
37
J. Comb. Optim.
2
https://doi.org/10.1007/s10878-018-0300-z
https://www.wikidata.org/entity/Q61677816
db/journals/jco/jco37.html#Charalampopoulos19
Maxime Crochemore
Jakub Radoszewski
Special issue in honor of the 70th birthday of Prof. Wojciech Rytter.
1
2019
792
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2019.09.038
https://www.wikidata.org/entity/Q123012147
db/journals/tcs/tcs792.html#CrochemoreR19
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.
25:1-25:14
2019
CPM
https://doi.org/10.4230/LIPIcs.CPM.2019.25
conf/cpm/2019
db/conf/cpm/cpm2019.html#AlzamelCIKRRSWZ19
Golnaz Badkobeh
Hideo Bannai
Maxime Crochemore
Tomohiro I
Shunsuke Inenaga
Shiho Sugimoto
k-Abelian Pattern Matching: Revisited, Corrected, and Extended.
29-40
2019
Stringology
http://www.stringology.org/event/2019/p04.html
conf/stringology/2019
db/conf/stringology/stringology2019.html#BadkobehBCIIS19
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.
2019
abs/1901.11305
CoRR
http://arxiv.org/abs/1901.11305
db/journals/corr/corr1901.html#abs-1901-11305
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.
4:1-4:14
2018
13
Algorithms Mol. Biol.
1
https://doi.org/10.1186/s13015-017-0119-7
https://www.wikidata.org/entity/Q50257660
db/journals/almob/almob13.html#CarricoCFPRV18
Panagiotis Charalampopoulos
Maxime Crochemore
Solon P. Pissis
Preface.
i
2018
163
Fundam. Informaticae
3
https://doi.org/10.3233/FI-2018-1739
db/journals/fuin/fuin163.html#Charalampopoulos18
Panagiotis Charalampopoulos
Maxime Crochemore
Gabriele Fici
Robert Mercas
Solon P. Pissis
Alignment-free sequence comparison using absent words.
57-68
2018
262
Inf. Comput.
https://doi.org/10.1016/j.ic.2018.06.002
db/journals/iandc/iandc262.html#Charalampopoulos18
Maxime Crochemore
Solon P. Pissis
Advances in Algorithms & Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos).
1
2018
710
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2018.01.001
https://www.wikidata.org/entity/Q122443157
db/journals/tcs/tcs710.html#CrochemoreP18
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.
23:1-23:16
2018
CPM
https://doi.org/10.4230/LIPIcs.CPM.2018.23
conf/cpm/2018
db/conf/cpm/cpm2018.html#Charalampopoulos18
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.
168-178
2018
AIAI (Workshops)
https://doi.org/10.1007/978-3-319-92016-0_16
conf/ifip12/2018aiaiw
db/conf/ifip12/aiai2018w.html#AlzamelCIKKRRW18
Panagiotis Charalampopoulos
Maxime Crochemore
Solon P. Pissis
On Extended Special Factors of a Word.
131-138
2018
SPIRE
https://doi.org/10.1007/978-3-030-00479-8_11
conf/spire/2018
db/conf/spire/spire2018.html#Charalampopoulos18
Maxime Crochemore
Thierry Lecroq
Suffix Tree.
2018
Encyclopedia of Database Systems (2nd ed.)
https://doi.org/10.1007/978-1-4614-8265-9_1142
reference/db/2018
db/reference/db/s2.html#CrochemoreL18
Maxime Crochemore
Thierry Lecroq
Trie.
2018
Encyclopedia of Database Systems (2nd ed.)
https://doi.org/10.1007/978-1-4614-8265-9_1143
reference/db/2018
db/reference/db/t2.html#CrochemoreL18a
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.
2018
abs/1802.06369
CoRR
http://arxiv.org/abs/1802.06369
db/journals/corr/corr1802.html#abs-1802-06369
Panagiotis Charalampopoulos
Maxime Crochemore
Gabriele Fici
Robert Mercas
Solon P. Pissis
Alignment-free sequence comparison using absent words.
2018
abs/1806.02718
CoRR
http://arxiv.org/abs/1806.02718
db/journals/corr/corr1806.html#abs-1806-02718
Maxime Crochemore
Costas S. Iliopoulos
Alessio Langiu
Filippo Mignosi
The longest common substring problem.
277-295
2017
27
Math. Struct. Comput. Sci.
2
https://doi.org/10.1017/S0960129515000110
https://www.wikidata.org/entity/Q61677819
db/journals/mscs/mscs27.html#CrochemoreILM17
Golnaz Badkobeh
Maxime Crochemore
Robert Mercas
Counting maximal-exponent factors in words.
27-35
2017
658
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2016.02.035
https://www.wikidata.org/entity/Q61677821
db/journals/tcs/tcs658.html#BadkobehCM17
Maxime Crochemore
Costas S. Iliopoulos
Tomasz Kociumaka
Jakub Radoszewski
Wojciech Rytter
Tomasz Walen
Covering problems for partial words and for indeterminate strings.
25-39
2017
698
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2017.05.026
db/journals/tcs/tcs698.html#CrochemoreIKRRW17
Mika Amit
Maxime Crochemore
Gad M. Landau
Dina Sokol
Locating maximal approximate runs in a string.
45-62
2017
700
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2017.07.021
db/journals/tcs/tcs700.html#AmitCLS17
Supaporn Chairungsee
Maxime Crochemore
Longest Previous Non-overlapping Factors Table Computation.
483-491
2017
COCOA (2)
https://doi.org/10.1007/978-3-319-71147-8_35
conf/cocoa/2017-2
db/conf/cocoa/cocoa2017-2.html#ChairungseeC17
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.
99-111
2017
COCOON
https://doi.org/10.1007/978-3-319-62389-4_9
conf/cocoon/2017
db/conf/cocoon/cocoon2017.html#Charalampopoulos17
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.
164-176
2017
FCT
https://doi.org/10.1007/978-3-662-55751-8_14
https://www.wikidata.org/entity/Q58064450
conf/fct/2017
db/conf/fct/fct2017.html#CrochemoreHKMPR17
Maxime Crochemore
Alexandre P. Francisco
Solon P. Pissis
Cátia Vaz
Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time.
9:1-9:14
2017
WABI
https://doi.org/10.4230/LIPIcs.WABI.2017.9
conf/wabi/2017
db/conf/wabi/wabi2017.html#CrochemoreFPV17
Maxime Crochemore
Luís M. S. Russo
Cartesian trees and Lyndon trees.
2017
abs/1712.08749
CoRR
http://arxiv.org/abs/1712.08749
db/journals/corr/corr1712.html#abs-1712-08749
Michalis Christou
Maxime Crochemore
Costas S. Iliopoulos
Quasiperiodicities in Fibonacci strings.
211-225
2016
129
Ars Comb.
db/journals/arscom/arscom129.html#ChristouCI16
Alberto Apostolico
Maxime Crochemore
Martin Farach-Colton
Zvi Galil
S. Muthukrishnan 0001
40 years of suffix trees.
66-73
2016
59
Commun. ACM
4
https://doi.org/10.1145/2810036
https://www.wikidata.org/entity/Q61677822
db/journals/cacm/cacm59.html#ApostolicoCFGM16
Maxime Crochemore
Costas S. Iliopoulos
Ritu Kundu
Manal Mohamed 0001
Fatima Vayani
Linear algorithm for conservative degenerate pattern matching.
109-114
2016
51
Eng. Appl. Artif. Intell.
https://doi.org/10.1016/j.engappai.2016.01.009
https://www.wikidata.org/entity/Q60315577
db/journals/eaai/eaai51.html#CrochemoreIKMV16
Golnaz Badkobeh
Maxime Crochemore
Computing maximal-exponent factors in an overlap-free word.
477-487
2016
82
J. Comput. Syst. Sci.
3
https://doi.org/10.1016/j.jcss.2015.11.007
https://www.wikidata.org/entity/Q61677825
db/journals/jcss/jcss82.html#BadkobehC16
Maxime Crochemore
Costas S. Iliopoulos
Tomasz Kociumaka
Marcin Kubica
Alessio Langiu
Solon P. Pissis
Jakub Radoszewski
Wojciech Rytter
Tomasz Walen
Order-preserving indexing.
122-135
2016
638
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2015.06.050
https://www.wikidata.org/entity/Q61677834
db/journals/tcs/tcs638.html#CrochemoreIKKLP16
Maxime Crochemore
Chiara Epifanio
Roberto Grossi
Filippo Mignosi
Linear-size suffix tries.
171-178
2016
638
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2016.04.002
https://www.wikidata.org/entity/Q61677829
db/journals/tcs/tcs638.html#CrochemoreEGM16
Maxime Crochemore
Robert Mercas
On the density of Lyndon roots in factors.
234-240
2016
656
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2016.02.015
https://www.wikidata.org/entity/Q61677832
db/journals/tcs/tcs656.html#CrochemoreM16
Golnaz Badkobeh
Maxime Crochemore
Manal Mohamed 0001
Chalita Toopsuwan
Efficient computation of maximal anti-exponent in palindrome-free strings.
241-248
2016
656
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2016.02.014
https://www.wikidata.org/entity/Q61677827
db/journals/tcs/tcs656.html#BadkobehCMT16
Maxime Crochemore
Roman Kolpakov
Gregory Kucherov
Optimal Bounds for Computing \alpha α -gapped Repeats.
245-255
2016
LATA
https://doi.org/10.1007/978-3-319-30000-9_19
https://www.wikidata.org/entity/Q58064455
conf/lata/2016
db/conf/lata/lata2016.html#CrochemoreKK16
Maxime Crochemore
Gabriele Fici
Robert Mercas
Solon P. Pissis
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications.
334-346
2016
LATIN
https://doi.org/10.1007/978-3-662-49529-2_25
conf/latin/2016
db/conf/latin/latin2016.html#CrochemoreFMP16
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.
22-34
2016
SPIRE
https://doi.org/10.1007/978-3-319-46049-9_3
https://www.wikidata.org/entity/Q61677831
conf/spire/2016
db/conf/spire/spire2016.html#CrochemoreIKKPR16
Maxime Crochemore
Thierry Lecroq
Multiple String Matching.
1378-1382
2016
Encyclopedia of Algorithms
https://doi.org/10.1007/978-1-4939-2864-4_366
db/reference/algo/algo2016.html#CrochemoreL16
Maxime Crochemore
Wojciech Rytter
Squares and Repetitions.
2056-2060
2016
Encyclopedia of Algorithms
https://doi.org/10.1007/978-1-4939-2864-4_392
db/reference/algo/algo2016.html#CrochemoreR16
Maxime Crochemore
Thierry Lecroq
String Matching.
2113-2117
2016
Encyclopedia of Algorithms
https://doi.org/10.1007/978-1-4939-2864-4_365
db/reference/algo/algo2016.html#CrochemoreL16a
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.
2016
abs/1606.08275
CoRR
http://arxiv.org/abs/1606.08275
db/journals/corr/corr1606.html#CrochemoreIKKPR16
Golnaz Badkobeh
Maxime Crochemore
Infinite binary words containing repetitions of odd period.
543-547
2015
115
Inf. Process. Lett.
5
https://doi.org/10.1016/j.ipl.2015.01.004
https://www.wikidata.org/entity/Q61677840
db/journals/ipl/ipl115.html#BadkobehC15
Maxime Crochemore
Jacqueline W. Daykin
Zsuzsanna Lipták
StringMasters 2012 & 2013 special issue - volume 2.
1-2
2015
32
J. Discrete Algorithms
https://doi.org/10.1016/j.jda.2015.01.007
https://www.wikidata.org/entity/Q61677841
db/journals/jda/jda32.html#CrochemoreDL15
Maxime Crochemore
Roberto Grossi
Juha Kärkkäinen
Gad M. Landau
Computing the Burrows-Wheeler transform in place and in small space.
44-52
2015
32
J. Discrete Algorithms
https://doi.org/10.1016/j.jda.2015.01.004
https://www.wikidata.org/entity/Q61677839
db/journals/jda/jda32.html#CrochemoreGKL15
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.
49-53
2015
34
J. Discrete Algorithms
https://doi.org/10.1016/j.jda.2015.05.003
https://www.wikidata.org/entity/Q61677838
db/journals/jda/jda34.html#CrochemoreIKKLR15
Maxime Crochemore
Costas S. Iliopoulos
Ritu Kundu
Manal Mohamed 0001
Fatima Vayani
Linear Algorithm for Conservative Degenerate Pattern Matching.
2015
abs/1506.04559
CoRR
http://arxiv.org/abs/1506.04559
db/journals/corr/corr1506.html#CrochemoreIKMV15
Maxime Crochemore
Gabriele Fici
Robert Mercas
Solon P. Pissis
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications.
2015
abs/1506.04917
CoRR
http://arxiv.org/abs/1506.04917
db/journals/corr/corr1506.html#CrochemoreFMP15
Maxime Crochemore
Roman Kolpakov
Gregory Kucherov
Optimal searching of gapped repeats in a word.
2015
abs/1509.01221
CoRR
http://arxiv.org/abs/1509.01221
db/journals/corr/corr1509.html#CrochemoreKK15
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.
258-267
2014
163
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2013.05.009
https://www.wikidata.org/entity/Q61677849
db/journals/dam/dam163.html#CrochemoreIKRRSW14
Manolis Christodoulakis
Michalis Christou
Maxime Crochemore
Costas S. Iliopoulos
Abelian borders in binary words.
141-146
2014
171
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2014.02.012
https://www.wikidata.org/entity/Q61677844
db/journals/dam/dam171.html#ChristodoulakisCCI14
Golnaz Badkobeh
Maxime Crochemore
Michaël Rao
Finite repetition threshold for large alphabets.
419-430
2014
48
RAIRO Theor. Informatics Appl.
4
https://doi.org/10.1051/ita/2014017
https://www.wikidata.org/entity/Q61677847
db/journals/ita/ita48.html#BadkobehCR14
Maxime Crochemore
Jacqueline W. Daykin
Zsuzsanna Lipták
StringMasters 2012 & 2013 special issue - volume 1.
1
2014
28
J. Discrete Algorithms
https://doi.org/10.1016/j.jda.2014.08.002
db/journals/jda/jda28.html#CrochemoreDL14
Maxime Crochemore
Costas S. Iliopoulos
Marcin Kubica
Jakub Radoszewski
Wojciech Rytter
Tomasz Walen
Extracting powers and periods in a word from its runs structure.
29-41
2014
521
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2013.11.018
https://www.wikidata.org/entity/Q61677846
db/journals/tcs/tcs521.html#CrochemoreIKRRW14
Manolis Christodoulakis
Michalis Christou
Maxime Crochemore
Costas S. Iliopoulos
On the average number of regularities in a word.
3-9
2014
525
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2013.10.007
https://www.wikidata.org/entity/Q61677852
db/journals/tcs/tcs525.html#ChristodoulakisCCI14
Maxime Crochemore
Alessio Langiu
Filippo Mignosi
Note on the greedy parsing optimality for dictionary-based text compression.
55-59
2014
525
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2014.01.013
https://www.wikidata.org/entity/Q61677850
db/journals/tcs/tcs525.html#CrochemoreLM14
Golnaz Badkobeh
Maxime Crochemore
Chalita Toopsuwan
Maximal anti-exponent of gapped palindromes.
205-210
2014
DICTAP
https://doi.org/10.1109/DICTAP.2014.6821683
conf/dictap/2014
db/conf/dictap/dictap2014.html#BadkobehCT14
Maxime Crochemore
Costas S. Iliopoulos
Tomasz Kociumaka
Jakub Radoszewski
Wojciech Rytter
Tomasz Walen
Covering Problems for Partial Words and for Indeterminate Strings.
220-232
2014
ISAAC
https://doi.org/10.1007/978-3-319-13075-0_18
https://www.wikidata.org/entity/Q61677845
conf/isaac/2014
db/conf/isaac/isaac2014.html#CrochemoreIKRRW14
Maxime Crochemore
Thierry Lecroq
Pattern Matching and Text Compression Algorithms.
15: 1-57
2014
Computing Handbook, 3rd ed. (1)
books/crc/chb2014-1
db/books/collections/chb2014-1.html#CrochemoreL14
Edleno Silva de Moura
Maxime Crochemore
String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings
2014
Springer
Lecture Notes in Computer Science
8799
https://doi.org/10.1007/978-3-319-11918-2
https://www.wikidata.org/entity/Q58064468
978-3-319-11917-5
SPIRE
db/conf/spire/spire2014.html
Maxime Crochemore
Costas S. Iliopoulos
Tomasz Kociumaka
Jakub Radoszewski
Wojciech Rytter
Tomasz Walen
Covering Problems for Partial Words and for Indeterminate Strings.
2014
abs/1412.3696
CoRR
http://arxiv.org/abs/1412.3696
db/journals/corr/corr1412.html#CrochemoreIKRRW14
Maxime Crochemore
Robert Mercas
Fewer runs than word length.
2014
abs/1412.4646
CoRR
http://arxiv.org/abs/1412.4646
db/journals/corr/corr1412.html#CrochemoreM14
Maxime Crochemore
James D. Currie
Gregory Kucherov
Dirk Nowotka
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111).
28-46
2014
4
Dagstuhl Reports
3
https://doi.org/10.4230/DagRep.4.3.28
db/journals/dagstuhl-reports/dagstuhl-reports4.html#CrochemoreCKN14
Manolis Christodoulakis
Michalis Christou
Maxime Crochemore
Costas S. Iliopoulos
Overlapping factors in words.
49-64
2013
57
Australas. J Comb.
http://ajc.maths.uq.edu.au/pdf/57/ajc_v57_p049.pdf
db/journals/ajc/ajc57.html#Christodoulakis13
Maxime Crochemore
Lucian Ilie
Costas S. Iliopoulos
Marcin Kubica
Wojciech Rytter
Tomasz Walen
Computing the Longest Previous Factor.
15-26
2013
34
Eur. J. Comb.
1
https://doi.org/10.1016/j.ejc.2012.07.011
https://www.wikidata.org/entity/Q61677857
db/journals/ejc/ejc34.html#CrochemoreIIKRW13
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.
74-77
2013
113
Inf. Process. Lett.
3
https://doi.org/10.1016/j.ipl.2012.11.001
https://www.wikidata.org/entity/Q61677856
db/journals/ipl/ipl113.html#CrochemoreIKKPRRTW13
Maxime Crochemore
Jacqueline W. Daykin
StringMasters 2011 Special Issue.
1-2
2013
20
J. Discrete Algorithms
https://doi.org/10.1016/j.jda.2013.05.001
db/journals/jda/jda20.html#CrochemoreD13
Michalis Christou
Maxime Crochemore
Costas S. Iliopoulos
Marcin Kubica
Solon P. Pissis
Jakub Radoszewski
Wojciech Rytter
Bartosz Szreder
Tomasz Walen
Efficient seed computation revisited.
171-181
2013
483
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2011.12.078
https://www.wikidata.org/entity/Q61677858
db/journals/tcs/tcs483.html#ChristouCIKPRRSW13
Alberto Apostolico
Maxime Crochemore
Martin Farach-Colton
Zvi Galil
S. Muthukrishnan 0001
Forty Years of Text Indexing.
1-10
2013
CPM
https://doi.org/10.1007/978-3-642-38905-4_1
conf/cpm/2013
db/conf/cpm/cpm2013.html#ApostolicoCFGM13
Mika Amit
Maxime Crochemore
Gad M. Landau
Locating All Maximal Approximate Runs in a String.
13-27
2013
CPM
https://doi.org/10.1007/978-3-642-38905-4_4
conf/cpm/2013
db/conf/cpm/cpm2013.html#AmitCL13
Maxime Crochemore
Roberto Grossi
Juha Kärkkäinen
Gad M. Landau
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform.
74-82
2013
CPM
https://doi.org/10.1007/978-3-642-38905-4_9
conf/cpm/2013
db/conf/cpm/cpm2013.html#CrochemoreGKL13
Maxime Crochemore
Alessio Langiu
Filippo Mignosi
The Rightmost Equal-Cost Position Problem.
421-430
2013
DCC
https://doi.org/10.1109/DCC.2013.50
https://www.wikidata.org/entity/Q61677862
conf/dcc/2013
db/conf/dcc/dcc2013.html#CrochemoreLM13
Joong Chae Na
Heejin Park
Maxime Crochemore
Jan Holub 0001
Costas S. Iliopoulos
Laurent Mouchard
Kunsoo Park
Suffix Tree of Alignment: An Efficient Index for Similar Data.
337-348
2013
IWOCA
https://doi.org/10.1007/978-3-642-45278-9_29
conf/iwoca/2013
db/conf/iwoca/iwoca2013.html#NaPCHIMP13
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.
84-95
2013
SPIRE
https://doi.org/10.1007/978-3-319-02432-5_13
conf/spire/2013
db/conf/spire/spire2013.html#CrochemoreIKKLPRRW13
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
http://arxiv.org/abs/1303.6872
2013
CoRR
abs/1303.6872
db/journals/corr/corr1303.html#abs-1303-6872
Joong Chae Na
Heejin Park
Maxime Crochemore
Jan Holub 0001
Costas S. Iliopoulos
Laurent Mouchard
Kunsoo Park
Suffix Tree of Alignment: An Efficient Index for Similar Data
http://arxiv.org/abs/1305.1744
2013
CoRR
abs/1305.1744
db/journals/corr/corr1305.html#abs-1305-1744
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.
2013
abs/1312.2381
CoRR
http://arxiv.org/abs/1312.2381
db/journals/corr/corr1312.html#CrochemoreIKKLRRSW13
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.
5:1-5:17
2012
45
ACM Comput. Surv.
1
https://doi.org/10.1145/2379776.2379781
https://www.wikidata.org/entity/Q61677864
db/journals/csur/csur45.html#Al-HafeedhCIKSTY12
Maxime Crochemore
Laura Giambruno
Alessio Langiu
On-Line Construction of a Small Automaton for a Finite Set of Words.
281-301
2012
23
Int. J. Found. Comput. Sci.
2
https://doi.org/10.1142/S0129054112400138
https://www.wikidata.org/entity/Q61677873
db/journals/ijfcs/ijfcs23.html#CrochemoreGL12
Michalis Christou
Maxime Crochemore
Costas S. Iliopoulos
Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems.
1371-1384
2012
23
Int. J. Found. Comput. Sci.
6
https://doi.org/10.1142/S0129054112500190
https://www.wikidata.org/entity/Q61677871
db/journals/ijfcs/ijfcs23.html#ChristouCI12
Michalis Christou
Maxime Crochemore
Tomás Flouri
Costas S. Iliopoulos
Jan Janousek
Borivoj Melichar
Solon P. Pissis
Computing all subtree repeats in ordered trees.
958-962
2012
112
Inf. Process. Lett.
24
https://doi.org/10.1016/j.ipl.2012.09.001
https://www.wikidata.org/entity/Q61677867
db/journals/ipl/ipl112.html#ChristouCFIJMP12
Golnaz Badkobeh
Maxime Crochemore
Fewest repetitions in infinite binary words.
17-31
2012
46
RAIRO Theor. Informatics Appl.
1
https://doi.org/10.1051/ita/2011109
https://www.wikidata.org/entity/Q61677869
db/journals/ita/ita46.html#BadkobehC12
Maxime Crochemore
Costas S. Iliopoulos
Marcin Kubica
Jakub Radoszewski
Wojciech Rytter
Tomasz Walen
The maximal number of cubic runs in a word.
1828-1836
2012
78
J. Comput. Syst. Sci.
6
https://doi.org/10.1016/j.jcss.2011.12.005
https://www.wikidata.org/entity/Q61677877
db/journals/jcss/jcss78.html#CrochemoreIKRRW12
Maxime Crochemore
Costas S. Iliopoulos
Marcin Kubica
Wojciech Rytter
Tomasz Walen
Efficient algorithms for three variants of the LPF table.
51-61
2012
11
J. Discrete Algorithms
https://doi.org/10.1016/j.jda.2011.02.002
db/journals/jda/jda11.html#CrochemoreIKRW12
Maxime Crochemore
Marcin Kubica
Jakub Radoszewski
Wojciech Rytter
Tomasz Walen
On the maximal sum of exponents of runs in a string.
29-36
2012
14
J. Discrete Algorithms
https://doi.org/10.1016/j.jda.2011.12.016
db/journals/jda/jda14.html#CrochemoreKRRW12
Maxime Crochemore
Laura Giambruno
Alessio Langiu
Filippo Mignosi
Antonio Restivo
Dictionary-symbolwise flexible parsing.
74-90
2012
14
J. Discrete Algorithms
https://doi.org/10.1016/j.jda.2011.12.021
db/journals/jda/jda14.html#CrochemoreGLMR12
Michalis Christou
Maxime Crochemore
Ondrej Guth
Costas S. Iliopoulos
Solon P. Pissis
On left and right seeds of a string.
31-44
2012
17
J. Discrete Algorithms
https://doi.org/10.1016/j.jda.2012.10.004
db/journals/jda/jda17.html#ChristouCGIP12
Maxime Crochemore
Costas S. Iliopoulos
Marcin Kubica
M. Sohel Rahman
German Tischler
Tomasz Walen
Improved algorithms for the range next value problem and applications.
23-34
2012
434
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2012.02.015
https://www.wikidata.org/entity/Q61677872
db/journals/tcs/tcs434.html#CrochemoreIKRTW12
Supaporn Chairungsee
Maxime Crochemore
Using minimal absent words to build phylogeny.
109-116
2012
450
Theor. Comput. Sci.
https://doi.org/10.1016/j.tcs.2012.04.031
https://www.wikidata.org/entity/Q61677880
db/journals/tcs/tcs450.html#ChairungseeC12
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.
27-40
2012
CPM
https://doi.org/10.1007/978-3-642-31265-6_3
conf/cpm/2012
db/conf/cpm/cpm2012.html#CrochemoreIKKRRTW12
Ali Alatabbi
Maxime Crochemore
Costas S. Iliopoulos
Tewogboye A. Okanlawon
Overlapping repetitions in weighted sequence.
435-440
2012
CUBE
https://doi.org/10.1145/2381716.2381798
conf/cube/2012
db/conf/cube/cube2012.html#AlatabbiCIO12
Ali Alatabbi
Maxime Crochemore
Jacqueline W. Daykin
Laurent Mouchard
Lyndon fountains and the Burrows-Wheeler transform.
441-446
2012
CUBE
https://doi.org/10.1145/2381716.2381799
conf/cube/2012
db/conf/cube/cube2012.html#AlatabbiCDM12
Golnaz Badkobeh
Maxime Crochemore
Chalita Toopsuwan
Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time.
61-72
2012
SPIRE
https://doi.org/10.1007/978-3-642-34109-0_8
conf/spire/2012
db/conf/spire/spire2012.html#BadkobehCT12
Michalis Christou
Maxime Crochemore
Costas S. Iliopoulos
Quasiperiodicities in Fibonacci strings
http://arxiv.org/abs/1201.6162
2012
CoRR
abs/1201.6162
db/journals/corr/corr1201.html#abs-1201-6162
Michalis Christou
Maxime Crochemore
Costas S. Iliopoulos
Identifying all abelian periods of a string in quadratic time and relevant problems
http://arxiv.org/abs/1207.1307
2012
CoRR
abs/1207.1307
db/journals/corr/corr1207.html#abs-1207-1307
Golnaz Badkobeh
Maxime Crochemore
Fewest repetitions in infinite binary words
http://arxiv.org/abs/1207.5723
2012
CoRR
abs/1207.5723
db/journals/corr/corr1207.html#abs-1207-5723
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
http://arxiv.org/abs/1208.3313
2012
CoRR
abs/1208.3313
db/journals/corr/corr1208.html#abs-1208-3313
Maxime Crochemore
Alessio Langiu
Filippo Mignosi
The Rightmost Equal-Cost Position Problem
http://arxiv.org/abs/1211.5108
2012
CoRR
abs/1211.5108
db/journals/corr/corr1211.html#abs-1211-5108
Maxime Crochemore
Alessio Langiu
Filippo Mignosi
Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression
http://arxiv.org/abs/1211.5350
2012
CoRR
abs/1211.5350
db/journals/corr/corr1211.html#abs-1211-5350
Maxime Crochemore
Dov M. Gabbay
Reactive automata.
692-704
2011
209
Inf. Comput.
4
https://doi.org/10.1016/j.ic.2011.01.002
https://www.wikidata.org/entity/Q61677895
db/journals/iandc/iandc209.html#CrochemoreG11
Maxime Crochemore
German Tischler
Computing Longest Previous non-overlapping Factors.
291-295
2011
111
Inf. Process. Lett.
6
https://doi.org/10.1016/j.ipl.2010.12.005
https://www.wikidata.org/entity/Q61677890
db/journals/ipl/ipl111.html#CrochemoreT11
Maxime Crochemore
Lucian Ilie
Liviu Tinta
The "runs" conjecture.
2931-2941
2011
412
Theor. Comput. Sci.
27
https://doi.org/10.1016/j.tcs.2010.06.019
https://www.wikidata.org/entity/Q61677897
db/journals/tcs/tcs412.html#CrochemoreIT11
Marie-Pierre Béal
Maxime Crochemore
Bruce E. Moision
Paul H. Siegel
Periodic-Finite-Type Shift Spaces.
3677-3691
2011
57
IEEE Trans. Inf. Theory
6
https://doi.org/10.1109/TIT.2011.2143910
https://www.wikidata.org/entity/Q61677892
db/journals/tit/tit57.html#BealCMS11
Michalis Christou
Maxime Crochemore
Ondrej Guth
Costas S. Iliopoulos
Solon P. Pissis
On the Right-Seed Array of a String.
492-502
2011
COCOON
https://doi.org/10.1007/978-3-642-22685-4_43
conf/cocoon/2011
db/conf/cocoon/cocoon2011.html#ChristouCGIP11
Michalis Christou
Maxime Crochemore
Costas S. Iliopoulos
Marcin Kubica
Solon P. Pissis
Jakub Radoszewski
Wojciech Rytter
Bartosz Szreder
Tomasz Walen
Efficient Seeds Computation Revisited.
350-363
2011
CPM
https://doi.org/10.1007/978-3-642-21458-5_30
conf/cpm/2011
db/conf/cpm/cpm2011.html#ChristouCIKPRRSW11
Golnaz Badkobeh
Supaporn Chairungsee
Maxime Crochemore
Hunting Redundancies in Strings.
1-14
2011
Developments in Language Theory
https://doi.org/10.1007/978-3-642-22321-1_1
conf/dlt/2011
db/conf/dlt/dlt2011.html#BadkobehCC11
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.
338-343
2011
SPIRE
https://doi.org/10.1007/978-3-642-24583-1_33
conf/spire/2011
db/conf/spire/spire2011.html#ChristouCFIJMP11
Supaporn Chairungsee
Maxime Crochemore
Building Phylogeny with Minimal Absent Words.
100-109
2011
CIAA
https://doi.org/10.1007/978-3-642-22256-6_10
conf/wia/2011
db/conf/wia/ciaa2011.html#ChairungseeC11
Golnaz Badkobeh
Maxime Crochemore
Finite-Repetition threshold for infinite ternary words
WORDS
2011
37-43
https://doi.org/10.4204/EPTCS.63.7
http://arxiv.org/abs/1108.3619
journals/corr/abs-1108-3412
db/series/eptcs/eptcs63.html#abs-1108-3619
Michalis Christou
Maxime Crochemore
Costas S. Iliopoulos
Marcin Kubica
Solon P. Pissis
Jakub Radoszewski
Wojciech Rytter
Bartosz Szreder
Tomasz Walen
Efficient Seeds Computation Revisited
http://arxiv.org/abs/1104.3153
2011
CoRR
abs/1104.3153
db/journals/corr/corr1104.html#abs-1104-3153
Maxime Crochemore
Lila Kari
Mehryar Mohri
Dirk Nowotka
Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081).
47-66
2011
1
Dagstuhl Reports
2
https://doi.org/10.4230/DagRep.1.2.47
db/journals/dagstuhl-reports/dagstuhl-reports1.html#CrochemoreKMN11
Maxime Crochemore
Marcin Kubica
Tomasz Walen
Costas S. Iliopoulos
M. Sohel Rahman
Finding Patterns In Given Intervals.
173-186
2010
101
Fundam. Informaticae
3
https://doi.org/10.3233/FI-2010-283
https://www.wikidata.org/entity/Q99204934
db/journals/fuin/fuin101.html#CrochemoreKWIR10
Maxime Crochemore
Ely Porat
Fast computation of a longest increasing subsequence and application.
1054-1059
2010
208
Inf. Comput.
9
https://doi.org/10.1016/j.ic.2010.04.003
https://www.wikidata.org/entity/Q61677901
db/journals/iandc/iandc208.html#CrochemoreP10
Maxime Crochemore
Szilárd Zsolt Fazekas
Costas S. Iliopoulos
Inuka Jayasekera
Number of Occurrences of powers in Strings.
535-547
2010
21
Int. J. Found. Comput. Sci.
4
https://doi.org/10.1142/S0129054110007416
https://www.wikidata.org/entity/Q61677904
db/journals/ijfcs/ijfcs21.html#CrochemoreFIJ10
Maxime Crochemore
Costas S. Iliopoulos
Solon P. Pissis
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches.
92-101
2010
Algorithms and Applications
https://doi.org/10.1007/978-3-642-12476-1_6
conf/birthday/2010ukkonen
db/conf/birthday/ukkonen2010.html#CrochemoreIP10
Maxime Crochemore
Costas S. Iliopoulos
Solon P. Pissis
German Tischler
Cover Array String Reconstruction.
251-259
2010
CPM
https://doi.org/10.1007/978-3-642-13509-5_23
conf/cpm/2010
db/conf/cpm/cpm2010.html#CrochemoreIPT10
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.
299-309
2010
CPM
https://doi.org/10.1007/978-3-642-13509-5_27
conf/cpm/2010
db/conf/cpm/cpm2010.html#CrochemoreCIKRRW10
Maxime Crochemore
Marcin Kubica
Jakub Radoszewski
Wojciech Rytter
Tomasz Walen
On the Maximal Sum of Exponents of Runsin a String.
10-19
2010
IWOCA
https://doi.org/10.1007/978-3-642-19222-7_2
conf/iwoca/2010
db/conf/iwoca/iwoca2010.html#CrochemoreKRRW10
Maxime Crochemore
Laura Giambruno
Alessio Langiu
Filippo Mignosi
Antonio Restivo
Dictionary-Symbolwise Flexible Parsing.
390-403
2010
IWOCA
https://doi.org/10.1007/978-3-642-19222-7_38
conf/iwoca/2010
db/conf/iwoca/iwoca2010.html#CrochemoreGLMR10
Maxime Crochemore
Costas S. Iliopoulos
Marcin Kubica
Jakub Radoszewski
Wojciech Rytter
Tomasz Walen
On the Maximal Number of Cubic Runs in a String.
227-238
2010
LATA
https://doi.org/10.1007/978-3-642-13089-2_19
https://www.wikidata.org/entity/Q61677905
conf/lata/2010
db/conf/lata/lata2010.html#CrochemoreIKRRW10
Maxime Crochemore
Costas S. Iliopoulos
Marcin Kubica
Wojciech Rytter
Tomasz Walen
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays.
296-307
2010
SOFSEM
https://doi.org/10.1007/978-3-642-11266-9_25
conf/sofsem/2010
db/conf/sofsem/sofsem2010.html#CrochemoreIKRW10
Maxime Crochemore
Costas S. Iliopoulos
Marcin Kubica
Jakub Radoszewski
Wojciech Rytter
Tomasz Walen
Extracting Powers and Periods in a String from Its Runs Structure.
258-269
2010
SPIRE
https://doi.org/10.1007/978-3-642-16321-0_27
conf/spire/2010
db/conf/spire/spire2010.html#CrochemoreIKRRW10
Maxime Crochemore
German Tischler
The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching.
359-364
2010
SPIRE
https://doi.org/10.1007/978-3-642-16321-0_37
conf/spire/2010
db/conf/spire/spire2010.html#CrochemoreT10
Maxime Crochemore
Dov M. Gabbay
Reactive Links to Save Automata States.
1-8
2010
Stringology
http://www.stringology.org/event/2010/p01.html
conf/stringology/2010
db/conf/stringology/stringology2010.html#CrochemoreG10
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.
138-149
2010
Stringology
http://www.stringology.org/event/2010/p12.html
conf/stringology/2010
db/conf/stringology/stringology2010.html#CrochemoreIKRRSW10
Golnaz Badkobeh
Maxime Crochemore
Bounded Number of Squares in Infinite Repetition-Constrained Binary Words.
161-166
2010
Stringology
http://www.stringology.org/event/2010/p14.html
conf/stringology/2010
db/conf/stringology/stringology2010.html#BadkobehC10
Maxime Crochemore
Marcin Kubica
Jakub Radoszewski
Wojciech Rytter
Tomasz Walen
On the maximal sum of exponents of runs in a string
http://arxiv.org/abs/1003.4866
2010
CoRR
abs/1003.4866
db/journals/corr/corr1003.html#abs-1003-4866
Maxime Crochemore
Chiara Epifanio
Alessandra Gabriele
Filippo Mignosi
From Nerode's congruence to suffix automata with mismatches.
3471-3480
2009
410
Theor. Comput. Sci.
37
https://doi.org/10.1016/j.tcs.2009.03.011
https://www.wikidata.org/entity/Q61677911
db/journals/tcs/tcs410.html#CrochemoreEGM09
Maxime Crochemore
Lucian Ilie
Wojciech Rytter
Repetitions in strings: Algorithms and combinatorics.
5227-5235
2009
410
Theor. Comput. Sci.
50
https://doi.org/10.1016/j.tcs.2009.08.024
https://www.wikidata.org/entity/Q61677915
db/journals/tcs/tcs410.html#CrochemoreIR09
Maxime Crochemore
Lucian Ilie
Costas S. Iliopoulos
Marcin Kubica
Wojciech Rytter
Tomasz Walen
LPF Computation Revisited.
158-169
2009
IWOCA
https://doi.org/10.1007/978-3-642-10217-2_18
conf/iwoca/2009
db/conf/iwoca/iwoca2009.html#CrochemoreIIKRW09
Julien Clément 0001
Maxime Crochemore
Giuseppina Rindone
Reverse Engineering Prefix Tables.
289-300
2009
STACS
https://doi.org/10.4230/LIPIcs.STACS.2009.1825
conf/stacs/2009
db/conf/stacs/stacs2009.html#ClementCR09
Maxime Crochemore
Laura Giambruno
On-line Construction of a Small Automaton for a Finite Set of Words.
15-28
2009
Stringology
http://www.stringology.org/event/2009/p03.html
conf/stringology/2009
db/conf/stringology/stringology2009.html#CrochemoreG09
Maxime Crochemore
Thierry Lecroq
Suffix Tree.
2876-2880
2009
Encyclopedia of Database Systems
https://doi.org/10.1007/978-0-387-39940-9_1142
reference/db/2009
db/reference/db/s.html#CrochemoreL09
Maxime Crochemore
Thierry Lecroq
Trie.
3179-3182
2009
Encyclopedia of Database Systems
https://doi.org/10.1007/978-0-387-39940-9_1143
reference/db/2009
db/reference/db/t.html#CrochemoreL09a
Maxime Crochemore
Costas S. Iliopoulos
Marcin Kubica
Jakub Radoszewski
Wojciech Rytter
Tomasz Walen
On the maximal number of highly periodic runs in a string
http://arxiv.org/abs/0907.2157
2009
CoRR
abs/0907.2157
db/journals/corr/corr0907.html#abs-0907-2157
Kangho Roh
Maxime Crochemore
Costas S. Iliopoulos
Kunsoo Park
External Memory Algorithms for String Problems.
17-32
2008
84
Fundam. Informaticae
1
http://content.iospress.com/articles/fundamenta-informaticae/fi84-1-03
db/journals/fuin/fuin84.html#RohCIP08
Maxime Crochemore
Lucian Ilie
Computing Longest Previous Factor in linear time and applications.
75-80
2008
106
Inf. Process. Lett.
2
https://doi.org/10.1016/j.ipl.2007.10.006
https://www.wikidata.org/entity/Q56767309
db/journals/ipl/ipl106.html#CrochemoreI08
Maxime Crochemore
Costas S. Iliopoulos
Mohammad Sohel Rahman
Optimal prefix and suffix queries on texts.
320-325
2008
108
Inf. Process. Lett.
5
https://doi.org/10.1016/j.ipl.2008.05.027
https://www.wikidata.org/entity/Q61677924
db/journals/ipl/ipl108.html#CrochemoreIR08
Maxime Crochemore
Lucian Ilie
Maximal repetitions in strings.
796-807
2008
74
J. Comput. Syst. Sci.
5
https://doi.org/10.1016/j.jcss.2007.09.003
https://www.wikidata.org/entity/Q61677921
db/journals/jcss/jcss74.html#CrochemoreI08
Joseph Wun-Tat Chan
Maxime Crochemore
Foreword.
541-542
2008
1
Math. Comput. Sci.
4
https://doi.org/10.1007/s11786-007-0034-2
db/journals/mics/mics1.html#ChanC08
Maxime Crochemore
Danny Hermelin
Gad M. Landau
Dror Rawitz
Stéphane Vialette
Approximating the 2-interval pattern problem.
283-297
2008
395
Theor. Comput. Sci.
2-3
https://doi.org/10.1016/j.tcs.2008.01.007
https://www.wikidata.org/entity/Q61677919
db/journals/tcs/tcs395.html#CrochemoreHLRV08
Maxime Crochemore
Ely Porat
Computing a Longest Increasing Subsequence of Length k in Time O(n log log k).
69-74
2008
BCS Int. Acad. Conf.
http://www.bcs.org/server.php?show=ConWebDoc.22851
conf/bcs/2008
db/conf/bcs/bcs2008.html#CrochemoreP08
Maxime Crochemore
Lucian Ilie
Liviu Tinta
Towards a Solution to the "Runs" Conjecture.
290-302
2008
CPM
https://doi.org/10.1007/978-3-540-69068-9_27
conf/cpm/2008
db/conf/cpm/cpm2008.html#CrochemoreIT08
Maxime Crochemore
Lucian Ilie
William F. Smyth
A Simple Algorithm for Computing the Lempel Ziv Factorization.
482-488
2008
DCC
https://doi.org/10.1109/DCC.2008.36
https://doi.ieeecomputersociety.org/10.1109/DCC.2008.36
https://www.wikidata.org/entity/Q56783714
conf/dcc/2008
db/conf/dcc/dcc2008.html#CrochemoreIS08
Maxime Crochemore
Szilárd Zsolt Fazekas
Costas S. Iliopoulos
Inuka Jayasekera
Bounds on Powers in Strings.
206-215
2008
Developments in Language Theory
https://doi.org/10.1007/978-3-540-85780-8_16
conf/dlt/2008
db/conf/dlt/dlt2008.html#CrochemoreFIJ08
Maxime Crochemore
Alessandra Gabriele
Filippo Mignosi
Mauriana Pesaresi
On the Longest Common Factor Problem.
143-155
2008
IFIP TCS
https://doi.org/10.1007/978-0-387-09680-3_10
conf/ifipTCS/2008
db/conf/ifipTCS/ifipTCS2008.html#CrochemoreGMP08
Maxime Crochemore
Lucian Ilie
Understanding Maximal Repetitions in Strings.
2008
STACS
11-16
https://doi.org/10.4230/LIPIcs.STACS.2008.1344
conf/stacs/2008
db/conf/stacs/stacs2008.html#CrochemoreI08
Maxime Crochemore
Costas S. Iliopoulos
Marcin Kubica
Mohammad Sohel Rahman
Tomasz Walen
Improved Algorithms for the Range Next Value Problem and Applications.
205-216
2008
STACS
https://doi.org/10.4230/LIPIcs.STACS.2008.1359
conf/stacs/2008
db/conf/stacs/stacs2008.html#IliopoulosCKRW08
Pavlos Antoniou
Maxime Crochemore
Costas S. Iliopoulos
Inuka Jayasekera
Gad M. Landau
Conservative String Covering of Indeterminate Strings.
108-115
2008
Stringology
http://www.stringology.org/event/2008/p10.html
conf/stringology/2008
db/conf/stringology/stringology2008.html#AntoniouCIJL08
Maxime Crochemore
Thierry Lecroq
Alignments and Approximate String Matching.
59-93
2008
New Developments in Formal Languages and Applications
https://doi.org/10.1007/978-3-540-78291-9_3
series/sci/2008-113
db/series/sci/sci113.html#CrochemoreL08
Maxime Crochemore
Thierry Lecroq
Sequential Exact String Matching.
2008
Encyclopedia of Algorithms
https://doi.org/10.1007/978-0-387-30162-4_365
reference/algo/2008
db/reference/algo/algo2008.html#CrochemoreL08
Maxime Crochemore
Thierry Lecroq
Sequential Multiple String Matching.
2008
Encyclopedia of Algorithms
https://doi.org/10.1007/978-0-387-30162-4_366
reference/algo/2008
db/reference/algo/algo2008.html#CrochemoreL08a
Maxime Crochemore
Wojciech Rytter
Squares and Repetitions.
2008
Encyclopedia of Algorithms
https://doi.org/10.1007/978-0-387-30162-4_392
reference/algo/2008
db/reference/algo/algo2008.html#CrochemoreR08
Maxime Crochemore
Lucian Ilie
Understanding maximal repetitions in strings
http://arxiv.org/abs/0802.2829
2008
CoRR
abs/0802.2829
db/journals/corr/corr0802.html#abs-0802-2829
Maxime Crochemore
Christophe Hancart
Thierry Lecroq
Algorithms on strings.
I-VIII, 1-383
Cambridge University Press
2007
978-0-521-84899-2
Maxime Crochemore
Lucian Ilie
Emine Seid-Hilmi
The Structure of Factor Oracles.
781-797
2007
18
Int. J. Found. Comput. Sci.
4
https://doi.org/10.1142/S0129054107004978
https://www.wikidata.org/entity/Q61677934
db/journals/ijfcs/ijfcs18.html#CrochemoreIS07
Emilios Cambouropoulos
Maxime Crochemore
Costas S. Iliopoulos
Manal Mohamed 0001
Marie-France Sagot
All maximal-pairs in step-leap representation of melodic sequence.
1954-1962
2007
177
Inf. Sci.
9
https://doi.org/10.1016/j.ins.2006.11.012
https://www.wikidata.org/entity/Q61677929
db/journals/isci/isci177.html#CambouropoulosCIMS07
Marie-Pierre Béal
Maxime Crochemore
Minimizing local automata.
1376-1380
2007
ISIT
https://doi.org/10.1109/ISIT.2007.4557131
https://www.wikidata.org/entity/Q61677933
conf/isit/2007
db/conf/isit/isit2007.html#BealC07
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.
57-66
2007
LATA
conf/lata/2007
db/conf/lata/lata2007.html#AntoniouCIP07
Maxime Crochemore
Lucian Ilie
Analysis of Maximal Repetitions in Strings.
465-476
2007
conf/mfcs/2007
MFCS
https://doi.org/10.1007/978-3-540-74456-6_42
db/conf/mfcs/mfcs2007.html#CrochemoreI07
Maxime Crochemore
Costas S. Iliopoulos
M. Sohel Rahman
Finding Patterns in Given Intervals.
645-656
2007
conf/mfcs/2007
MFCS
https://doi.org/10.1007/978-3-540-74456-6_57
db/conf/mfcs/mfcs2007.html#CrochemoreIR07
Maxime Crochemore
Chiara Epifanio
Alessandra Gabriele
Filippo Mignosi
On the Suffix Automaton with Mismatches.
144-156
2007
conf/wia/2007
CIAA
https://doi.org/10.1007/978-3-540-76336-9_15
db/conf/wia/ciaa2007.html#CrochemoreEGM07
Maxime Crochemore
Costas S. Iliopoulos
Manal Mohamed 0001
Marie-France Sagot
Longest repeats with a block of k don't cares.
248-254
2006
362
Theor. Comput. Sci.
1-3
https://doi.org/10.1016/j.tcs.2006.06.029
https://www.wikidata.org/entity/Q61677935
db/journals/tcs/tcs362.html#CrochemoreIMS06
Maxime Crochemore
Lucian Ilie
Emine Seid-Hilmi
Factor Oracles.
78-89
2006
conf/wia/2006
CIAA
https://doi.org/10.1007/11812128_9
db/conf/wia/ciaa2006.html#CrochemoreIS06
Maxime Crochemore
Thierry Lecroq
Text Searching and Indexing.
43-80
2006
Recent Advances in Formal Languages and Applications
https://doi.org/10.1007/978-3-540-33461-3_3
series/sci/2006-25
db/series/sci/sci25.html#CrochemoreL06
Ricardo A. Baeza-Yates
Maxime Crochemore
Foreword.
125
2005
3
J. Discrete Algorithms
2-4
https://doi.org/10.1016/j.jda.2004.08.001
db/journals/jda/jda3.html#Baeza-YatesC05
Maxime Crochemore
Costas S. Iliopoulos
Gonzalo Navarro 0001
Yoan J. Pinzón
Alejandro Salinger
Bit-parallel (delta, gamma)-matching and suffix automata.
198-214
2005
3
J. Discrete Algorithms
2-4
https://doi.org/10.1016/j.jda.2004.08.005
db/journals/jda/jda3.html#CrochemoreINPS05
Nadia Pisanti
Maxime Crochemore
Roberto Grossi
Marie-France Sagot
Bases of Motifs for Generating Repeated Patterns with Wild Cards.
40-50
2005
2
IEEE ACM Trans. Comput. Biol. Bioinform.
1
https://doi.org/10.1109/TCBB.2005.5
https://doi.ieeecomputersociety.org/10.1109/TCBB.2005.5
https://dl.acm.org/doi/10.1109/TCBB.2005.5
https://www.wikidata.org/entity/Q42600814
db/journals/tcbb/tcbb2.html#PisantiCGS05
Maxime Crochemore
Jacques Désarménien
Dominique Perrin
A note on the Burrows - CWheeler transformation.
567-572
2005
332
Theor. Comput. Sci.
1-3
https://doi.org/10.1016/j.tcs.2004.11.014
https://www.wikidata.org/entity/Q61677938
db/journals/tcs/tcs332.html#CrochemoreDP05
Marie-Pierre Béal
Maxime Crochemore
Gabriele Fici
Presentations of constrained systems with unconstrained positions.
1891-1900
2005
51
IEEE Trans. Inf. Theory
5
https://doi.org/10.1109/TIT.2005.846423
https://www.wikidata.org/entity/Q61677942
db/journals/tit/tit51.html#BealCF05
Maxime Crochemore
Danny Hermelin
Gad M. Landau
Stéphane Vialette
Approximating the 2-Interval Pattern Problem.
426-437
2005
conf/esa/2005
ESA
https://doi.org/10.1007/11561071_39
db/conf/esa/esa2005.html#CrochemoreHLV05
Emilios Cambouropoulos
Maxime Crochemore
Costas S. Iliopoulos
Manal Mohamed 0001
Marie-France Sagot
A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories.
167-174
2005
conf/ismir/2005
ISMIR
http://ismir2005.ismir.net/proceedings/1022.pdf
db/conf/ismir/ismir2005.html#CambouropoulosCIMS05
Alberto Apostolico
Maxime Crochemore
Kunsoo Park
Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings
3537
2005
3-540-26201-6
CPM
Lecture Notes in Computer Science
Springer
https://doi.org/10.1007/b137128
db/conf/cpm/cpm2005.html
Maxime Crochemore
Jacques Désarménien
Dominique Perrin
A note on the Burrows-Wheeler transformation
http://arxiv.org/abs/cs/0502073
2005
CoRR
abs/cs/0502073
db/journals/corr/corr0502.html#abs-cs-0502073
Amihood Amir
Ayelet Butman
Maxime Crochemore
Gad M. Landau
Malka Schaps
Two-dimensional pattern matching with rotations.
173-187
2004
314
Theor. Comput. Sci.
1-2
https://doi.org/10.1016/j.tcs.2003.10.039
https://www.wikidata.org/entity/Q61677950
db/journals/tcs/tcs314.html#AmirBCLS04
Maxime Crochemore
Chiara Epifanio
Roberto Grossi
Filippo Mignosi
A Trie-Based Approach for Compacting Automata.
145-158
https://doi.org/10.1007/978-3-540-27801-6_11
2004
conf/cpm/2004
CPM
db/conf/cpm/cpm2004.html#CrochemoreEGM04
Maxime Crochemore
Costas S. Iliopoulos
Manal Mohamed 0001
Marie-France Sagot
Longest Repeats with a Block of Don't Cares.
271-278
https://doi.org/10.1007/978-3-540-24698-5_31
https://www.wikidata.org/entity/Q61677945
2004
conf/latin/2004
LATIN
db/conf/latin/latin2004.html#CrochemoreIMS04
Maxime Crochemore
Raffaele Giancarlo
Marie-France Sagot
Longest Motifs with a Functionally Equivalent Central Block.
298-209
https://doi.org/10.1007/978-3-540-30213-1_42
2004
conf/spire/2004
SPIRE
db/conf/spire/spire2004.html#CrochemoreGS04
Maxime Crochemore
Costas S. Iliopoulos
Thierry Lecroq
Occurrence and Substring Heuristics for i-Matching.
1-21
2003
56
Fundam. Informaticae
1-2
http://content.iospress.com/articles/fundamenta-informaticae/fi56-1-2-02
db/journals/fuin/fuin56.html#CrochemoreIL03
Maxime Crochemore
Costas S. Iliopoulos
Yoan J. Pinzón
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
89-103
2003
56
Fundam. Informaticae
1-2
http://content.iospress.com/articles/fundamenta-informaticae/fi56-1-2-06
db/journals/fuin/fuin56.html#CrochemoreIP03
Marie-Pierre Béal
Maxime Crochemore
Filippo Mignosi
Antonio Restivo
Marinella Sciortino
Computing forbidden words of regular languages.
121-135
2003
56
Fundam. Informaticae
1-2
http://content.iospress.com/articles/fundamenta-informaticae/fi56-1-2-08
db/journals/fuin/fuin56.html#BealCM03
Maxime Crochemore
Valery T. Stefanov
Waiting time and complexity for matching patterns with automata.
119-125
2003
87
Inf. Process. Lett.
3
https://doi.org/10.1016/S0020-0190(03)00271-0
https://www.wikidata.org/entity/Q61677956
db/journals/ipl/ipl87.html#CrochemoreS03
Maxime Crochemore
Christophe Hancart
Thierry Lecroq
A unifying look at the Apostolico-Giancarlo string-matching algorithm.
37-52
2003
1
J. Discrete Algorithms
1
https://doi.org/10.1016/S1570-8667(03)00005-4
db/journals/jda/jda1.html#CrochemoreHL03
Maxime Crochemore
Borivoj Melichar
Zdenek Tronícek
Directed acyclic subsequence graph - Overview.
255-280
2003
1
J. Discrete Algorithms
3-4
https://doi.org/10.1016/S1570-8667(03)00029-7
db/journals/jda/jda1.html#CrochemoreMT03
Maxime Crochemore
Gad M. Landau
Michal Ziv-Ukelson
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices.
1654-1673
2003
32
SIAM J. Comput.
6
https://doi.org/10.1137/S0097539702402007
https://www.wikidata.org/entity/Q56813219
db/journals/siamcomp/siamcomp32.html#CrochemoreLZ03
Maxime Crochemore
Reducing space for index implementation.
185-197
2003
292
Theor. Comput. Sci.
1
db/journals/tcs/tcs292.html#Crochemore03
https://doi.org/10.1016/S0304-3975(01)00222-5
https://www.wikidata.org/entity/Q61677954
Amihood Amir
Ayelet Butman
Maxime Crochemore
Gad M. Landau
Malka Schaps
Two-Dimensional Pattern Matching with Rotations.
17-31
2003
conf/cpm/2003
CPM
https://doi.org/10.1007/3-540-44888-8_2
db/conf/cpm/cpm2003.html#AmirBCLS03
Nadia Pisanti
Maxime Crochemore
Roberto Grossi
Marie-France Sagot
A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum.
622-631
https://doi.org/10.1007/978-3-540-45138-9_56
2003
conf/mfcs/2003
MFCS
db/conf/mfcs/mfcs2003.html#PisantiCGS03
Maxime Crochemore
Costas S. Iliopoulos
Gonzalo Navarro 0001
Yoan J. Pinzón
A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval.
211-223
https://doi.org/10.1007/978-3-540-39984-1_16
https://www.wikidata.org/entity/Q90414195
2003
conf/spire/2003
SPIRE
db/conf/spire/spire2003.html#CrochemoreINP03
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
CPM
Lecture Notes in Computer Science
2676
Springer
2003
3-540-40311-6
https://doi.org/10.1007/3-540-44888-8
db/conf/cpm/cpm2003.html
Maxime Crochemore
Wojciech Rytter
Jewels of stringology.
I-X, 1-310
World Scientific
2002
978-981-02-4782-9
https://doi.org/10.1142/4838
http://www-igm.univ-mlv.fr/~mac/JOS/JOS.html
http://books.google.de/books/about/Jewels_of_Stringology.html?id=9NdohJXtIyYC
Emilios Cambouropoulos
Maxime Crochemore
Costas S. Iliopoulos
Laurent Mouchard
Yoan J. Pinzón
Algorithms for Computing Approximate Repetitions in Musical Sequences.
1135-1148
2002
79
Int. J. Comput. Math.
11
https://doi.org/10.1080/00207160213939
db/journals/ijcm/ijcm79.html#CambouropoulosCIMP02
Maxime Crochemore
Costas S. Iliopoulos
Christos Makris
Wojciech Rytter
Athanasios K. Tsakalidis
T. Tsichlas
Approximate String Matching with Gaps.
54-65
2002
9
Nord. J. Comput.
1
db/journals/njc/njc9.html#CrochemoreIMRTT02
Maxime Crochemore
Costas S. Iliopoulos
Thierry Lecroq
Wojciech Plandowski
Wojciech Rytter
Three Heuristics for delta-Matching: delta-BM Algorithms.
178-189
2002
conf/cpm/2002
CPM
https://doi.org/10.1007/3-540-45452-7_16
db/conf/cpm/cpm2002.html#CrochemoreILPR02
Maxime Crochemore
Gonzalo Navarro 0001
Improved Antidictionary Based Compression.
7-13
2002
conf/sccc/2002
SCCC
https://doi.org/10.1109/SCCC.2002.1173168
https://doi.ieeecomputersociety.org/10.1109/SCCC.2002.1173168
db/conf/sccc/sccc2002.html#CrochemoreN02
Maxime Crochemore
Gad M. Landau
Michal Ziv-Ukelson
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices.
679-688
2002
conf/soda/2002
SODA
http://dl.acm.org/citation.cfm?id=545381.545472
db/conf/soda/soda2002.html#CrochemoreLZ02
Maxime Crochemore
Zdenek Tronícek
On the Size of DASG for Multiple Texts.
58-64
https://doi.org/10.1007/3-540-45735-6_6
2002
conf/spire/2002
SPIRE
db/conf/spire/spire2002.html#CrochemoreT02
Jan Holub 0001
Maxime Crochemore
On the Implementation of Compact DAWG's.
289-294
https://doi.org/10.1007/3-540-44977-9_31
https://dl.acm.org/doi/10.5555/1756384.1756418
2002
conf/wia/2002
CIAA
db/conf/wia/ciaa2002.html#HolubC02
Maxime Crochemore
Costas S. Iliopoulos
Yoan J. Pinzón
Computing Evolutionary Chains in Musical Sequences.
2001
8
Electron. J. Comb.
2
https://doi.org/10.37236/1604
db/journals/combinatorics/combinatorics8.html#CrochemoreIP01
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.
279-285
2001
80
Inf. Process. Lett.
6
https://doi.org/10.1016/S0020-0190(01)00182-X
https://www.wikidata.org/entity/Q61677962
db/journals/ipl/ipl80.html#CrochemoreIPR01
Cyril Allauzen
Maxime Crochemore
Mathieu Raffinot
Efficient Experimental String Matching by Weak Factor Recognition.
51-72
2001
conf/cpm/2001
CPM
https://doi.org/10.1007/3-540-48194-X_5
db/conf/cpm/cpm2001.html#AllauzenCR01
Maxime Crochemore
Costas S. Iliopoulos
Yoan J. Pinzón
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
59-67
2001
conf/spire/2001
SPIRE
db/conf/spire/spire2001.html#CrochemoreIP01
https://doi.org/10.1109/SPIRE.2001.989737
https://doi.ieeecomputersociety.org/10.1109/SPIRE.2001.10031
https://www.wikidata.org/entity/Q61677965
Maxime Crochemore
Costas S. Iliopoulos
Thierry Lecroq
Yoan J. Pinzón
Approximate String Matching in Musical Sequences.
26-36
2001
Stringology
http://www.stringology.org/event/2001/p3.html
conf/stringology/2001
db/conf/stringology/stringology2001.html#CrochemoreILP01
Maxime Crochemore
Filippo Mignosi
Antonio Restivo
Sergio Salemi
Data compression using antidictionaries.
1756-1768
2000
88
Proc. IEEE
11
https://doi.org/10.1109/5.892711
https://www.wikidata.org/entity/Q61677967
db/journals/pieee/pieee88.html#CrochemoreMRS00
Maxime Crochemore
Costas S. Iliopoulos
Yoan J. Pinzón
Finding Motifs with Gaps.
2000
conf/ismir/2000
ISMIR
http://ismir2000.ismir.net/posters/pinzon.pdf
db/conf/ismir/ismir2000.html#CrochemoreIP00
Maxime Crochemore
Costas S. Iliopoulos
Yoan J. Pinzón
Fast Evolutionary Chains.
307-318
https://doi.org/10.1007/3-540-44411-4_19
2000
conf/sofsem/2000
SOFSEM
db/conf/sofsem/sofsem2000.html#CrochemoreIP00
Maxime Crochemore
Renaud Vérin
Zones of Low Entropy in Genomic Sequences.
275-282
1999
23
Comput. Chem.
3-4
https://doi.org/10.1016/S0097-8485(99)00009-1
https://www.wikidata.org/entity/Q61677973
db/journals/candc/candc23.html#CrochemoreV99
Maxime Crochemore
Artur Czumaj
Leszek Gasieniec
Thierry Lecroq
Wojciech Plandowski
Wojciech Rytter
Fast Practical Multi-Pattern Matching.
107-113
1999
71
Inf. Process. Lett.
3-4
db/journals/ipl/ipl71.html#CrochemoreCGLPR99
https://doi.org/10.1016/S0020-0190(99)00092-7
https://www.wikidata.org/entity/Q61677971
Maxime Crochemore
Leszek Gasieniec
Wojciech Rytter
Constant-Space String-Matching in Sublinear Average Time.
197-203
1999
218
Theor. Comput. Sci.
1
db/journals/tcs/tcs218.html#CrochemoreGR99
https://doi.org/10.1016/S0304-3975(98)00259-X
https://www.wikidata.org/entity/Q61677968
Maxime Crochemore
Filippo Mignosi
Antonio Restivo
Sergio Salemi
Text Compression Using Antidictionaries.
261-270
https://doi.org/10.1007/3-540-48523-6_23
https://www.wikidata.org/entity/Q60163037
1999
conf/icalp/99
ICALP
db/conf/icalp/icalp99.html#CrochemoreMRS99
Cyril Allauzen
Maxime Crochemore
Mathieu Raffinot
Factor Oracle: A New Structure for Pattern Matching.
295-310
https://doi.org/10.1007/3-540-47849-3_18
1999
conf/sofsem/1999
SOFSEM
db/conf/sofsem/sofsem1999.html#AllauzenCR99
Maxime Crochemore
Christophe Hancart
Pattern Matching in Strings.
1999
Algorithms and Theory of Computation Handbook
https://doi.org/10.1201/9781420049503-c12
books/crc/99/A1999
db/books/collections/A1999.html#CrochemoreH99
Maxime Crochemore
Thierry Lecroq
Text Data Compression Algorithms.
1999
Algorithms and Theory of Computation Handbook
https://doi.org/10.1201/9781420049503-c13
books/crc/99/A1999
db/books/collections/A1999.html#CrochemoreL99
Maxime Crochemore
Mike Paterson
Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings
CPM
Lecture Notes in Computer Science
1645
Springer
1999
3-540-66278-2
https://doi.org/10.1007/3-540-48452-3
db/conf/cpm/cpm99.html
Maxime Crochemore
Costas S. Iliopoulos
Maureen Korda
Two-Dimensional Prefix String Matching and Covering on Square Matrices.
353-373
1998
20
Algorithmica
4
db/journals/algorithmica/algorithmica20.html#CrochemoreIK98
https://doi.org/10.1007/PL00009200
Maxime Crochemore
Filippo Mignosi
Antonio Restivo
Automata and Forbidden Words.
111-117
1998
67
Inf. Process. Lett.
3
db/journals/ipl/ipl67.html#CrochemoreMR98
https://doi.org/10.1016/S0020-0190(98)00104-5
https://www.wikidata.org/entity/Q61677976
Maxime Crochemore
Leszek Gasieniec
Ramesh Hariharan
S. Muthukrishnan 0001
Wojciech Rytter
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching.
668-681
1998
27
SIAM J. Comput.
3
db/journals/siamcomp/siamcomp27.html#CrochmoreGHMR98
https://doi.org/10.1137/S0097539795280068
https://www.wikidata.org/entity/Q61677974
Maxime Crochemore
Filippo Mignosi
Antonio Restivo
Minimal Forbidden Words and Factor Automata.
665-673
1998
conf/mfcs/1998
MFCS
https://doi.org/10.1007/BFb0055817
db/conf/mfcs/mfcs98.html#CrochemoreMR98
Maxime Crochemore
Thierry Lecroq
Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm.
195-203
1997
63
Inf. Process. Lett.
4
db/journals/ipl/ipl63.html#CrochemoreL97
https://doi.org/10.1016/S0020-0190(97)00107-5
Maxime Crochemore
Zvi Galil
Leszek Gasieniec
Kunsoo Park
Wojciech Rytter
Constant-Time Randomized Parallel String Matching.
950-960
1997
26
SIAM J. Comput.
4
db/journals/siamcomp/siamcomp26.html#CrochemoreGGPR97
https://doi.org/10.1137/S009753979528007X
Maxime Crochemore
Renaud Vérin
On Compact Directed Acyclic Word Graphs.
192-211
1997
conf/birthday/1997ehrenfeucht
Structures in Logic and Computer Science
db/conf/birthday/ehrenfeucht97.html#CrochemoreV97
https://doi.org/10.1007/3-540-63246-8_12
https://www.wikidata.org/entity/Q90413885
Maxime Crochemore
Renaud Vérin
Direct Construction of Compact Directed Acyclic Word Graphs.
116-129
1997
conf/cpm/1997
CPM
db/conf/cpm/cpm97.html#CrochemoreV97
https://doi.org/10.1007/3-540-63220-4_55
https://www.wikidata.org/entity/Q55892827
Maxime Crochemore
Leszek Gasieniec
Wojciech Rytter
Constant-space string-matching in sublinear average time.
230-239
1997
SEQUENCES
https://doi.org/10.1109/SEQUEN.1997.666918
https://www.wikidata.org/entity/Q61677979
conf/sequences/1997
db/conf/sequences/sequences1997.html#CrochemoreGR97
Maxime Crochemore
Off-line serial exact string searching.
1-53
1997
Pattern Matching Algorithms
books/ox/AG1997
db/books/collections/AG1997.html#Crochemore97
Maxime Crochemore
Christophe Hancart
Automata for Matching Patterns.
399-462
1997
Handbook of Formal Languages (2)
https://doi.org/10.1007/978-3-662-07675-0_9
https://www.wikidata.org/entity/Q90413384
reference/hfl/1997-2
db/reference/hfl/hfl2.html#CrochemoreH97
Maxime Crochemore
Thierry Lecroq
Pattern Matching and Text Compression Algorithms.
161-202
1997
books/crc/tucker1997
The Computer Science and Engineering Handbook
db/books/collections/tucker97.html#CrochemoreL97
Maxime Crochemore
Thierry Lecroq
Pattern-Matching and Text-Compression Algorithms.
39-41
1996
28
ACM Comput. Surv.
1
db/journals/csur/csur28.html#CrochemoreL96
https://doi.org/10.1145/234313.234331
Nadia El-Mabrouk
Maxime Crochemore
Boyer-Moore Strategy to Efficient Approximate String Matching.
24-38
1996
conf/cpm/1996
CPM
db/conf/cpm/cpm96.html#El-MabroukC96
https://doi.org/10.1007/3-540-61258-0_2
Maxime Crochemore
Wojciech Rytter
Squares, Cubes, and Time-Space Efficient String Searching.
405-425
1995
13
Algorithmica
5
db/journals/algorithmica/algorithmica13.html#CrochemoreR95
https://doi.org/10.1007/BF01190846
Alberto Apostolico
Maxime Crochemore
Fast Parallel Lyndon Factorization with Applications.
89-108
1995
28
2
Math. Syst. Theory
db/journals/mst/mst28.html#ApostolicoC95
https://doi.org/10.1007/BF01191471
Maxime Crochemore
Wojciech Rytter
On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching.
220-229
1995
conf/latin/1995
LATIN
db/conf/latin/latin95.html#CrochemoreR95
https://doi.org/10.1007/3-540-59175-3_91
Maxime Crochemore
Leszek Gasieniec
Wojciech Plandowski
Wojciech Rytter
Two-Dimensional Pattern Matching in Linear Time and Small Space.
181-192
1995
conf/stacs/1995
STACS
db/conf/stacs/stacs95.html#CrochemoreGPR95
https://doi.org/10.1007/3-540-59042-0_72
Maxime Crochemore
Wojciech Rytter
Text Algorithms
Oxford University Press
1994
0-19-508609-0
http://www-igm.univ-mlv.fr/~mac/REC/B1.html
http://www.mimuw.edu.pl/~rytter/BOOKS/text-algorithms.pdf
Maxime Crochemore
Artur Czumaj
Leszek Gasieniec
Stefan Jarominek
Thierry Lecroq
Wojciech Plandowski
Wojciech Rytter
Speeding Up Two String-Matching Algorithms.
247-267
1994
12
Algorithmica
4/5
db/journals/algorithmica/algorithmica12.html#CrochemoreCGJLPR94
https://doi.org/10.1007/BF01185427
https://www.wikidata.org/entity/Q60163036
Maxime Crochemore
Wojciech Rytter
On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms.
403-414
1994
132
Theor. Comput. Sci.
2
db/journals/tcs/tcs132.html#CrochemoreR94
https://doi.org/10.1016/0304-3975(94)00012-3
Maxime Crochemore
Dan Gusfield
Combinatorial Pattern Matching, 5th Annual Symposium, CPM 94, Asilomar, California, USA, June 5-8, 1994, Proceedings
CPM
Lecture Notes in Computer Science
807
Springer
1994
3-540-58094-8
https://doi.org/10.1007/3-540-58094-8
db/conf/cpm/cpm94.html
Maxime Crochemore
Leszek Gasieniec
Wojciech Rytter
Two-Dimensional Pattern Matching by Sampling.
159-162
1993
46
Inf. Process. Lett.
4
db/journals/ipl/ipl46.html#CrochemoreGR93
https://doi.org/10.1016/0020-0190(93)90020-A
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
Richard Cole 0001
Maxime Crochemore
Zvi Galil
Leszek Gasieniec
Ramesh Hariharan
S. Muthukrishnan 0001
Kunsoo Park
Wojciech Rytter
248-258
conf/focs/FOCS34
1993
FOCS
db/conf/focs/focs93.html#ColeCGGHMPR93
https://doi.org/10.1109/SFCS.1993.366862
https://doi.ieeecomputersociety.org/10.1109/SFCS.1993.366862
Alberto Apostolico
Maxime Crochemore
Zvi Galil
Udi Manber
Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings
CPM
Lecture Notes in Computer Science
684
Springer
1993
3-540-56764-X
https://doi.org/10.1007/BFb0029791
db/conf/cpm/cpm93.html
Maxime Crochemore
String-Matching on Ordered Alphabets.
33-47
1992
92
Theor. Comput. Sci.
1
db/journals/tcs/tcs92.html#Crochemore92
https://doi.org/10.1016/0304-3975(92)90134-2
Jean Néraud
Maxime Crochemore
A String-Matching Interpretation of the Equation xmyn = zp.
145-164
1992
92
Theor. Comput. Sci.
1
db/journals/tcs/tcs92.html#NeraudC92
https://doi.org/10.1016/0304-3975(92)90140-B
Maxime Crochemore
Wojciech Rytter
Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms.
100-112
1992
conf/icpia/1992
ICPIA
db/conf/icpia/icpia1992.html#CrochemoreR92
https://doi.org/10.1007/3-540-56346-6_33
Maxime Crochemore
Thierry Lecroq
Artur Czumaj
Leszek Gasieniec
Stefan Jarominek
Wojciech Plandowski
Wojciech Rytter
Speeding Up Two String-Matching Algorithms.
589-600
1992
conf/stacs/1992
STACS
db/conf/stacs/stacs92.html#CrochemoreLCGJPR92
https://doi.org/10.1007/3-540-55210-3_215
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
CPM
Lecture Notes in Computer Science
644
Springer
1992
3-540-56024-6
https://doi.org/10.1007/3-540-56024-6
db/conf/cpm/cpm92.html
Optimal Canonization of All Substrings of a String
Alberto Apostolico
Maxime Crochemore
76-95
Inf. Comput.
November
1991
95
1
db/journals/iandc/iandc95.html#ApostolicoC91
https://doi.org/10.1016/0890-5401(91)90016-U
Maxime Crochemore
Pavel Goralcik
Mutually Avoiding Ternary Words of Small Exponent.
407-410
1991
1
Int. J. Algebra Comput.
4
https://doi.org/10.1142/S0218196791000286
db/journals/ijac/ijac1.html#CrochemoreG91
Maxime Crochemore
Wojciech Rytter
Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings.
57-60
1991
38
Inf. Process. Lett.
2
db/journals/ipl/ipl38.html#CrochemoreR91
https://doi.org/10.1016/0020-0190(91)90223-5
Maxime Crochemore
Dominique Perrin
Two-Way String Matching.
651-675
1991
38
J. ACM
3
db/journals/jacm/jacm38.html#CrochemoreP91
https://doi.org/10.1145/116825.116845
Michal Chytil
Maxime Crochemore
Burkhard Monien
Wojciech Rytter
On the Parallel Recognition of Unambiguous Context-Free Languages.
311-316
1991
81
Theor. Comput. Sci.
2
db/journals/tcs/tcs81.html#ChytilCMR91
https://doi.org/10.1016/0304-3975(91)90199-C
Maxime Crochemore
Wojciech Rytter
Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays.
59-82
1991
88
Theor. Comput. Sci.
1
db/journals/tcs/tcs88.html#CrochemoreR91
https://doi.org/10.1016/0304-3975(91)90073-B
https://www.wikidata.org/entity/Q56814566
Maxime Crochemore
Wojciech Rytter
Parallel Construction of Minimal Suffix and Factor Automata.
121-128
1990
35
Inf. Process. Lett.
3
db/journals/ipl/ipl35.html#CrochemoreR90
https://doi.org/10.1016/0020-0190(90)90060-B
Maxime Crochemore
Jean Néraud
Unitary Monoid with Two Generators: An Algorithmic Point of View.
117-131
1990
conf/caap/1990
CAAP
db/conf/caap/caap90.html#CrochemoreN90
https://doi.org/10.1007/3-540-52590-4_44
Maxime Crochemore
Wojciech Rytter
Parallel Construction of Minimal Suffix and Factor Automata.
217-223
1990
conf/mfcs/1990
MFCS
db/conf/mfcs/mfcs90.html#CrochemoreR90
https://doi.org/10.1007/BFb0029611
Maxime Crochemore
Wojciech Rytter
Parallel Computations on Strings and Arrays.
109-125
1990
conf/stacs/1990
STACS
db/conf/stacs/stacs90.html#CrochemoreR90
https://doi.org/10.1007/3-540-52282-4_36
Jean Berstel
Maxime Crochemore
Jean-Eric Pin
Thue-Morse sequence and p-adic topology for the free monoid.
89-94
1989
76
Discret. Math.
2
https://doi.org/10.1016/0012-365X(89)90302-6
https://www.wikidata.org/entity/Q61677980
db/journals/dm/dm76.html#BerstelCP89
Maxime Crochemore
String-matching and periods.
149-153
1989
39
Bull. EATCS
db/journals/eatcs/eatcs39.html#Crochemore89
Maxime Crochemore
Dominique Perrin
Critical factorizations of words.
47-51
1988
34
Bull. EATCS
db/journals/eatcs/eatcs34.html#CrochemoreP88
Maxime Crochemore
Constant-Space String-Matching.
80-87
1988
conf/fsttcs/1988
FSTTCS
db/conf/fsttcs/fsttcs88.html#Crochemore88
https://doi.org/10.1007/3-540-50517-2_72
Maxime Crochemore
Algorithms and automata.
166-175
1988
conf/litp/1988
Formal Properties of Finite Automata and Applications
db/conf/litp/litp1988.html#Crochemore88
https://doi.org/10.1007/BFb0013119
Maxime Crochemore
String Matching with Constraints.
44-58
1988
conf/mfcs/1988
MFCS
db/conf/mfcs/mfcs88.html#Crochemore88
https://doi.org/10.1007/BFb0017130
Maxime Crochemore
Data Compression with Substitution.
1-16
1987
conf/litp/1987
Electronic Dictionaries and Automata in Computational Linguistics
db/conf/litp/litp1987.html#Crochemore87
https://doi.org/10.1007/3-540-51465-1_1
Maxime Crochemore
Longest Common Factor of Two Words.
26-36
1987
conf/tapsoft/1987-1
TAPSOFT, Vol.1
db/conf/tapsoft/tapsoft87-1.html#Crochemore87
https://doi.org/10.1007/3-540-17660-8_45
Maxime Crochemore
Computing LCF in linear time.
57-60
1986
30
Bull. EATCS
db/journals/eatcs/eatcs30.html#Crochemore86
Jean-Jacques Hébrard
Maxime Crochemore
Calcul de La Distance Par Les Sous-Mots.
441-456
1986
20
RAIRO Theor. Informatics Appl.
4
db/journals/ita/ita20.html#HebrardC86
https://doi.org/10.1051/ita/1986200404411
Maxime Crochemore
Transducers and Repetitions.
63-86
1986
45
Theor. Comput. Sci.
1
db/journals/tcs/tcs45.html#Crochemore86
https://doi.org/10.1016/0304-3975(86)90041-1
https://www.wikidata.org/entity/Q61677987
Maxime Crochemore
Linear Searching for a Squre in a Word (Abstract).
137
1984
conf/icalp/1984
ICALP
db/conf/icalp/icalp84.html#Crochemore84
https://doi.org/10.1007/3-540-13345-3_12
Maxime Crochemore
Michael Le Rest
Philippe Wender
An Optimal Test on Finite Unavoidable Sets of Words.
179-180
1983
16
Inf. Process. Lett.
4
db/journals/ipl/ipl16.html#CrochemoreRW83
https://doi.org/10.1016/0020-0190(83)90119-9
https://www.wikidata.org/entity/Q61677990
Maxime Crochemore
Sharp Characterizations of Squarefree Morphisms.
221-226
1982
18
Theor. Comput. Sci.
db/journals/tcs/tcs18.html#Crochemore82
https://doi.org/10.1016/0304-3975(82)90023-8
https://www.wikidata.org/entity/Q61677998
A. Cardon
Maxime Crochemore
Partitioning a Graph in O(|A| log2 |V|).
85-98
1982
19
Theor. Comput. Sci.
db/journals/tcs/tcs19.html#CardonC82
https://doi.org/10.1016/0304-3975(82)90016-0
https://www.wikidata.org/entity/Q61677993
Maxime Crochemore
An Optimal Algorithm for Computing the Repetitions in a Word.
244-250
1981
12
Inf. Process. Lett.
5
db/journals/ipl/ipl12.html#Crochemore81
https://doi.org/10.1016/0020-0190(81)90024-7
https://www.wikidata.org/entity/Q61677999
A. Cardon
Maxime Crochemore
Détermination de la Représentation Standard d'une Série Reconnaissable.
371-379
1980
14
RAIRO Theor. Informatics Appl.
4
db/journals/ita/ita14.html#CardonC80
https://doi.org/10.1051/ita/1980140403711
Anisa Al-Hafeedh
Ali Alatabbi
Cyril Allauzen
Mai Abdulaziz AlzamelMai Alzamel
Amihood Amir
Mika Amit
Pavlos Antoniou
Alberto Apostolico
Golnaz Badkobeh
Ricardo Baeza-YatesRicardo A. Baeza-Yates
Hideo Bannai
Marie-Pierre Béal
Jean Berstel
Ayelet Butman
Emilios Cambouropoulos
A. Cardon
João A. Carriço
Supaporn Chairungsee
Wun-Tat ChanJoseph Wun-Tat Chan
Panagiotis Charalampopoulos
Edgar Chávez
Manolis Christodoulakis
Michalis Christou
Michal Chytil
Julien Clément 0001
Richard Cole 0001
James D. Currie
Marek Cygan
Artur Czumaj
Jacqueline W. Daykin
Jacques Désarménien
Nadia El-Mabrouk
Jonas Ellert
Chiara Epifanio
Martin Farach-Colton
Szilárd Zsolt Fazekas
Gabriele Fici
Tomás Flouri
Alexandre P. Francisco
Dov M. Gabbay
Alessandra Gabriele
Zvi Galil
Leszek Gasieniec
Laura Giambruno
Raffaele Giancarlo
Pavel Goralcik
Roberto Grossi
Dan Gusfield
Ondrej Guth
Christophe Hancart
Ramesh Hariharan
Jean-Jacques Hébrard
Alice Héliou
Danny Hermelin
Jan Holub 0001
Tomohiro I
Lucian Ilie
Costas S. Iliopoulos
Shunsuke Inenaga
Jan Janousek
Stefan Jarominek
Inuka Jayasekera
Lila Kari
Juha Kärkkäinen
Tomasz Kociumaka
Roman Kolpakov
Evguenia Kopylova
Maureen Korda
Marcin Kubica
Gregory Kucherov
Ritu Kundu
Gad M. Landau
Alessio Langiu
Thierry Lecroq
Zsuzsanna Lipták
Christos Makris
Udi Manber
Borivoj Melichar
Robert Mercas
Filippo Mignosi
Manal Mohamed 0001
Mehryar Mohri
Bruce E. Moision
Burkhard Monien
Laurent Mouchard
Edleno Silva de Moura
S. Muthukrishnan 0001
Joong Chae Na
Gonzalo Navarro 0001
Jean Néraud
Cyril Nicaud
Dirk Nowotka
Tewogboye A. Okanlawon
Jakub Pachocki
Heejin Park
Kunsoo Park
Mike Paterson
Dominique Perrin
Mauriana Pesaresi
Pierre Peterlongo
Jean-Éric PinJean-Eric Pin
Yoan J. Pinzón
Nadia Pisanti
Solon P. Pissis
Wojciech Plandowski
Ely Porat
Jakub Radoszewski
Mathieu Raffinot
Mohammad Sohel RahmanM. Sohel Rahman
Yann Ramusat
Michaël Rao
Dror Rawitz
James F. Reid
Michael Le Rest
Antonio Restivo
Bruno Ribeiro-Gonçalves
Giuseppina Rindone
Kangho Roh
Luís M. S. Russo
Wojciech Rytter
Marie-France Sagot
Sergio Salemi
Alejandro Salinger
Malka Schaps
Marinella Sciortino
Emine Seid-Hilmi
Paul H. Siegel
William F. Smyth
Dina Sokol
Valery T. Stefanov
Krzysztof Stencel
Juliusz Straszynski
Shiho Sugimoto
Bartosz Szreder
Liviu Tinta
German Tischler
Chalita Toopsuwan
Zdenek Tronícek
Athanasios K. Tsakalidis
T. Tsichlas
Wojciech Tyczynski
Fatima Vayani
Cátia Vaz
Renaud Vérin
Stéphane Vialette
Tomasz Walen
Philippe Wender
Munina Yusufu
Michal Ziv-Ukelson
Wiktor Zuba