Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Maxime Crochemore
@inproceedings{DBLP:conf/dlt/BealC23, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore}, editor = {Frank Drewes and Mikhail Volkov}, title = {Fast Detection of Specific Fragments Against a Set of Sequences}, booktitle = {Developments in Language Theory - 27th International Conference, {DLT} 2023, Ume{\aa}, Sweden, June 12-16, 2023, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13911}, pages = {51--60}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-33264-7\_5}, doi = {10.1007/978-3-031-33264-7\_5}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dlt/BealC23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BadkobehC22, author = {Golnaz Badkobeh and Maxime Crochemore}, title = {Linear construction of a left Lyndon tree}, journal = {Inf. Comput.}, volume = {285}, number = {Part}, pages = {104884}, year = {2022}, url = {https://doi.org/10.1016/j.ic.2022.104884}, doi = {10.1016/J.IC.2022.104884}, timestamp = {Tue, 28 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/BadkobehC22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BealC22, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore}, title = {Checking whether a word is Hamming-isometric in linear time}, journal = {Theor. Comput. Sci.}, volume = {933}, pages = {55--59}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.08.032}, doi = {10.1016/J.TCS.2022.08.032}, timestamp = {Tue, 04 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BealC22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BadkobehCEN22, author = {Golnaz Badkobeh and Maxime Crochemore and Jonas Ellert and Cyril Nicaud}, editor = {Hideo Bannai and Jan Holub}, title = {Back-To-Front Online Lyndon Forest Construction}, booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2022, June 27-29, 2022, Prague, Czech Republic}, series = {LIPIcs}, volume = {223}, pages = {13:1--13:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.CPM.2022.13}, doi = {10.4230/LIPICS.CPM.2022.13}, timestamp = {Wed, 22 Jun 2022 16:20:49 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BadkobehCEN22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CrochemoreIRRSW22, author = {Maxime Crochemore and Costas S. Iliopoulos and Jakub Radoszewski and Wojciech Rytter and Juliusz Straszynski and Tomasz Walen and Wiktor Zuba}, editor = {Hideo Bannai and Jan Holub}, title = {Linear-Time Computation of Shortest Covers of All Rotations of a String}, booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2022, June 27-29, 2022, Prague, Czech Republic}, series = {LIPIcs}, volume = {223}, pages = {22:1--22:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.CPM.2022.22}, doi = {10.4230/LIPICS.CPM.2022.22}, timestamp = {Wed, 22 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/CrochemoreIRRSW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2208-03451, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore}, title = {Fast detection of specific fragments against a set of sequences}, journal = {CoRR}, volume = {abs/2208.03451}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2208.03451}, doi = {10.48550/ARXIV.2208.03451}, eprinttype = {arXiv}, eprint = {2208.03451}, timestamp = {Wed, 10 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2208-03451.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreIRRSW21, author = {Maxime Crochemore and Costas S. Iliopoulos and Jakub Radoszewski and Wojciech Rytter and Juliusz Straszynski and Tomasz Walen and Wiktor Zuba}, title = {Shortest covers of all cyclic shifts of a string}, journal = {Theor. Comput. Sci.}, volume = {866}, pages = {70--81}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.03.011}, doi = {10.1016/J.TCS.2021.03.011}, timestamp = {Tue, 13 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreIRRSW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-10541, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore}, title = {Checking whether a word is Hamming-isometric in linear time}, journal = {CoRR}, volume = {abs/2106.10541}, year = {2021}, url = {https://arxiv.org/abs/2106.10541}, eprinttype = {arXiv}, eprint = {2106.10541}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-10541.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/CrochemoreHKMPR20, author = {Maxime Crochemore and Alice H{\'{e}}liou and Gregory Kucherov and Laurent Mouchard and Solon P. Pissis and Yann Ramusat}, title = {Absent words in a sliding window with applications}, journal = {Inf. Comput.}, volume = {270}, year = {2020}, url = {https://doi.org/10.1016/j.ic.2019.104461}, doi = {10.1016/J.IC.2019.104461}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/CrochemoreHKMPR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreR20, author = {Maxime Crochemore and Lu{\'{\i}}s M. S. Russo}, title = {Cartesian and Lyndon trees}, journal = {Theor. Comput. Sci.}, volume = {806}, pages = {1--9}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2018.08.011}, doi = {10.1016/J.TCS.2018.08.011}, timestamp = {Mon, 16 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/CrochemoreIRRSW20, author = {Maxime Crochemore and Costas S. Iliopoulos and Jakub Radoszewski and Wojciech Rytter and Juliusz Straszynski and Tomasz Walen and Wiktor Zuba}, editor = {Christina Boucher and Sharma V. Thankachan}, title = {Internal Quasiperiod Queries}, booktitle = {String Processing and Information Retrieval - 27th International Symposium, {SPIRE} 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12303}, pages = {60--75}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-59212-7\_5}, doi = {10.1007/978-3-030-59212-7\_5}, timestamp = {Mon, 21 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/CrochemoreIRRSW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stringology/BadkobehC20, author = {Golnaz Badkobeh and Maxime Crochemore}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Left Lyndon Tree Construction}, booktitle = {Prague Stringology Conference 2020, Prague, Czech Republic, August 31 - September 2, 2020}, pages = {84--95}, publisher = {Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science}, year = {2020}, url = {http://www.stringology.org/event/2020/p08.html}, timestamp = {Wed, 10 Feb 2021 08:42:18 +0100}, biburl = {https://dblp.org/rec/conf/stringology/BadkobehC20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/walcom/CrochemoreIRRSW20, author = {Maxime Crochemore and Costas S. Iliopoulos and Jakub Radoszewski and Wojciech Rytter and Juliusz Straszynski and Tomasz Walen and Wiktor Zuba}, editor = {M. Sohel Rahman and Kunihiko Sadakane and Wing{-}Kin Sung}, title = {Shortest Covers of All Cyclic Shifts of a String}, booktitle = {{WALCOM:} Algorithms and Computation - 14th International Conference, {WALCOM} 2020, Singapore, March 31 - April 2, 2020, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12049}, pages = {69--80}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-39881-1\_7}, doi = {10.1007/978-3-030-39881-1\_7}, timestamp = {Tue, 01 Jun 2021 15:21:40 +0200}, biburl = {https://dblp.org/rec/conf/walcom/CrochemoreIRRSW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-13471, author = {Maxime Crochemore and Costas S. Iliopoulos and Jakub Radoszewski and Wojciech Rytter and Juliusz Straszynski and Tomasz Walen and Wiktor Zuba}, title = {Internal Quasiperiod Queries}, journal = {CoRR}, volume = {abs/2007.13471}, year = {2020}, url = {https://arxiv.org/abs/2007.13471}, eprinttype = {arXiv}, eprint = {2007.13471}, timestamp = {Wed, 29 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-13471.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2011-12742, author = {Golnaz Badkobeh and Maxime Crochemore}, title = {Left Lyndon tree construction}, journal = {CoRR}, volume = {abs/2011.12742}, year = {2020}, url = {https://arxiv.org/abs/2011.12742}, eprinttype = {arXiv}, eprint = {2011.12742}, timestamp = {Tue, 01 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2011-12742.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/CrochemoreKK19, author = {Maxime Crochemore and Roman Kolpakov and Gregory Kucherov}, title = {Optimal bounds for computing \emph{{\(\alpha\)}}-gapped repeats}, journal = {Inf. Comput.}, volume = {268}, year = {2019}, url = {https://doi.org/10.1016/j.ic.2019.104434}, doi = {10.1016/J.IC.2019.104434}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/CrochemoreKK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/Charalampopoulos19, author = {Panagiotis Charalampopoulos and Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, title = {Efficient enumeration of non-equivalent squares in partial words with few holes}, journal = {J. Comb. Optim.}, volume = {37}, number = {2}, pages = {501--522}, year = {2019}, url = {https://doi.org/10.1007/s10878-018-0300-z}, doi = {10.1007/S10878-018-0300-Z}, timestamp = {Tue, 20 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/Charalampopoulos19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreR19, author = {Maxime Crochemore and Jakub Radoszewski}, title = {Special issue in honor of the 70th birthday of Prof. Wojciech Rytter}, journal = {Theor. Comput. Sci.}, volume = {792}, pages = {1}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2019.09.038}, doi = {10.1016/J.TCS.2019.09.038}, timestamp = {Sat, 21 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/AlzamelCIKRRSWZ19, author = {Mai Alzamel and Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Jakub Radoszewski and Wojciech Rytter and Juliusz Straszynski and Tomasz Walen and Wiktor Zuba}, editor = {Nadia Pisanti and Solon P. Pissis}, title = {Quasi-Linear-Time Algorithm for Longest Common Circular Factor}, booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019, June 18-20, 2019, Pisa, Italy}, series = {LIPIcs}, volume = {128}, pages = {25:1--25:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.CPM.2019.25}, doi = {10.4230/LIPICS.CPM.2019.25}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/cpm/AlzamelCIKRRSWZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stringology/BadkobehBCIIS19, author = {Golnaz Badkobeh and Hideo Bannai and Maxime Crochemore and Tomohiro I and Shunsuke Inenaga and Shiho Sugimoto}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {\emph{k}-Abelian Pattern Matching: Revisited, Corrected, and Extended}, booktitle = {Prague Stringology Conference 2019, Prague, Czech Republic, August 26-28, 2019}, pages = {29--40}, publisher = {Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science}, year = {2019}, url = {http://www.stringology.org/event/2019/p04.html}, timestamp = {Wed, 10 Feb 2021 08:42:24 +0100}, biburl = {https://dblp.org/rec/conf/stringology/BadkobehBCIIS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1901-11305, author = {Mai Alzamel and Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Jakub Radoszewski and Wojciech Rytter and Juliusz Straszynski and Tomasz Walen and Wiktor Zuba}, title = {Quasi-Linear-Time Algorithm for Longest Common Circular Factor}, journal = {CoRR}, volume = {abs/1901.11305}, year = {2019}, url = {http://arxiv.org/abs/1901.11305}, eprinttype = {arXiv}, eprint = {1901.11305}, timestamp = {Mon, 04 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1901-11305.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/almob/CarricoCFPRV18, author = {Jo{\~{a}}o A. Carri{\c{c}}o and Maxime Crochemore and Alexandre P. Francisco and Solon P. Pissis and Bruno Ribeiro{-}Gon{\c{c}}alves and C{\'{a}}tia Vaz}, title = {Fast phylogenetic inference from typing data}, journal = {Algorithms Mol. Biol.}, volume = {13}, number = {1}, pages = {4:1--4:14}, year = {2018}, url = {https://doi.org/10.1186/s13015-017-0119-7}, doi = {10.1186/S13015-017-0119-7}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/almob/CarricoCFPRV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/Charalampopoulos18, author = {Panagiotis Charalampopoulos and Maxime Crochemore and Solon P. Pissis}, title = {Preface}, journal = {Fundam. Informaticae}, volume = {163}, number = {3}, pages = {i}, year = {2018}, url = {https://doi.org/10.3233/FI-2018-1739}, doi = {10.3233/FI-2018-1739}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/Charalampopoulos18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Charalampopoulos18, author = {Panagiotis Charalampopoulos and Maxime Crochemore and Gabriele Fici and Robert Mercas and Solon P. Pissis}, title = {Alignment-free sequence comparison using absent words}, journal = {Inf. Comput.}, volume = {262}, pages = {57--68}, year = {2018}, url = {https://doi.org/10.1016/j.ic.2018.06.002}, doi = {10.1016/J.IC.2018.06.002}, timestamp = {Tue, 03 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Charalampopoulos18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreP18, author = {Maxime Crochemore and Solon P. Pissis}, title = {Advances in Algorithms {\&} Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos)}, journal = {Theor. Comput. Sci.}, volume = {710}, pages = {1}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2018.01.001}, doi = {10.1016/J.TCS.2018.01.001}, timestamp = {Sat, 21 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/Charalampopoulos18, author = {Panagiotis Charalampopoulos and Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu}, title = {Linear-Time Algorithm for Long {LCF} with k Mismatches}, booktitle = {Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, July 2-4, 2018 - Qingdao, China}, series = {LIPIcs}, volume = {105}, pages = {23:1--23:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.CPM.2018.23}, doi = {10.4230/LIPICS.CPM.2018.23}, timestamp = {Wed, 28 Feb 2024 00:16:40 +0100}, biburl = {https://dblp.org/rec/conf/cpm/Charalampopoulos18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ifip12/AlzamelCIKKRRW18, author = {Mai Alzamel and Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Ritu Kundu and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Lazaros S. Iliadis and Ilias Maglogiannis and Vassilis P. Plagianakos}, title = {How Much Different Are Two Words with Different Shortest Periods}, booktitle = {Artificial Intelligence Applications and Innovations - {AIAI} 2018 {IFIP} {WG} 12.5 International Workshops, SEDSEAL, 5G-PINE, MHDW, and HEALTHIOT, Rhodes, Greece, May 25-27, 2018, Proceedings}, series = {{IFIP} Advances in Information and Communication Technology}, volume = {520}, pages = {168--178}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-92016-0\_16}, doi = {10.1007/978-3-319-92016-0\_16}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ifip12/AlzamelCIKKRRW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/Charalampopoulos18, author = {Panagiotis Charalampopoulos and Maxime Crochemore and Solon P. Pissis}, editor = {Travis Gagie and Alistair Moffat and Gonzalo Navarro and Ernesto Cuadros{-}Vargas}, title = {On Extended Special Factors of a Word}, booktitle = {String Processing and Information Retrieval - 25th International Symposium, {SPIRE} 2018, Lima, Peru, October 9-11, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11147}, pages = {131--138}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00479-8\_11}, doi = {10.1007/978-3-030-00479-8\_11}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/spire/Charalampopoulos18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/db/CrochemoreL18, author = {Maxime Crochemore and Thierry Lecroq}, editor = {Ling Liu and M. Tamer {\"{O}}zsu}, title = {Suffix Tree}, booktitle = {Encyclopedia of Database Systems, Second Edition}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-1-4614-8265-9\_1142}, doi = {10.1007/978-1-4614-8265-9\_1142}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/db/CrochemoreL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/db/CrochemoreL18a, author = {Maxime Crochemore and Thierry Lecroq}, editor = {Ling Liu and M. Tamer {\"{O}}zsu}, title = {Trie}, booktitle = {Encyclopedia of Database Systems, Second Edition}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-1-4614-8265-9\_1143}, doi = {10.1007/978-1-4614-8265-9\_1143}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/db/CrochemoreL18a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1802-06369, author = {Panagiotis Charalampopoulos and Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, title = {Linear-Time Algorithm for Long {LCF} with k Mismatches}, journal = {CoRR}, volume = {abs/1802.06369}, year = {2018}, url = {http://arxiv.org/abs/1802.06369}, eprinttype = {arXiv}, eprint = {1802.06369}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1802-06369.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-02718, author = {Panagiotis Charalampopoulos and Maxime Crochemore and Gabriele Fici and Robert Mercas and Solon P. Pissis}, title = {Alignment-free sequence comparison using absent words}, journal = {CoRR}, volume = {abs/1806.02718}, year = {2018}, url = {http://arxiv.org/abs/1806.02718}, eprinttype = {arXiv}, eprint = {1806.02718}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-02718.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mscs/CrochemoreILM17, author = {Maxime Crochemore and Costas S. Iliopoulos and Alessio Langiu and Filippo Mignosi}, title = {The longest common substring problem}, journal = {Math. Struct. Comput. Sci.}, volume = {27}, number = {2}, pages = {277--295}, year = {2017}, url = {https://doi.org/10.1017/S0960129515000110}, doi = {10.1017/S0960129515000110}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mscs/CrochemoreILM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BadkobehCM17, author = {Golnaz Badkobeh and Maxime Crochemore and Robert Mercas}, title = {Counting maximal-exponent factors in words}, journal = {Theor. Comput. Sci.}, volume = {658}, pages = {27--35}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.02.035}, doi = {10.1016/J.TCS.2016.02.035}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BadkobehCM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreIKRRW17, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, title = {Covering problems for partial words and for indeterminate strings}, journal = {Theor. Comput. Sci.}, volume = {698}, pages = {25--39}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2017.05.026}, doi = {10.1016/J.TCS.2017.05.026}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreIKRRW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/AmitCLS17, author = {Mika Amit and Maxime Crochemore and Gad M. Landau and Dina Sokol}, title = {Locating maximal approximate runs in a string}, journal = {Theor. Comput. Sci.}, volume = {700}, pages = {45--62}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2017.07.021}, doi = {10.1016/J.TCS.2017.07.021}, timestamp = {Tue, 24 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AmitCLS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoa/ChairungseeC17, author = {Supaporn Chairungsee and Maxime Crochemore}, editor = {Xiaofeng Gao and Hongwei Du and Meng Han}, title = {Longest Previous Non-overlapping Factors Table Computation}, booktitle = {Combinatorial Optimization and Applications - 11th International Conference, {COCOA} 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {10628}, pages = {483--491}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-71147-8\_35}, doi = {10.1007/978-3-319-71147-8\_35}, timestamp = {Tue, 14 Jun 2022 14:15:49 +0200}, biburl = {https://dblp.org/rec/conf/cocoa/ChairungseeC17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/Charalampopoulos17, author = {Panagiotis Charalampopoulos and Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Yixin Cao and Jianer Chen}, title = {Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes}, booktitle = {Computing and Combinatorics - 23rd International Conference, {COCOON} 2017, Hong Kong, China, August 3-5, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10392}, pages = {99--111}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62389-4\_9}, doi = {10.1007/978-3-319-62389-4\_9}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/Charalampopoulos17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/CrochemoreHKMPR17, author = {Maxime Crochemore and Alice H{\'{e}}liou and Gregory Kucherov and Laurent Mouchard and Solon P. Pissis and Yann Ramusat}, editor = {Ralf Klasing and Marc Zeitoun}, title = {Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching}, booktitle = {Fundamentals of Computation Theory - 21st International Symposium, {FCT} 2017, Bordeaux, France, September 11-13, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10472}, pages = {164--176}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-662-55751-8\_14}, doi = {10.1007/978-3-662-55751-8\_14}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/CrochemoreHKMPR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wabi/CrochemoreFPV17, author = {Maxime Crochemore and Alexandre P. Francisco and Solon P. Pissis and C{\'{a}}tia Vaz}, editor = {Russell Schwartz and Knut Reinert}, title = {Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time}, booktitle = {17th International Workshop on Algorithms in Bioinformatics, {WABI} 2017, August 21-23, 2017, Boston, MA, {USA}}, series = {LIPIcs}, volume = {88}, pages = {9:1--9:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.WABI.2017.9}, doi = {10.4230/LIPICS.WABI.2017.9}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wabi/CrochemoreFPV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1712-08749, author = {Maxime Crochemore and Lu{\'{\i}}s M. S. Russo}, title = {Cartesian trees and Lyndon trees}, journal = {CoRR}, volume = {abs/1712.08749}, year = {2017}, url = {http://arxiv.org/abs/1712.08749}, eprinttype = {arXiv}, eprint = {1712.08749}, timestamp = {Mon, 16 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1712-08749.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arscom/ChristouCI16, author = {Michalis Christou and Maxime Crochemore and Costas S. Iliopoulos}, title = {Quasiperiodicities in Fibonacci strings}, journal = {Ars Comb.}, volume = {129}, pages = {211--225}, year = {2016}, timestamp = {Mon, 31 Oct 2016 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/arscom/ChristouCI16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cacm/ApostolicoCFGM16, author = {Alberto Apostolico and Maxime Crochemore and Martin Farach{-}Colton and Zvi Galil and S. Muthukrishnan}, title = {40 years of suffix trees}, journal = {Commun. {ACM}}, volume = {59}, number = {4}, pages = {66--73}, year = {2016}, url = {https://doi.org/10.1145/2810036}, doi = {10.1145/2810036}, timestamp = {Mon, 10 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cacm/ApostolicoCFGM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eaai/CrochemoreIKMV16, author = {Maxime Crochemore and Costas S. Iliopoulos and Ritu Kundu and Manal Mohamed and Fatima Vayani}, title = {Linear algorithm for conservative degenerate pattern matching}, journal = {Eng. Appl. Artif. Intell.}, volume = {51}, pages = {109--114}, year = {2016}, url = {https://doi.org/10.1016/j.engappai.2016.01.009}, doi = {10.1016/J.ENGAPPAI.2016.01.009}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eaai/CrochemoreIKMV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/BadkobehC16, author = {Golnaz Badkobeh and Maxime Crochemore}, title = {Computing maximal-exponent factors in an overlap-free word}, journal = {J. Comput. Syst. Sci.}, volume = {82}, number = {3}, pages = {477--487}, year = {2016}, url = {https://doi.org/10.1016/j.jcss.2015.11.007}, doi = {10.1016/J.JCSS.2015.11.007}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/BadkobehC16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreIKKLP16, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Marcin Kubica and Alessio Langiu and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, title = {Order-preserving indexing}, journal = {Theor. Comput. Sci.}, volume = {638}, pages = {122--135}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2015.06.050}, doi = {10.1016/J.TCS.2015.06.050}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreIKKLP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreEGM16, author = {Maxime Crochemore and Chiara Epifanio and Roberto Grossi and Filippo Mignosi}, title = {Linear-size suffix tries}, journal = {Theor. Comput. Sci.}, volume = {638}, pages = {171--178}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.04.002}, doi = {10.1016/J.TCS.2016.04.002}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreEGM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreM16, author = {Maxime Crochemore and Robert Mercas}, title = {On the density of Lyndon roots in factors}, journal = {Theor. Comput. Sci.}, volume = {656}, pages = {234--240}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.02.015}, doi = {10.1016/J.TCS.2016.02.015}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BadkobehCMT16, author = {Golnaz Badkobeh and Maxime Crochemore and Manal Mohamed and Chalita Toopsuwan}, title = {Efficient computation of maximal anti-exponent in palindrome-free strings}, journal = {Theor. Comput. Sci.}, volume = {656}, pages = {241--248}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.02.014}, doi = {10.1016/J.TCS.2016.02.014}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BadkobehCMT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lata/CrochemoreKK16, author = {Maxime Crochemore and Roman Kolpakov and Gregory Kucherov}, editor = {Adrian{-}Horia Dediu and Jan Janousek and Carlos Mart{\'{\i}}n{-}Vide and Bianca Truthe}, title = {Optimal Bounds for Computing {\textbackslash}alpha {\(\alpha\)} -gapped Repeats}, booktitle = {Language and Automata Theory and Applications - 10th International Conference, {LATA} 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9618}, pages = {245--255}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-30000-9\_19}, doi = {10.1007/978-3-319-30000-9\_19}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/lata/CrochemoreKK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/CrochemoreFMP16, author = {Maxime Crochemore and Gabriele Fici and Robert Mercas and Solon P. Pissis}, editor = {Evangelos Kranakis and Gonzalo Navarro and Edgar Ch{\'{a}}vez}, title = {Linear-Time Sequence Comparison Using Minimal Absent Words {\&} Applications}, booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9644}, pages = {334--346}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-49529-2\_25}, doi = {10.1007/978-3-662-49529-2\_25}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/latin/CrochemoreFMP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/CrochemoreIKKPR16, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Ritu Kundu and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Shunsuke Inenaga and Kunihiko Sadakane and Tetsuya Sakai}, title = {Near-Optimal Computation of Runs over General Alphabet via Non-Crossing {LCE} Queries}, booktitle = {String Processing and Information Retrieval - 23rd International Symposium, {SPIRE} 2016, Beppu, Japan, October 18-20, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9954}, pages = {22--34}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-46049-9\_3}, doi = {10.1007/978-3-319-46049-9\_3}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/CrochemoreIKKPR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/CrochemoreL16, author = {Maxime Crochemore and Thierry Lecroq}, title = {Multiple String Matching}, booktitle = {Encyclopedia of Algorithms}, pages = {1378--1382}, year = {2016}, url = {https://doi.org/10.1007/978-1-4939-2864-4\_366}, doi = {10.1007/978-1-4939-2864-4\_366}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/CrochemoreL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/CrochemoreR16, author = {Maxime Crochemore and Wojciech Rytter}, title = {Squares and Repetitions}, booktitle = {Encyclopedia of Algorithms}, pages = {2056--2060}, year = {2016}, url = {https://doi.org/10.1007/978-1-4939-2864-4\_392}, doi = {10.1007/978-1-4939-2864-4\_392}, timestamp = {Wed, 12 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/CrochemoreR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/CrochemoreL16a, author = {Maxime Crochemore and Thierry Lecroq}, title = {String Matching}, booktitle = {Encyclopedia of Algorithms}, pages = {2113--2117}, year = {2016}, url = {https://doi.org/10.1007/978-1-4939-2864-4\_365}, doi = {10.1007/978-1-4939-2864-4\_365}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/CrochemoreL16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CrochemoreIKKPR16, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Ritu Kundu and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, title = {Near-Optimal Computation of Runs over General Alphabet via Non-Crossing {LCE} Queries}, journal = {CoRR}, volume = {abs/1606.08275}, year = {2016}, url = {http://arxiv.org/abs/1606.08275}, eprinttype = {arXiv}, eprint = {1606.08275}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CrochemoreIKKPR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BadkobehC15, author = {Golnaz Badkobeh and Maxime Crochemore}, title = {Infinite binary words containing repetitions of odd period}, journal = {Inf. Process. Lett.}, volume = {115}, number = {5}, pages = {543--547}, year = {2015}, url = {https://doi.org/10.1016/j.ipl.2015.01.004}, doi = {10.1016/J.IPL.2015.01.004}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BadkobehC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CrochemoreDL15, author = {Maxime Crochemore and Jacqueline W. Daykin and Zsuzsanna Lipt{\'{a}}k}, title = {StringMasters 2012 {\&} 2013 special issue - volume 2}, journal = {J. Discrete Algorithms}, volume = {32}, pages = {1--2}, year = {2015}, url = {https://doi.org/10.1016/j.jda.2015.01.007}, doi = {10.1016/J.JDA.2015.01.007}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jda/CrochemoreDL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CrochemoreGKL15, author = {Maxime Crochemore and Roberto Grossi and Juha K{\"{a}}rkk{\"{a}}inen and Gad M. Landau}, title = {Computing the Burrows-Wheeler transform in place and in small space}, journal = {J. Discrete Algorithms}, volume = {32}, pages = {44--52}, year = {2015}, url = {https://doi.org/10.1016/j.jda.2015.01.004}, doi = {10.1016/J.JDA.2015.01.004}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CrochemoreGKL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CrochemoreIKKLR15, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Marcin Kubica and Alessio Langiu and Jakub Radoszewski and Wojciech Rytter and Bartosz Szreder and Tomasz Walen}, title = {A note on the longest common compatible prefix problem for partial words}, journal = {J. Discrete Algorithms}, volume = {34}, pages = {49--53}, year = {2015}, url = {https://doi.org/10.1016/j.jda.2015.05.003}, doi = {10.1016/J.JDA.2015.05.003}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CrochemoreIKKLR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CrochemoreIKMV15, author = {Maxime Crochemore and Costas S. Iliopoulos and Ritu Kundu and Manal Mohamed and Fatima Vayani}, title = {Linear Algorithm for Conservative Degenerate Pattern Matching}, journal = {CoRR}, volume = {abs/1506.04559}, year = {2015}, url = {http://arxiv.org/abs/1506.04559}, eprinttype = {arXiv}, eprint = {1506.04559}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CrochemoreIKMV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CrochemoreFMP15, author = {Maxime Crochemore and Gabriele Fici and Robert Mercas and Solon P. Pissis}, title = {Linear-Time Sequence Comparison Using Minimal Absent Words {\&} Applications}, journal = {CoRR}, volume = {abs/1506.04917}, year = {2015}, url = {http://arxiv.org/abs/1506.04917}, eprinttype = {arXiv}, eprint = {1506.04917}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CrochemoreFMP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CrochemoreKK15, author = {Maxime Crochemore and Roman Kolpakov and Gregory Kucherov}, title = {Optimal searching of gapped repeats in a word}, journal = {CoRR}, volume = {abs/1509.01221}, year = {2015}, url = {http://arxiv.org/abs/1509.01221}, eprinttype = {arXiv}, eprint = {1509.01221}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CrochemoreKK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CrochemoreIKRRSW14, author = {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Krzysztof Stencel and Tomasz Walen}, title = {New simple efficient algorithms computing powers and runs in strings}, journal = {Discret. Appl. Math.}, volume = {163}, pages = {258--267}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.05.009}, doi = {10.1016/J.DAM.2013.05.009}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/CrochemoreIKRRSW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChristodoulakisCCI14, author = {Manolis Christodoulakis and Michalis Christou and Maxime Crochemore and Costas S. Iliopoulos}, title = {Abelian borders in binary words}, journal = {Discret. Appl. Math.}, volume = {171}, pages = {141--146}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2014.02.012}, doi = {10.1016/J.DAM.2014.02.012}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChristodoulakisCCI14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/BadkobehCR14, author = {Golnaz Badkobeh and Maxime Crochemore and Micha{\"{e}}l Rao}, title = {Finite repetition threshold for large alphabets}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {48}, number = {4}, pages = {419--430}, year = {2014}, url = {https://doi.org/10.1051/ita/2014017}, doi = {10.1051/ITA/2014017}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/BadkobehCR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CrochemoreDL14, author = {Maxime Crochemore and Jacqueline W. Daykin and Zsuzsanna Lipt{\'{a}}k}, title = {StringMasters 2012 {\&} 2013 special issue - volume 1}, journal = {J. Discrete Algorithms}, volume = {28}, pages = {1}, year = {2014}, url = {https://doi.org/10.1016/j.jda.2014.08.002}, doi = {10.1016/J.JDA.2014.08.002}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jda/CrochemoreDL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreIKRRW14, author = {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, title = {Extracting powers and periods in a word from its runs structure}, journal = {Theor. Comput. Sci.}, volume = {521}, pages = {29--41}, year = {2014}, url = {https://doi.org/10.1016/j.tcs.2013.11.018}, doi = {10.1016/J.TCS.2013.11.018}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreIKRRW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChristodoulakisCCI14, author = {Manolis Christodoulakis and Michalis Christou and Maxime Crochemore and Costas S. Iliopoulos}, title = {On the average number of regularities in a word}, journal = {Theor. Comput. Sci.}, volume = {525}, pages = {3--9}, year = {2014}, url = {https://doi.org/10.1016/j.tcs.2013.10.007}, doi = {10.1016/J.TCS.2013.10.007}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChristodoulakisCCI14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreLM14, author = {Maxime Crochemore and Alessio Langiu and Filippo Mignosi}, title = {Note on the greedy parsing optimality for dictionary-based text compression}, journal = {Theor. Comput. Sci.}, volume = {525}, pages = {55--59}, year = {2014}, url = {https://doi.org/10.1016/j.tcs.2014.01.013}, doi = {10.1016/J.TCS.2014.01.013}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreLM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dictap/BadkobehCT14, author = {Golnaz Badkobeh and Maxime Crochemore and Chalita Toopsuwan}, title = {Maximal anti-exponent of gapped palindromes}, booktitle = {Fourth International Conference on Digital Information and Communication Technology and its Applicationsm {DICTAP} 2014, Bangkok, Thailand, May 6-8, 2014}, pages = {205--210}, publisher = {{IEEE}}, year = {2014}, url = {https://doi.org/10.1109/DICTAP.2014.6821683}, doi = {10.1109/DICTAP.2014.6821683}, timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}, biburl = {https://dblp.org/rec/conf/dictap/BadkobehCT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CrochemoreIKRRW14, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Covering Problems for Partial Words and for Indeterminate Strings}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {220--232}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_18}, doi = {10.1007/978-3-319-13075-0\_18}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CrochemoreIKRRW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/crc/chb/CrochemoreL14, author = {Maxime Crochemore and Thierry Lecroq}, editor = {Teofilo F. Gonzalez and Jorge Diaz{-}Herrera and Allen Tucker}, title = {Pattern Matching and Text Compression Algorithms}, booktitle = {Computing Handbook, Third Edition: Computer Science and Software Engineering}, pages = {15: 1--57}, publisher = {{CRC} Press}, year = {2014}, timestamp = {Tue, 17 Jun 2014 14:00:46 +0200}, biburl = {https://dblp.org/rec/books/crc/chb/CrochemoreL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/spire/2014, editor = {Edleno Silva de Moura and Maxime Crochemore}, title = {String Processing and Information Retrieval - 21st International Symposium, {SPIRE} 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8799}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-11918-2}, doi = {10.1007/978-3-319-11918-2}, isbn = {978-3-319-11917-5}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/2014.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CrochemoreIKRRW14, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, title = {Covering Problems for Partial Words and for Indeterminate Strings}, journal = {CoRR}, volume = {abs/1412.3696}, year = {2014}, url = {http://arxiv.org/abs/1412.3696}, eprinttype = {arXiv}, eprint = {1412.3696}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CrochemoreIKRRW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CrochemoreM14, author = {Maxime Crochemore and Robert Mercas}, title = {Fewer runs than word length}, journal = {CoRR}, volume = {abs/1412.4646}, year = {2014}, url = {http://arxiv.org/abs/1412.4646}, eprinttype = {arXiv}, eprint = {1412.4646}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CrochemoreM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/CrochemoreCKN14, author = {Maxime Crochemore and James D. Currie and Gregory Kucherov and Dirk Nowotka}, title = {Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111)}, journal = {Dagstuhl Reports}, volume = {4}, number = {3}, pages = {28--46}, year = {2014}, url = {https://doi.org/10.4230/DagRep.4.3.28}, doi = {10.4230/DAGREP.4.3.28}, timestamp = {Wed, 07 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/CrochemoreCKN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ajc/Christodoulakis13, author = {Manolis Christodoulakis and Michalis Christou and Maxime Crochemore and Costas S. Iliopoulos}, title = {Overlapping factors in words}, journal = {Australas. {J} Comb.}, volume = {57}, pages = {49--64}, year = {2013}, url = {http://ajc.maths.uq.edu.au/pdf/57/ajc\_v57\_p049.pdf}, timestamp = {Wed, 11 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ajc/Christodoulakis13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/CrochemoreIIKRW13, author = {Maxime Crochemore and Lucian Ilie and Costas S. Iliopoulos and Marcin Kubica and Wojciech Rytter and Tomasz Walen}, title = {Computing the Longest Previous Factor}, journal = {Eur. J. Comb.}, volume = {34}, number = {1}, pages = {15--26}, year = {2013}, url = {https://doi.org/10.1016/j.ejc.2012.07.011}, doi = {10.1016/J.EJC.2012.07.011}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/CrochemoreIIKRW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreIKKPRRTW13, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Marcin Kubica and Jakub Pachocki and Jakub Radoszewski and Wojciech Rytter and Wojciech Tyczynski and Tomasz Walen}, title = {A note on efficient computation of all Abelian periods in a string}, journal = {Inf. Process. Lett.}, volume = {113}, number = {3}, pages = {74--77}, year = {2013}, url = {https://doi.org/10.1016/j.ipl.2012.11.001}, doi = {10.1016/J.IPL.2012.11.001}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreIKKPRRTW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CrochemoreD13, author = {Maxime Crochemore and Jacqueline W. Daykin}, title = {StringMasters 2011 Special Issue}, journal = {J. Discrete Algorithms}, volume = {20}, pages = {1--2}, year = {2013}, url = {https://doi.org/10.1016/j.jda.2013.05.001}, doi = {10.1016/J.JDA.2013.05.001}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CrochemoreD13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChristouCIKPRRSW13, author = {Michalis Christou and Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Bartosz Szreder and Tomasz Walen}, title = {Efficient seed computation revisited}, journal = {Theor. Comput. Sci.}, volume = {483}, pages = {171--181}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2011.12.078}, doi = {10.1016/J.TCS.2011.12.078}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChristouCIKPRRSW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/ApostolicoCFGM13, author = {Alberto Apostolico and Maxime Crochemore and Martin Farach{-}Colton and Zvi Galil and S. Muthukrishnan}, editor = {Johannes Fischer and Peter Sanders}, title = {Forty Years of Text Indexing}, booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7922}, pages = {1--10}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38905-4\_1}, doi = {10.1007/978-3-642-38905-4\_1}, timestamp = {Mon, 10 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/ApostolicoCFGM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/AmitCL13, author = {Mika Amit and Maxime Crochemore and Gad M. Landau}, editor = {Johannes Fischer and Peter Sanders}, title = {Locating All Maximal Approximate Runs in a String}, booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7922}, pages = {13--27}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38905-4\_4}, doi = {10.1007/978-3-642-38905-4\_4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/AmitCL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CrochemoreGKL13, author = {Maxime Crochemore and Roberto Grossi and Juha K{\"{a}}rkk{\"{a}}inen and Gad M. Landau}, editor = {Johannes Fischer and Peter Sanders}, title = {A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform}, booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7922}, pages = {74--82}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38905-4\_9}, doi = {10.1007/978-3-642-38905-4\_9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/CrochemoreGKL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dcc/CrochemoreLM13, author = {Maxime Crochemore and Alessio Langiu and Filippo Mignosi}, editor = {Ali Bilgin and Michael W. Marcellin and Joan Serra{-}Sagrist{\`{a}} and James A. Storer}, title = {The Rightmost Equal-Cost Position Problem}, booktitle = {2013 Data Compression Conference, {DCC} 2013, Snowbird, UT, USA, March 20-22, 2013}, pages = {421--430}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/DCC.2013.50}, doi = {10.1109/DCC.2013.50}, timestamp = {Wed, 16 Oct 2019 14:14:57 +0200}, biburl = {https://dblp.org/rec/conf/dcc/CrochemoreLM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwoca/NaPCHIMP13, author = {Joong Chae Na and Heejin Park and Maxime Crochemore and Jan Holub and Costas S. Iliopoulos and Laurent Mouchard and Kunsoo Park}, editor = {Thierry Lecroq and Laurent Mouchard}, title = {Suffix Tree of Alignment: An Efficient Index for Similar Data}, booktitle = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8288}, pages = {337--348}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45278-9\_29}, doi = {10.1007/978-3-642-45278-9\_29}, timestamp = {Wed, 25 Sep 2019 18:08:04 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/NaPCHIMP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/CrochemoreIKKLPRRW13, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Marcin Kubica and Alessio Langiu and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Oren Kurland and Moshe Lewenstein and Ely Porat}, title = {Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes}, booktitle = {String Processing and Information Retrieval - 20th International Symposium, {SPIRE} 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8214}, pages = {84--95}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-319-02432-5\_13}, doi = {10.1007/978-3-319-02432-5\_13}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/conf/spire/CrochemoreIKKLPRRW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1303-6872, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Marcin Kubica and Alessio Langiu and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, title = {Order-Preserving Suffix Trees and Their Algorithmic Applications}, journal = {CoRR}, volume = {abs/1303.6872}, year = {2013}, url = {http://arxiv.org/abs/1303.6872}, eprinttype = {arXiv}, eprint = {1303.6872}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1303-6872.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1305-1744, author = {Joong Chae Na and Heejin Park and Maxime Crochemore and Jan Holub and Costas S. Iliopoulos and Laurent Mouchard and Kunsoo Park}, title = {Suffix Tree of Alignment: An Efficient Index for Similar Data}, journal = {CoRR}, volume = {abs/1305.1744}, year = {2013}, url = {http://arxiv.org/abs/1305.1744}, eprinttype = {arXiv}, eprint = {1305.1744}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1305-1744.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CrochemoreIKKLRRSW13, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Marcin Kubica and Alessio Langiu and Jakub Radoszewski and Wojciech Rytter and Bartosz Szreder and Tomasz Walen}, title = {A Note on the Longest Common Compatible Prefix Problem for Partial Words}, journal = {CoRR}, volume = {abs/1312.2381}, year = {2013}, url = {http://arxiv.org/abs/1312.2381}, eprinttype = {arXiv}, eprint = {1312.2381}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CrochemoreIKKLRRSW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/csur/Al-HafeedhCIKSTY12, author = {Anisa Al{-}Hafeedh and Maxime Crochemore and Lucian Ilie and Evguenia Kopylova and William F. Smyth and German Tischler and Munina Yusufu}, title = {A comparison of index-based lempel-Ziv {LZ77} factorization algorithms}, journal = {{ACM} Comput. Surv.}, volume = {45}, number = {1}, pages = {5:1--5:17}, year = {2012}, url = {https://doi.org/10.1145/2379776.2379781}, doi = {10.1145/2379776.2379781}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/csur/Al-HafeedhCIKSTY12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/CrochemoreGL12, author = {Maxime Crochemore and Laura Giambruno and Alessio Langiu}, title = {On-Line Construction of a Small Automaton for a Finite Set of Words}, journal = {Int. J. Found. Comput. Sci.}, volume = {23}, number = {2}, pages = {281--301}, year = {2012}, url = {https://doi.org/10.1142/S0129054112400138}, doi = {10.1142/S0129054112400138}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/CrochemoreGL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/ChristouCI12, author = {Michalis Christou and Maxime Crochemore and Costas S. Iliopoulos}, title = {Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems}, journal = {Int. J. Found. Comput. Sci.}, volume = {23}, number = {6}, pages = {1371--1384}, year = {2012}, url = {https://doi.org/10.1142/S0129054112500190}, doi = {10.1142/S0129054112500190}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/ChristouCI12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChristouCFIJMP12, author = {Michalis Christou and Maxime Crochemore and Tom{\'{a}}s Flouri and Costas S. Iliopoulos and Jan Janousek and Borivoj Melichar and Solon P. Pissis}, title = {Computing all subtree repeats in ordered trees}, journal = {Inf. Process. Lett.}, volume = {112}, number = {24}, pages = {958--962}, year = {2012}, url = {https://doi.org/10.1016/j.ipl.2012.09.001}, doi = {10.1016/J.IPL.2012.09.001}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChristouCFIJMP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/BadkobehC12, author = {Golnaz Badkobeh and Maxime Crochemore}, title = {Fewest repetitions in infinite binary words}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {46}, number = {1}, pages = {17--31}, year = {2012}, url = {https://doi.org/10.1051/ita/2011109}, doi = {10.1051/ITA/2011109}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/BadkobehC12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/CrochemoreIKRRW12, author = {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, title = {The maximal number of cubic runs in a word}, journal = {J. Comput. Syst. Sci.}, volume = {78}, number = {6}, pages = {1828--1836}, year = {2012}, url = {https://doi.org/10.1016/j.jcss.2011.12.005}, doi = {10.1016/J.JCSS.2011.12.005}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/CrochemoreIKRRW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CrochemoreIKRW12, author = {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Wojciech Rytter and Tomasz Walen}, title = {Efficient algorithms for three variants of the {LPF} table}, journal = {J. Discrete Algorithms}, volume = {11}, pages = {51--61}, year = {2012}, url = {https://doi.org/10.1016/j.jda.2011.02.002}, doi = {10.1016/J.JDA.2011.02.002}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CrochemoreIKRW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CrochemoreKRRW12, author = {Maxime Crochemore and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, title = {On the maximal sum of exponents of runs in a string}, journal = {J. Discrete Algorithms}, volume = {14}, pages = {29--36}, year = {2012}, url = {https://doi.org/10.1016/j.jda.2011.12.016}, doi = {10.1016/J.JDA.2011.12.016}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CrochemoreKRRW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CrochemoreGLMR12, author = {Maxime Crochemore and Laura Giambruno and Alessio Langiu and Filippo Mignosi and Antonio Restivo}, title = {Dictionary-symbolwise flexible parsing}, journal = {J. Discrete Algorithms}, volume = {14}, pages = {74--90}, year = {2012}, url = {https://doi.org/10.1016/j.jda.2011.12.021}, doi = {10.1016/J.JDA.2011.12.021}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CrochemoreGLMR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/ChristouCGIP12, author = {Michalis Christou and Maxime Crochemore and Ondrej Guth and Costas S. Iliopoulos and Solon P. Pissis}, title = {On left and right seeds of a string}, journal = {J. Discrete Algorithms}, volume = {17}, pages = {31--44}, year = {2012}, url = {https://doi.org/10.1016/j.jda.2012.10.004}, doi = {10.1016/J.JDA.2012.10.004}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/ChristouCGIP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreIKRTW12, author = {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and M. Sohel Rahman and German Tischler and Tomasz Walen}, title = {Improved algorithms for the range next value problem and applications}, journal = {Theor. Comput. Sci.}, volume = {434}, pages = {23--34}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.02.015}, doi = {10.1016/J.TCS.2012.02.015}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreIKRTW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChairungseeC12, author = {Supaporn Chairungsee and Maxime Crochemore}, title = {Using minimal absent words to build phylogeny}, journal = {Theor. Comput. Sci.}, volume = {450}, pages = {109--116}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.031}, doi = {10.1016/J.TCS.2012.04.031}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChairungseeC12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CrochemoreIKKRRTW12, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Wojciech Tyczynski and Tomasz Walen}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jens Stoye}, title = {The Maximum Number of Squares in a Tree}, booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012, Helsinki, Finland, July 3-5, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7354}, pages = {27--40}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31265-6\_3}, doi = {10.1007/978-3-642-31265-6\_3}, timestamp = {Tue, 21 Mar 2023 21:02:12 +0100}, biburl = {https://dblp.org/rec/conf/cpm/CrochemoreIKKRRTW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cube/AlatabbiCIO12, author = {Ali Alatabbi and Maxime Crochemore and Costas S. Iliopoulos and Tewogboye A. Okanlawon}, editor = {Vidyasagar M. Potdar and Debajyoti Mukhopadhyay}, title = {Overlapping repetitions in weighted sequence}, booktitle = {{CUBE} International {IT} Conference {\&} Exhibition, {CUBE} '12, Pune, India - September 03 - 06, 2012}, pages = {435--440}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2381716.2381798}, doi = {10.1145/2381716.2381798}, timestamp = {Fri, 01 Mar 2019 14:49:59 +0100}, biburl = {https://dblp.org/rec/conf/cube/AlatabbiCIO12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cube/AlatabbiCDM12, author = {Ali Alatabbi and Maxime Crochemore and Jacqueline W. Daykin and Laurent Mouchard}, editor = {Vidyasagar M. Potdar and Debajyoti Mukhopadhyay}, title = {Lyndon fountains and the Burrows-Wheeler transform}, booktitle = {{CUBE} International {IT} Conference {\&} Exhibition, {CUBE} '12, Pune, India - September 03 - 06, 2012}, pages = {441--446}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2381716.2381799}, doi = {10.1145/2381716.2381799}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cube/AlatabbiCDM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/BadkobehCT12, author = {Golnaz Badkobeh and Maxime Crochemore and Chalita Toopsuwan}, editor = {Liliana Calder{\'{o}}n{-}Benavides and Cristina N. Gonz{\'{a}}lez{-}Caro and Edgar Ch{\'{a}}vez and Nivio Ziviani}, title = {Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time}, booktitle = {String Processing and Information Retrieval - 19th International Symposium, {SPIRE} 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7608}, pages = {61--72}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34109-0\_8}, doi = {10.1007/978-3-642-34109-0\_8}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/conf/spire/BadkobehCT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1201-6162, author = {Michalis Christou and Maxime Crochemore and Costas S. Iliopoulos}, title = {Quasiperiodicities in Fibonacci strings}, journal = {CoRR}, volume = {abs/1201.6162}, year = {2012}, url = {http://arxiv.org/abs/1201.6162}, eprinttype = {arXiv}, eprint = {1201.6162}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1201-6162.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1207-1307, author = {Michalis Christou and Maxime Crochemore and Costas S. Iliopoulos}, title = {Identifying all abelian periods of a string in quadratic time and relevant problems}, journal = {CoRR}, volume = {abs/1207.1307}, year = {2012}, url = {http://arxiv.org/abs/1207.1307}, eprinttype = {arXiv}, eprint = {1207.1307}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1207-1307.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1207-5723, author = {Golnaz Badkobeh and Maxime Crochemore}, title = {Fewest repetitions in infinite binary words}, journal = {CoRR}, volume = {abs/1207.5723}, year = {2012}, url = {http://arxiv.org/abs/1207.5723}, eprinttype = {arXiv}, eprint = {1207.5723}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1207-5723.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1208-3313, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Marcin Kubica and Jakub Pachocki and Jakub Radoszewski and Wojciech Rytter and Wojciech Tyczynski and Tomasz Walen}, title = {A Note on Efficient Computation of All Abelian Periods in a String}, journal = {CoRR}, volume = {abs/1208.3313}, year = {2012}, url = {http://arxiv.org/abs/1208.3313}, eprinttype = {arXiv}, eprint = {1208.3313}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1208-3313.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1211-5108, author = {Maxime Crochemore and Alessio Langiu and Filippo Mignosi}, title = {The Rightmost Equal-Cost Position Problem}, journal = {CoRR}, volume = {abs/1211.5108}, year = {2012}, url = {http://arxiv.org/abs/1211.5108}, eprinttype = {arXiv}, eprint = {1211.5108}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1211-5108.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1211-5350, author = {Maxime Crochemore and Alessio Langiu and Filippo Mignosi}, title = {Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression}, journal = {CoRR}, volume = {abs/1211.5350}, year = {2012}, url = {http://arxiv.org/abs/1211.5350}, eprinttype = {arXiv}, eprint = {1211.5350}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1211-5350.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/CrochemoreG11, author = {Maxime Crochemore and Dov M. Gabbay}, title = {Reactive automata}, journal = {Inf. Comput.}, volume = {209}, number = {4}, pages = {692--704}, year = {2011}, url = {https://doi.org/10.1016/j.ic.2011.01.002}, doi = {10.1016/J.IC.2011.01.002}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/CrochemoreG11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreT11, author = {Maxime Crochemore and German Tischler}, title = {Computing Longest Previous non-overlapping Factors}, journal = {Inf. Process. Lett.}, volume = {111}, number = {6}, pages = {291--295}, year = {2011}, url = {https://doi.org/10.1016/j.ipl.2010.12.005}, doi = {10.1016/J.IPL.2010.12.005}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreIT11, author = {Maxime Crochemore and Lucian Ilie and Liviu Tinta}, title = {The "runs" conjecture}, journal = {Theor. Comput. Sci.}, volume = {412}, number = {27}, pages = {2931--2941}, year = {2011}, url = {https://doi.org/10.1016/j.tcs.2010.06.019}, doi = {10.1016/J.TCS.2010.06.019}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreIT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/BealCMS11, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore and Bruce E. Moision and Paul H. Siegel}, title = {Periodic-Finite-Type Shift Spaces}, journal = {{IEEE} Trans. Inf. Theory}, volume = {57}, number = {6}, pages = {3677--3691}, year = {2011}, url = {https://doi.org/10.1109/TIT.2011.2143910}, doi = {10.1109/TIT.2011.2143910}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/BealCMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/ChristouCGIP11, author = {Michalis Christou and Maxime Crochemore and Ondrej Guth and Costas S. Iliopoulos and Solon P. Pissis}, editor = {Bin Fu and Ding{-}Zhu Du}, title = {On the Right-Seed Array of a String}, booktitle = {Computing and Combinatorics - 17th Annual International Conference, {COCOON} 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6842}, pages = {492--502}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22685-4\_43}, doi = {10.1007/978-3-642-22685-4\_43}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/ChristouCGIP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/ChristouCIKPRRSW11, author = {Michalis Christou and Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Bartosz Szreder and Tomasz Walen}, editor = {Raffaele Giancarlo and Giovanni Manzini}, title = {Efficient Seeds Computation Revisited}, booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011, Palermo, Italy, June 27-29, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6661}, pages = {350--363}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-21458-5\_30}, doi = {10.1007/978-3-642-21458-5\_30}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/cpm/ChristouCIKPRRSW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dlt/BadkobehCC11, author = {Golnaz Badkobeh and Supaporn Chairungsee and Maxime Crochemore}, editor = {Giancarlo Mauri and Alberto Leporati}, title = {Hunting Redundancies in Strings}, booktitle = {Developments in Language Theory - 15th International Conference, {DLT} 2011, Milan, Italy, July 19-22, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6795}, pages = {1--14}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22321-1\_1}, doi = {10.1007/978-3-642-22321-1\_1}, timestamp = {Sat, 09 Apr 2022 12:37:59 +0200}, biburl = {https://dblp.org/rec/conf/dlt/BadkobehCC11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/ChristouCFIJMP11, author = {Michalis Christou and Maxime Crochemore and Tom{\'{a}}s Flouri and Costas S. Iliopoulos and Jan Janousek and Borivoj Melichar and Solon P. Pissis}, editor = {Roberto Grossi and Fabrizio Sebastiani and Fabrizio Silvestri}, title = {Computing All Subtree Repeats in Ordered Ranked Trees}, booktitle = {String Processing and Information Retrieval, 18th International Symposium, {SPIRE} 2011, Pisa, Italy, October 17-21, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7024}, pages = {338--343}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-24583-1\_33}, doi = {10.1007/978-3-642-24583-1\_33}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/ChristouCFIJMP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wia/ChairungseeC11, author = {Supaporn Chairungsee and Maxime Crochemore}, editor = {B{\'{e}}atrice Bouchou{-}Markhoff and Pascal Caron and Jean{-}Marc Champarnaud and Denis Maurel}, title = {Building Phylogeny with Minimal Absent Words}, booktitle = {Implementation and Application of Automata - 16th International Conference, {CIAA} 2011, Blois, France, July 13-16, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6807}, pages = {100--109}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22256-6\_10}, doi = {10.1007/978-3-642-22256-6\_10}, timestamp = {Tue, 14 May 2019 10:00:41 +0200}, biburl = {https://dblp.org/rec/conf/wia/ChairungseeC11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/corr/abs-1108-3619, author = {Golnaz Badkobeh and Maxime Crochemore}, editor = {Petr Ambroz and Stepan Holub and Zuzana Mas{\'{a}}kov{\'{a}}}, title = {Finite-Repetition threshold for infinite ternary words}, booktitle = {Proceedings 8th International Conference Words 2011, Prague, Czech Republic, 12-16th September 2011}, series = {{EPTCS}}, volume = {63}, pages = {37--43}, year = {2011}, url = {https://doi.org/10.4204/EPTCS.63.7}, doi = {10.4204/EPTCS.63.7}, timestamp = {Wed, 12 Sep 2018 01:05:13 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1108-3619.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1104-3153, author = {Michalis Christou and Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Bartosz Szreder and Tomasz Walen}, title = {Efficient Seeds Computation Revisited}, journal = {CoRR}, volume = {abs/1104.3153}, year = {2011}, url = {http://arxiv.org/abs/1104.3153}, eprinttype = {arXiv}, eprint = {1104.3153}, timestamp = {Sat, 23 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1104-3153.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/CrochemoreKMN11, author = {Maxime Crochemore and Lila Kari and Mehryar Mohri and Dirk Nowotka}, title = {Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081)}, journal = {Dagstuhl Reports}, volume = {1}, number = {2}, pages = {47--66}, year = {2011}, url = {https://doi.org/10.4230/DagRep.1.2.47}, doi = {10.4230/DAGREP.1.2.47}, timestamp = {Wed, 07 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/CrochemoreKMN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/CrochemoreKWIR10, author = {Maxime Crochemore and Marcin Kubica and Tomasz Walen and Costas S. Iliopoulos and M. Sohel Rahman}, title = {Finding Patterns In Given Intervals}, journal = {Fundam. Informaticae}, volume = {101}, number = {3}, pages = {173--186}, year = {2010}, url = {https://doi.org/10.3233/FI-2010-283}, doi = {10.3233/FI-2010-283}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/fuin/CrochemoreKWIR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/CrochemoreP10, author = {Maxime Crochemore and Ely Porat}, title = {Fast computation of a longest increasing subsequence and application}, journal = {Inf. Comput.}, volume = {208}, number = {9}, pages = {1054--1059}, year = {2010}, url = {https://doi.org/10.1016/j.ic.2010.04.003}, doi = {10.1016/J.IC.2010.04.003}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/CrochemoreP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/CrochemoreFIJ10, author = {Maxime Crochemore and Szil{\'{a}}rd Zsolt Fazekas and Costas S. Iliopoulos and Inuka Jayasekera}, title = {Number of Occurrences of powers in Strings}, journal = {Int. J. Found. Comput. Sci.}, volume = {21}, number = {4}, pages = {535--547}, year = {2010}, url = {https://doi.org/10.1142/S0129054110007416}, doi = {10.1142/S0129054110007416}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/CrochemoreFIJ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/CrochemoreIP10, author = {Maxime Crochemore and Costas S. Iliopoulos and Solon P. Pissis}, editor = {Tapio Elomaa and Heikki Mannila and Pekka Orponen}, title = {A Parallel Algorithm for Fixed-Length Approximate String-Matching with \emph{k}-mismatches}, booktitle = {Algorithms and Applications, Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday}, series = {Lecture Notes in Computer Science}, volume = {6060}, pages = {92--101}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-12476-1\_6}, doi = {10.1007/978-3-642-12476-1\_6}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/birthday/CrochemoreIP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CrochemoreIPT10, author = {Maxime Crochemore and Costas S. Iliopoulos and Solon P. Pissis and German Tischler}, editor = {Amihood Amir and Laxmi Parida}, title = {Cover Array String Reconstruction}, booktitle = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010, New York, NY, USA, June 21-23, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6129}, pages = {251--259}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13509-5\_23}, doi = {10.1007/978-3-642-13509-5\_23}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/cpm/CrochemoreIPT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CrochemoreCIKRRW10, author = {Maxime Crochemore and Marek Cygan and Costas S. Iliopoulos and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Amihood Amir and Laxmi Parida}, title = {Algorithms for Three Versions of the Shortest Common Superstring Problem}, booktitle = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010, New York, NY, USA, June 21-23, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6129}, pages = {299--309}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13509-5\_27}, doi = {10.1007/978-3-642-13509-5\_27}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/CrochemoreCIKRRW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwoca/CrochemoreKRRW10, author = {Maxime Crochemore and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Costas S. Iliopoulos and William F. Smyth}, title = {On the Maximal Sum of Exponents of Runsin a String}, booktitle = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010, London, UK, July 26-28, 2010, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {6460}, pages = {10--19}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-19222-7\_2}, doi = {10.1007/978-3-642-19222-7\_2}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/CrochemoreKRRW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwoca/CrochemoreGLMR10, author = {Maxime Crochemore and Laura Giambruno and Alessio Langiu and Filippo Mignosi and Antonio Restivo}, editor = {Costas S. Iliopoulos and William F. Smyth}, title = {Dictionary-Symbolwise Flexible Parsing}, booktitle = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010, London, UK, July 26-28, 2010, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {6460}, pages = {390--403}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-19222-7\_38}, doi = {10.1007/978-3-642-19222-7\_38}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/CrochemoreGLMR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lata/CrochemoreIKRRW10, author = {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Adrian{-}Horia Dediu and Henning Fernau and Carlos Mart{\'{\i}}n{-}Vide}, title = {On the Maximal Number of Cubic Runs in a String}, booktitle = {Language and Automata Theory and Applications, 4th International Conference, {LATA} 2010, Trier, Germany, May 24-28, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6031}, pages = {227--238}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13089-2\_19}, doi = {10.1007/978-3-642-13089-2\_19}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/lata/CrochemoreIKRRW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/CrochemoreIKRW10, author = {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Wojciech Rytter and Tomasz Walen}, editor = {Jan van Leeuwen and Anca Muscholl and David Peleg and Jaroslav Pokorn{\'{y}} and Bernhard Rumpe}, title = {Efficient Algorithms for Two Extensions of {LPF} Table: The Power of Suffix Arrays}, booktitle = {{SOFSEM} 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Ml{\'{y}}n, Czech Republic, January 23-29, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5901}, pages = {296--307}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-11266-9\_25}, doi = {10.1007/978-3-642-11266-9\_25}, timestamp = {Sat, 30 Sep 2023 09:57:10 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/CrochemoreIKRW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/CrochemoreIKRRW10, author = {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Edgar Ch{\'{a}}vez and Stefano Lonardi}, title = {Extracting Powers and Periods in a String from Its Runs Structure}, booktitle = {String Processing and Information Retrieval - 17th International Symposium, {SPIRE} 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6393}, pages = {258--269}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16321-0\_27}, doi = {10.1007/978-3-642-16321-0\_27}, timestamp = {Sat, 05 Sep 2020 18:08:29 +0200}, biburl = {https://dblp.org/rec/conf/spire/CrochemoreIKRRW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/CrochemoreT10, author = {Maxime Crochemore and German Tischler}, editor = {Edgar Ch{\'{a}}vez and Stefano Lonardi}, title = {The Gapped Suffix Array: {A} New Index Structure for Fast Approximate Matching}, booktitle = {String Processing and Information Retrieval - 17th International Symposium, {SPIRE} 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6393}, pages = {359--364}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16321-0\_37}, doi = {10.1007/978-3-642-16321-0\_37}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/CrochemoreT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stringology/CrochemoreG10, author = {Maxime Crochemore and Dov M. Gabbay}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Reactive Links to Save Automata States}, booktitle = {Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010}, pages = {1--8}, publisher = {Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2010}, url = {http://www.stringology.org/event/2010/p01.html}, timestamp = {Wed, 10 Feb 2021 08:42:22 +0100}, biburl = {https://dblp.org/rec/conf/stringology/CrochemoreG10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stringology/CrochemoreIKRRSW10, author = {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Krzysztof Stencel and Tomasz Walen}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {New Simple Efficient Algorithms Computing Powers and Runs in Strings}, booktitle = {Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010}, pages = {138--149}, publisher = {Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2010}, url = {http://www.stringology.org/event/2010/p12.html}, timestamp = {Wed, 10 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stringology/CrochemoreIKRRSW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stringology/BadkobehC10, author = {Golnaz Badkobeh and Maxime Crochemore}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Bounded Number of Squares in Infinite Repetition-Constrained Binary Words}, booktitle = {Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010}, pages = {161--166}, publisher = {Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2010}, url = {http://www.stringology.org/event/2010/p14.html}, timestamp = {Wed, 10 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stringology/BadkobehC10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1003-4866, author = {Maxime Crochemore and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, title = {On the maximal sum of exponents of runs in a string}, journal = {CoRR}, volume = {abs/1003.4866}, year = {2010}, url = {http://arxiv.org/abs/1003.4866}, eprinttype = {arXiv}, eprint = {1003.4866}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1003-4866.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreEGM09, author = {Maxime Crochemore and Chiara Epifanio and Alessandra Gabriele and Filippo Mignosi}, title = {From Nerode's congruence to suffix automata with mismatches}, journal = {Theor. Comput. Sci.}, volume = {410}, number = {37}, pages = {3471--3480}, year = {2009}, url = {https://doi.org/10.1016/j.tcs.2009.03.011}, doi = {10.1016/J.TCS.2009.03.011}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreEGM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreIR09, author = {Maxime Crochemore and Lucian Ilie and Wojciech Rytter}, title = {Repetitions in strings: Algorithms and combinatorics}, journal = {Theor. Comput. Sci.}, volume = {410}, number = {50}, pages = {5227--5235}, year = {2009}, url = {https://doi.org/10.1016/j.tcs.2009.08.024}, doi = {10.1016/J.TCS.2009.08.024}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreIR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwoca/CrochemoreIIKRW09, author = {Maxime Crochemore and Lucian Ilie and Costas S. Iliopoulos and Marcin Kubica and Wojciech Rytter and Tomasz Walen}, editor = {Jir{\'{\i}} Fiala and Jan Kratochv{\'{\i}}l and Mirka Miller}, title = {{LPF} Computation Revisited}, booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009, Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {5874}, pages = {158--169}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10217-2\_18}, doi = {10.1007/978-3-642-10217-2\_18}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/CrochemoreIIKRW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ClementCR09, author = {Julien Cl{\'{e}}ment and Maxime Crochemore and Giuseppina Rindone}, editor = {Susanne Albers and Jean{-}Yves Marion}, title = {Reverse Engineering Prefix Tables}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings}, series = {LIPIcs}, volume = {3}, pages = {289--300}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2009}, url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1825}, doi = {10.4230/LIPICS.STACS.2009.1825}, timestamp = {Tue, 22 Jun 2021 15:43:57 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ClementCR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stringology/CrochemoreG09, author = {Maxime Crochemore and Laura Giambruno}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {On-line Construction of a Small Automaton for a Finite Set of Words}, booktitle = {Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31 - September 2, 2009}, pages = {15--28}, publisher = {Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague}, year = {2009}, url = {http://www.stringology.org/event/2009/p03.html}, timestamp = {Wed, 10 Feb 2021 08:42:20 +0100}, biburl = {https://dblp.org/rec/conf/stringology/CrochemoreG09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/db/CrochemoreL09, author = {Maxime Crochemore and Thierry Lecroq}, editor = {Ling Liu and M. Tamer {\"{O}}zsu}, title = {Suffix Tree}, booktitle = {Encyclopedia of Database Systems}, pages = {2876--2880}, publisher = {Springer {US}}, year = {2009}, url = {https://doi.org/10.1007/978-0-387-39940-9\_1142}, doi = {10.1007/978-0-387-39940-9\_1142}, timestamp = {Sun, 02 Jun 2019 21:10:27 +0200}, biburl = {https://dblp.org/rec/reference/db/CrochemoreL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/db/CrochemoreL09a, author = {Maxime Crochemore and Thierry Lecroq}, editor = {Ling Liu and M. Tamer {\"{O}}zsu}, title = {Trie}, booktitle = {Encyclopedia of Database Systems}, pages = {3179--3182}, publisher = {Springer {US}}, year = {2009}, url = {https://doi.org/10.1007/978-0-387-39940-9\_1143}, doi = {10.1007/978-0-387-39940-9\_1143}, timestamp = {Wed, 12 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/db/CrochemoreL09a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0907-2157, author = {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, title = {On the maximal number of highly periodic runs in a string}, journal = {CoRR}, volume = {abs/0907.2157}, year = {2009}, url = {http://arxiv.org/abs/0907.2157}, eprinttype = {arXiv}, eprint = {0907.2157}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0907-2157.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/RohCIP08, author = {Kangho Roh and Maxime Crochemore and Costas S. Iliopoulos and Kunsoo Park}, title = {External Memory Algorithms for String Problems}, journal = {Fundam. Informaticae}, volume = {84}, number = {1}, pages = {17--32}, year = {2008}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi84-1-03}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/RohCIP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreI08, author = {Maxime Crochemore and Lucian Ilie}, title = {Computing Longest Previous Factor in linear time and applications}, journal = {Inf. Process. Lett.}, volume = {106}, number = {2}, pages = {75--80}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2007.10.006}, doi = {10.1016/J.IPL.2007.10.006}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreI08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreIR08, author = {Maxime Crochemore and Costas S. Iliopoulos and Mohammad Sohel Rahman}, title = {Optimal prefix and suffix queries on texts}, journal = {Inf. Process. Lett.}, volume = {108}, number = {5}, pages = {320--325}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.05.027}, doi = {10.1016/J.IPL.2008.05.027}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreIR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/CrochemoreI08, author = {Maxime Crochemore and Lucian Ilie}, title = {Maximal repetitions in strings}, journal = {J. Comput. Syst. Sci.}, volume = {74}, number = {5}, pages = {796--807}, year = {2008}, url = {https://doi.org/10.1016/j.jcss.2007.09.003}, doi = {10.1016/J.JCSS.2007.09.003}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/CrochemoreI08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mics/ChanC08, author = {Joseph Wun{-}Tat Chan and Maxime Crochemore}, title = {Foreword}, journal = {Math. Comput. Sci.}, volume = {1}, number = {4}, pages = {541--542}, year = {2008}, url = {https://doi.org/10.1007/s11786-007-0034-2}, doi = {10.1007/S11786-007-0034-2}, timestamp = {Wed, 12 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mics/ChanC08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreHLRV08, author = {Maxime Crochemore and Danny Hermelin and Gad M. Landau and Dror Rawitz and St{\'{e}}phane Vialette}, title = {Approximating the 2-interval pattern problem}, journal = {Theor. Comput. Sci.}, volume = {395}, number = {2-3}, pages = {283--297}, year = {2008}, url = {https://doi.org/10.1016/j.tcs.2008.01.007}, doi = {10.1016/J.TCS.2008.01.007}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreHLRV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/bcs/CrochemoreP08, author = {Maxime Crochemore and Ely Porat}, editor = {Erol Gelenbe and Samson Abramsky and Vladimiro Sassone}, title = {Computing a Longest Increasing Subsequence of Length k in Time O(n log log k)}, booktitle = {Visions of Computer Science - {BCS} International Academic Conference, Imperial College, London, UK, 22-24 September 2008}, pages = {69--74}, publisher = {British Computer Society}, year = {2008}, url = {http://www.bcs.org/server.php?show=ConWebDoc.22851}, timestamp = {Mon, 21 Sep 2009 12:13:42 +0200}, biburl = {https://dblp.org/rec/conf/bcs/CrochemoreP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CrochemoreIT08, author = {Maxime Crochemore and Lucian Ilie and Liviu Tinta}, editor = {Paolo Ferragina and Gad M. Landau}, title = {Towards a Solution to the "Runs" Conjecture}, booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008, Pisa, Italy, June 18-20, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5029}, pages = {290--302}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-69068-9\_27}, doi = {10.1007/978-3-540-69068-9\_27}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/CrochemoreIT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dcc/CrochemoreIS08, author = {Maxime Crochemore and Lucian Ilie and William F. Smyth}, title = {A Simple Algorithm for Computing the Lempel Ziv Factorization}, booktitle = {2008 Data Compression Conference {(DCC} 2008), 25-27 March 2008, Snowbird, UT, {USA}}, pages = {482--488}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/DCC.2008.36}, doi = {10.1109/DCC.2008.36}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dcc/CrochemoreIS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dlt/CrochemoreFIJ08, author = {Maxime Crochemore and Szil{\'{a}}rd Zsolt Fazekas and Costas S. Iliopoulos and Inuka Jayasekera}, editor = {Masami Ito and Masafumi Toyama}, title = {Bounds on Powers in Strings}, booktitle = {Developments in Language Theory, 12th International Conference, {DLT} 2008, Kyoto, Japan, September 16-19, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5257}, pages = {206--215}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85780-8\_16}, doi = {10.1007/978-3-540-85780-8\_16}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/dlt/CrochemoreFIJ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ifipTCS/CrochemoreGMP08, author = {Maxime Crochemore and Alessandra Gabriele and Filippo Mignosi and Mauriana Pesaresi}, editor = {Giorgio Ausiello and Juhani Karhum{\"{a}}ki and Giancarlo Mauri and C.{-}H. Luke Ong}, title = {On the Longest Common Factor Problem}, booktitle = {Fifth {IFIP} International Conference On Theoretical Computer Science - {TCS} 2008, {IFIP} 20th World Computer Congress, {TC} 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy}, series = {{IFIP}}, volume = {273}, pages = {143--155}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-0-387-09680-3\_10}, doi = {10.1007/978-0-387-09680-3\_10}, timestamp = {Fri, 27 Sep 2019 10:35:17 +0200}, biburl = {https://dblp.org/rec/conf/ifipTCS/CrochemoreGMP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/CrochemoreI08, author = {Maxime Crochemore and Lucian Ilie}, editor = {Susanne Albers and Pascal Weil}, title = {Understanding Maximal Repetitions in Strings}, booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings}, series = {LIPIcs}, volume = {1}, pages = {11--16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2008}, url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1344}, doi = {10.4230/LIPICS.STACS.2008.1344}, timestamp = {Tue, 22 Jun 2021 15:44:08 +0200}, biburl = {https://dblp.org/rec/conf/stacs/CrochemoreI08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/IliopoulosCKRW08, author = {Maxime Crochemore and Costas S. Iliopoulos and Marcin Kubica and Mohammad Sohel Rahman and Tomasz Walen}, editor = {Susanne Albers and Pascal Weil}, title = {Improved Algorithms for the Range Next Value Problem and Applications}, booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings}, series = {LIPIcs}, volume = {1}, pages = {205--216}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2008}, url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1359}, doi = {10.4230/LIPICS.STACS.2008.1359}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/IliopoulosCKRW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stringology/AntoniouCIJL08, author = {Pavlos Antoniou and Maxime Crochemore and Costas S. Iliopoulos and Inuka Jayasekera and Gad M. Landau}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Conservative String Covering of Indeterminate Strings}, booktitle = {Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008}, pages = {108--115}, publisher = {Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague}, year = {2008}, url = {http://www.stringology.org/event/2008/p10.html}, timestamp = {Wed, 10 Feb 2021 08:42:20 +0100}, biburl = {https://dblp.org/rec/conf/stringology/AntoniouCIJL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:series/sci/CrochemoreL08, author = {Maxime Crochemore and Thierry Lecroq}, editor = {Gemma Bel Enguix and Mar{\'{\i}}a Dolores Jim{\'{e}}nez{-}L{\'{o}}pez and Carlos Mart{\'{\i}}n{-}Vide}, title = {Alignments and Approximate String Matching}, booktitle = {New Developments in Formal Languages and Applications}, series = {Studies in Computational Intelligence}, volume = {113}, pages = {59--93}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-78291-9\_3}, doi = {10.1007/978-3-540-78291-9\_3}, timestamp = {Mon, 30 May 2022 13:50:02 +0200}, biburl = {https://dblp.org/rec/series/sci/CrochemoreL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/CrochemoreL08, author = {Maxime Crochemore and Thierry Lecroq}, editor = {Ming{-}Yang Kao}, title = {Sequential Exact String Matching}, booktitle = {Encyclopedia of Algorithms - 2008 Edition}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-0-387-30162-4\_365}, doi = {10.1007/978-0-387-30162-4\_365}, timestamp = {Thu, 27 Jun 2019 16:25:31 +0200}, biburl = {https://dblp.org/rec/reference/algo/CrochemoreL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/CrochemoreL08a, author = {Maxime Crochemore and Thierry Lecroq}, editor = {Ming{-}Yang Kao}, title = {Sequential Multiple String Matching}, booktitle = {Encyclopedia of Algorithms - 2008 Edition}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-0-387-30162-4\_366}, doi = {10.1007/978-0-387-30162-4\_366}, timestamp = {Wed, 12 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/CrochemoreL08a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/CrochemoreR08, author = {Maxime Crochemore and Wojciech Rytter}, editor = {Ming{-}Yang Kao}, title = {Squares and Repetitions}, booktitle = {Encyclopedia of Algorithms - 2008 Edition}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-0-387-30162-4\_392}, doi = {10.1007/978-0-387-30162-4\_392}, timestamp = {Wed, 12 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/CrochemoreR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0802-2829, author = {Maxime Crochemore and Lucian Ilie}, title = {Understanding maximal repetitions in strings}, journal = {CoRR}, volume = {abs/0802.2829}, year = {2008}, url = {http://arxiv.org/abs/0802.2829}, eprinttype = {arXiv}, eprint = {0802.2829}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0802-2829.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0020103, author = {Maxime Crochemore and Christophe Hancart and Thierry Lecroq}, title = {Algorithms on strings}, publisher = {Cambridge University Press}, year = {2007}, isbn = {978-0-521-84899-2}, timestamp = {Wed, 23 Mar 2011 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/daglib/0020103.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/CrochemoreIS07, author = {Maxime Crochemore and Lucian Ilie and Emine Seid{-}Hilmi}, title = {The Structure of Factor Oracles}, journal = {Int. J. Found. Comput. Sci.}, volume = {18}, number = {4}, pages = {781--797}, year = {2007}, url = {https://doi.org/10.1142/S0129054107004978}, doi = {10.1142/S0129054107004978}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/CrochemoreIS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isci/CambouropoulosCIMS07, author = {Emilios Cambouropoulos and Maxime Crochemore and Costas S. Iliopoulos and Manal Mohamed and Marie{-}France Sagot}, title = {All maximal-pairs in step-leap representation of melodic sequence}, journal = {Inf. Sci.}, volume = {177}, number = {9}, pages = {1954--1962}, year = {2007}, url = {https://doi.org/10.1016/j.ins.2006.11.012}, doi = {10.1016/J.INS.2006.11.012}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isci/CambouropoulosCIMS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/BealC07, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore}, title = {Minimizing local automata}, booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2007, Nice, France, June 24-29, 2007}, pages = {1376--1380}, publisher = {{IEEE}}, year = {2007}, url = {https://doi.org/10.1109/ISIT.2007.4557131}, doi = {10.1109/ISIT.2007.4557131}, timestamp = {Wed, 16 Oct 2019 14:14:48 +0200}, biburl = {https://dblp.org/rec/conf/isit/BealC07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lata/AntoniouCIP07, author = {Pavlos Antoniou and Maxime Crochemore and Costas S. Iliopoulos and Pierre Peterlongo}, editor = {Remco Loos and Szil{\'{a}}rd Zsolt Fazekas and Carlos Mart{\'{\i}}n{-}Vide}, title = {Application of suffix trees for the acquisition of common motifs with gaps in a set of strings}, booktitle = {{LATA} 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications}, volume = {Report 35/07}, pages = {57--66}, publisher = {Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona}, year = {2007}, timestamp = {Mon, 15 Jun 2015 11:59:26 +0200}, biburl = {https://dblp.org/rec/conf/lata/AntoniouCIP07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/CrochemoreI07, author = {Maxime Crochemore and Lucian Ilie}, editor = {Ludek Kucera and Anton{\'{\i}}n Kucera}, title = {Analysis of Maximal Repetitions in Strings}, booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic, August 26-31, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4708}, pages = {465--476}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74456-6\_42}, doi = {10.1007/978-3-540-74456-6\_42}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/CrochemoreI07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/CrochemoreIR07, author = {Maxime Crochemore and Costas S. Iliopoulos and M. Sohel Rahman}, editor = {Ludek Kucera and Anton{\'{\i}}n Kucera}, title = {Finding Patterns in Given Intervals}, booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic, August 26-31, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4708}, pages = {645--656}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74456-6\_57}, doi = {10.1007/978-3-540-74456-6\_57}, timestamp = {Thu, 25 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/CrochemoreIR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wia/CrochemoreEGM07, author = {Maxime Crochemore and Chiara Epifanio and Alessandra Gabriele and Filippo Mignosi}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {On the Suffix Automaton with Mismatches}, booktitle = {Implementation and Application of Automata, 12th International Conference, {CIAA} 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {4783}, pages = {144--156}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-76336-9\_15}, doi = {10.1007/978-3-540-76336-9\_15}, timestamp = {Tue, 14 May 2019 10:00:41 +0200}, biburl = {https://dblp.org/rec/conf/wia/CrochemoreEGM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreIMS06, author = {Maxime Crochemore and Costas S. Iliopoulos and Manal Mohamed and Marie{-}France Sagot}, title = {Longest repeats with a block of \emph{k} don't cares}, journal = {Theor. Comput. Sci.}, volume = {362}, number = {1-3}, pages = {248--254}, year = {2006}, url = {https://doi.org/10.1016/j.tcs.2006.06.029}, doi = {10.1016/J.TCS.2006.06.029}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreIMS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wia/CrochemoreIS06, author = {Maxime Crochemore and Lucian Ilie and Emine Seid{-}Hilmi}, editor = {Oscar H. Ibarra and Hsu{-}Chun Yen}, title = {Factor Oracles}, booktitle = {Implementation and Application of Automata, 11th International Conference, {CIAA} 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4094}, pages = {78--89}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11812128\_9}, doi = {10.1007/11812128\_9}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wia/CrochemoreIS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:series/sci/CrochemoreL06, author = {Maxime Crochemore and Thierry Lecroq}, editor = {Zolt{\'{a}}n {\'{E}}sik and Carlos Mart{\'{\i}}n{-}Vide and Victor Mitrana}, title = {Text Searching and Indexing}, booktitle = {Recent Advances in Formal Languages and Applications}, series = {Studies in Computational Intelligence}, volume = {25}, pages = {43--80}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/978-3-540-33461-3\_3}, doi = {10.1007/978-3-540-33461-3\_3}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/series/sci/CrochemoreL06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/Baeza-YatesC05, author = {Ricardo A. Baeza{-}Yates and Maxime Crochemore}, title = {Foreword}, journal = {J. Discrete Algorithms}, volume = {3}, number = {2-4}, pages = {125}, year = {2005}, url = {https://doi.org/10.1016/j.jda.2004.08.001}, doi = {10.1016/J.JDA.2004.08.001}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/Baeza-YatesC05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CrochemoreINPS05, author = {Maxime Crochemore and Costas S. Iliopoulos and Gonzalo Navarro and Yoan J. Pinz{\'{o}}n and Alejandro Salinger}, title = {Bit-parallel (\emph{delta}, \emph{gamma})-matching and suffix automata}, journal = {J. Discrete Algorithms}, volume = {3}, number = {2-4}, pages = {198--214}, year = {2005}, url = {https://doi.org/10.1016/j.jda.2004.08.005}, doi = {10.1016/J.JDA.2004.08.005}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CrochemoreINPS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcbb/PisantiCGS05, author = {Nadia Pisanti and Maxime Crochemore and Roberto Grossi and Marie{-}France Sagot}, title = {Bases of Motifs for Generating Repeated Patterns with Wild Cards}, journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.}, volume = {2}, number = {1}, pages = {40--50}, year = {2005}, url = {https://doi.org/10.1109/TCBB.2005.5}, doi = {10.1109/TCBB.2005.5}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcbb/PisantiCGS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreDP05, author = {Maxime Crochemore and Jacques D{\'{e}}sarm{\'{e}}nien and Dominique Perrin}, title = {A note on the Burrows - CWheeler transformation}, journal = {Theor. Comput. Sci.}, volume = {332}, number = {1-3}, pages = {567--572}, year = {2005}, url = {https://doi.org/10.1016/j.tcs.2004.11.014}, doi = {10.1016/J.TCS.2004.11.014}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreDP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/BealCF05, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore and Gabriele Fici}, title = {Presentations of constrained systems with unconstrained positions}, journal = {{IEEE} Trans. Inf. Theory}, volume = {51}, number = {5}, pages = {1891--1900}, year = {2005}, url = {https://doi.org/10.1109/TIT.2005.846423}, doi = {10.1109/TIT.2005.846423}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/BealCF05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/CrochemoreHLV05, author = {Maxime Crochemore and Danny Hermelin and Gad M. Landau and St{\'{e}}phane Vialette}, editor = {Gerth St{\o}lting Brodal and Stefano Leonardi}, title = {Approximating the 2-Interval Pattern Problem}, booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3669}, pages = {426--437}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11561071\_39}, doi = {10.1007/11561071\_39}, timestamp = {Tue, 27 Dec 2022 09:06:31 +0100}, biburl = {https://dblp.org/rec/conf/esa/CrochemoreHLV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ismir/CambouropoulosCIMS05, author = {Emilios Cambouropoulos and Maxime Crochemore and Costas S. Iliopoulos and Manal Mohamed and Marie{-}France Sagot}, title = {A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories}, booktitle = {{ISMIR} 2005, 6th International Conference on Music Information Retrieval, London, UK, 11-15 September 2005, Proceedings}, pages = {167--174}, year = {2005}, url = {http://ismir2005.ismir.net/proceedings/1022.pdf}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ismir/CambouropoulosCIMS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/cpm/2005, editor = {Alberto Apostolico and Maxime Crochemore and Kunsoo Park}, title = {Combinatorial Pattern Matching, 16th Annual Symposium, {CPM} 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3537}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/b137128}, doi = {10.1007/B137128}, isbn = {3-540-26201-6}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/2005.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-cs-0502073, author = {Maxime Crochemore and Jacques D{\'{e}}sarm{\'{e}}nien and Dominique Perrin}, title = {A note on the Burrows-Wheeler transformation}, journal = {CoRR}, volume = {abs/cs/0502073}, year = {2005}, url = {http://arxiv.org/abs/cs/0502073}, eprinttype = {arXiv}, eprint = {cs/0502073}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-cs-0502073.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/AmirBCLS04, author = {Amihood Amir and Ayelet Butman and Maxime Crochemore and Gad M. Landau and Malka Schaps}, title = {Two-dimensional pattern matching with rotations}, journal = {Theor. Comput. Sci.}, volume = {314}, number = {1-2}, pages = {173--187}, year = {2004}, url = {https://doi.org/10.1016/j.tcs.2003.10.039}, doi = {10.1016/J.TCS.2003.10.039}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AmirBCLS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CrochemoreEGM04, author = {Maxime Crochemore and Chiara Epifanio and Roberto Grossi and Filippo Mignosi}, editor = {S{\"{u}}leyman Cenk Sahinalp and S. Muthukrishnan and Ugur Dogrus{\"{o}}z}, title = {A Trie-Based Approach for Compacting Automata}, booktitle = {Combinatorial Pattern Matching, 15th Annual Symposium, {CPM} 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3109}, pages = {145--158}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-27801-6\_11}, doi = {10.1007/978-3-540-27801-6\_11}, timestamp = {Fri, 07 May 2021 12:57:04 +0200}, biburl = {https://dblp.org/rec/conf/cpm/CrochemoreEGM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/CrochemoreIMS04, author = {Maxime Crochemore and Costas S. Iliopoulos and Manal Mohamed and Marie{-}France Sagot}, editor = {Martin Farach{-}Colton}, title = {Longest Repeats with a Block of Don't Cares}, booktitle = {{LATIN} 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2976}, pages = {271--278}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-24698-5\_31}, doi = {10.1007/978-3-540-24698-5\_31}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/latin/CrochemoreIMS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/CrochemoreGS04, author = {Maxime Crochemore and Raffaele Giancarlo and Marie{-}France Sagot}, editor = {Alberto Apostolico and Massimo Melucci}, title = {Longest Motifs with a Functionally Equivalent Central Block}, booktitle = {String Processing and Information Retrieval, 11th International Conference, {SPIRE} 2004, Padova, Italy, October 5-8, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3246}, pages = {298--209}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30213-1\_42}, doi = {10.1007/978-3-540-30213-1\_42}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/conf/spire/CrochemoreGS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/CrochemoreIL03, author = {Maxime Crochemore and Costas S. Iliopoulos and Thierry Lecroq}, title = {Occurrence and Substring Heuristics for i-Matching}, journal = {Fundam. Informaticae}, volume = {56}, number = {1-2}, pages = {1--21}, year = {2003}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi56-1-2-02}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/CrochemoreIL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/CrochemoreIP03, author = {Maxime Crochemore and Costas S. Iliopoulos and Yoan J. Pinz{\'{o}}n}, title = {Speeding-up Hirschberg and Hunt-Szymanski {LCS} Algorithms}, journal = {Fundam. Informaticae}, volume = {56}, number = {1-2}, pages = {89--103}, year = {2003}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi56-1-2-06}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/CrochemoreIP03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/BealCM03, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore and Filippo Mignosi and Antonio Restivo and Marinella Sciortino}, title = {Computing forbidden words of regular languages}, journal = {Fundam. Informaticae}, volume = {56}, number = {1-2}, pages = {121--135}, year = {2003}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi56-1-2-08}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/BealCM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreS03, author = {Maxime Crochemore and Valery T. Stefanov}, title = {Waiting time and complexity for matching patterns with automata}, journal = {Inf. Process. Lett.}, volume = {87}, number = {3}, pages = {119--125}, year = {2003}, url = {https://doi.org/10.1016/S0020-0190(03)00271-0}, doi = {10.1016/S0020-0190(03)00271-0}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CrochemoreHL03, author = {Maxime Crochemore and Christophe Hancart and Thierry Lecroq}, title = {A unifying look at the Apostolico-Giancarlo string-matching algorithm}, journal = {J. Discrete Algorithms}, volume = {1}, number = {1}, pages = {37--52}, year = {2003}, url = {https://doi.org/10.1016/S1570-8667(03)00005-4}, doi = {10.1016/S1570-8667(03)00005-4}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CrochemoreHL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CrochemoreMT03, author = {Maxime Crochemore and Borivoj Melichar and Zdenek Tron{\'{\i}}cek}, title = {Directed acyclic subsequence graph - Overview}, journal = {J. Discrete Algorithms}, volume = {1}, number = {3-4}, pages = {255--280}, year = {2003}, url = {https://doi.org/10.1016/S1570-8667(03)00029-7}, doi = {10.1016/S1570-8667(03)00029-7}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CrochemoreMT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CrochemoreLZ03, author = {Maxime Crochemore and Gad M. Landau and Michal Ziv{-}Ukelson}, title = {A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices}, journal = {{SIAM} J. Comput.}, volume = {32}, number = {6}, pages = {1654--1673}, year = {2003}, url = {https://doi.org/10.1137/S0097539702402007}, doi = {10.1137/S0097539702402007}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/CrochemoreLZ03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Crochemore03, author = {Maxime Crochemore}, title = {Reducing space for index implementation}, journal = {Theor. Comput. Sci.}, volume = {292}, number = {1}, pages = {185--197}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(01)00222-5}, doi = {10.1016/S0304-3975(01)00222-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Crochemore03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/AmirBCLS03, author = {Amihood Amir and Ayelet Butman and Maxime Crochemore and Gad M. Landau and Malka Schaps}, editor = {Ricardo A. Baeza{-}Yates and Edgar Ch{\'{a}}vez and Maxime Crochemore}, title = {Two-Dimensional Pattern Matching with Rotations}, booktitle = {Combinatorial Pattern Matching, 14th Annual Symposium, {CPM} 2003, Morelia, Michoc{\'{a}}n, Mexico, June 25-27, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2676}, pages = {17--31}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/3-540-44888-8\_2}, doi = {10.1007/3-540-44888-8\_2}, timestamp = {Sun, 25 Oct 2020 23:06:11 +0100}, biburl = {https://dblp.org/rec/conf/cpm/AmirBCLS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/PisantiCGS03, author = {Nadia Pisanti and Maxime Crochemore and Roberto Grossi and Marie{-}France Sagot}, editor = {Branislav Rovan and Peter Vojt{\'{a}}s}, title = {A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum}, booktitle = {Mathematical Foundations of Computer Science 2003, 28th International Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2747}, pages = {622--631}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45138-9\_56}, doi = {10.1007/978-3-540-45138-9\_56}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/PisantiCGS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/CrochemoreINP03, author = {Maxime Crochemore and Costas S. Iliopoulos and Gonzalo Navarro and Yoan J. Pinz{\'{o}}n}, editor = {Mario A. Nascimento and Edleno Silva de Moura and Arlindo L. Oliveira}, title = {A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval}, booktitle = {String Processing and Information Retrieval, 10th International Symposium, {SPIRE} 2003, Manaus, Brazil, October 8-10, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2857}, pages = {211--223}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39984-1\_16}, doi = {10.1007/978-3-540-39984-1\_16}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/spire/CrochemoreINP03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/cpm/2003, editor = {Ricardo A. Baeza{-}Yates and Edgar Ch{\'{a}}vez and Maxime Crochemore}, title = {Combinatorial Pattern Matching, 14th Annual Symposium, {CPM} 2003, Morelia, Michoc{\'{a}}n, Mexico, June 25-27, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2676}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/3-540-44888-8}, doi = {10.1007/3-540-44888-8}, isbn = {3-540-40311-6}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/2003.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0020111, author = {Maxime Crochemore and Wojciech Rytter}, title = {Jewels of stringology}, publisher = {World Scientific}, year = {2002}, url = {https://doi.org/10.1142/4838}, doi = {10.1142/4838}, isbn = {978-981-02-4782-9}, timestamp = {Tue, 13 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/daglib/0020111.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijcm/CambouropoulosCIMP02, author = {Emilios Cambouropoulos and Maxime Crochemore and Costas S. Iliopoulos and Laurent Mouchard and Yoan J. Pinz{\'{o}}n}, title = {Algorithms for Computing Approximate Repetitions in Musical Sequences}, journal = {Int. J. Comput. Math.}, volume = {79}, number = {11}, pages = {1135--1148}, year = {2002}, url = {https://doi.org/10.1080/00207160213939}, doi = {10.1080/00207160213939}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijcm/CambouropoulosCIMP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/CrochemoreIMRTT02, author = {Maxime Crochemore and Costas S. Iliopoulos and Christos Makris and Wojciech Rytter and Athanasios K. Tsakalidis and T. Tsichlas}, title = {Approximate String Matching with Gaps}, journal = {Nord. J. Comput.}, volume = {9}, number = {1}, pages = {54--65}, year = {2002}, timestamp = {Fri, 13 Feb 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/CrochemoreIMRTT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CrochemoreILPR02, author = {Maxime Crochemore and Costas S. Iliopoulos and Thierry Lecroq and Wojciech Plandowski and Wojciech Rytter}, editor = {Alberto Apostolico and Masayuki Takeda}, title = {Three Heuristics for delta-Matching: delta-BM Algorithms}, booktitle = {Combinatorial Pattern Matching, 13th Annual Symposium, {CPM} 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2373}, pages = {178--189}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45452-7\_16}, doi = {10.1007/3-540-45452-7\_16}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/CrochemoreILPR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sccc/CrochemoreN02, author = {Maxime Crochemore and Gonzalo Navarro}, title = {Improved Antidictionary Based Compression}, booktitle = {22nd International Conference of the Chilean Computer Science Society {(SCCC} 2002), 6-8 November 2002, Copiapo, Chile}, pages = {7--13}, publisher = {{IEEE} Computer Society}, year = {2002}, url = {https://doi.org/10.1109/SCCC.2002.1173168}, doi = {10.1109/SCCC.2002.1173168}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sccc/CrochemoreN02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/CrochemoreLZ02, author = {Maxime Crochemore and Gad M. Landau and Michal Ziv{-}Ukelson}, editor = {David Eppstein}, title = {A sub-quadratic sequence alignment algorithm for unrestricted cost matrices}, booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, {USA}}, pages = {679--688}, publisher = {{ACM/SIAM}}, year = {2002}, url = {http://dl.acm.org/citation.cfm?id=545381.545472}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/CrochemoreLZ02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/CrochemoreT02, author = {Maxime Crochemore and Zdenek Tron{\'{\i}}cek}, editor = {Alberto H. F. Laender and Arlindo L. Oliveira}, title = {On the Size of {DASG} for Multiple Texts}, booktitle = {String Processing and Information Retrieval, 9th International Symposium, {SPIRE} 2002, Lisbon, Portugal, September 11-13, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2476}, pages = {58--64}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45735-6\_6}, doi = {10.1007/3-540-45735-6\_6}, timestamp = {Mon, 26 Jun 2023 20:44:05 +0200}, biburl = {https://dblp.org/rec/conf/spire/CrochemoreT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wia/HolubC02, author = {Jan Holub and Maxime Crochemore}, editor = {Jean{-}Marc Champarnaud and Denis Maurel}, title = {On the Implementation of Compact DAWG's}, booktitle = {Implementation and Application of Automata, 7th International Conference, {CIAA} 2002, Tours, France, July 3-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2608}, pages = {289--294}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-44977-9\_31}, doi = {10.1007/3-540-44977-9\_31}, timestamp = {Thu, 02 Jun 2022 15:19:47 +0200}, biburl = {https://dblp.org/rec/conf/wia/HolubC02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/CrochemoreIP01, author = {Maxime Crochemore and Costas S. Iliopoulos and Yoan J. Pinz{\'{o}}n}, title = {Computing Evolutionary Chains in Musical Sequences}, journal = {Electron. J. Comb.}, volume = {8}, number = {2}, year = {2001}, url = {https://doi.org/10.37236/1604}, doi = {10.37236/1604}, timestamp = {Fri, 10 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorics/CrochemoreIP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreIPR01, author = {Maxime Crochemore and Costas S. Iliopoulos and Yoan J. Pinz{\'{o}}n and James F. Reid}, title = {A fast and practical bit-vector algorithm for the Longest Common Subsequence problem}, journal = {Inf. Process. Lett.}, volume = {80}, number = {6}, pages = {279--285}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00182-X}, doi = {10.1016/S0020-0190(01)00182-X}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreIPR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/AllauzenCR01, author = {Cyril Allauzen and Maxime Crochemore and Mathieu Raffinot}, editor = {Amihood Amir and Gad M. Landau}, title = {Efficient Experimental String Matching by Weak Factor Recognition}, booktitle = {Combinatorial Pattern Matching, 12th Annual Symposium, {CPM} 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2089}, pages = {51--72}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-48194-X\_5}, doi = {10.1007/3-540-48194-X\_5}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/cpm/AllauzenCR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/CrochemoreIP01, author = {Maxime Crochemore and Costas S. Iliopoulos and Yoan J. Pinz{\'{o}}n}, editor = {Gonzalo Navarro}, title = {Speeding-up Hirschberg and Hunt-Szymanski {LCS} Algorithms}, booktitle = {Eighth International Symposium on String Processing and Information Retrieval, {SPIRE} 2001, Laguna de San Rafael, Chile, November 13-15, 2001}, pages = {59--67}, publisher = {{IEEE} Computer Society}, year = {2001}, url = {https://doi.org/10.1109/SPIRE.2001.989737}, doi = {10.1109/SPIRE.2001.989737}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/spire/CrochemoreIP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stringology/CrochemoreILP01, author = {Maxime Crochemore and Costas S. Iliopoulos and Thierry Lecroq and Yoan J. Pinz{\'{o}}n}, editor = {Miroslav Bal{\'{\i}}k and Milan Sim{\'{a}}nek}, title = {Approximate String Matching in Musical Sequences}, booktitle = {Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, September 4, 2001}, pages = {26--36}, publisher = {Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University}, year = {2001}, url = {http://www.stringology.org/event/2001/p3.html}, timestamp = {Wed, 10 Feb 2021 08:42:24 +0100}, biburl = {https://dblp.org/rec/conf/stringology/CrochemoreILP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pieee/CrochemoreMRS00, author = {Maxime Crochemore and Filippo Mignosi and Antonio Restivo and Sergio Salemi}, title = {Data compression using antidictionaries}, journal = {Proc. {IEEE}}, volume = {88}, number = {11}, pages = {1756--1768}, year = {2000}, url = {https://doi.org/10.1109/5.892711}, doi = {10.1109/5.892711}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pieee/CrochemoreMRS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ismir/CrochemoreIP00, author = {Maxime Crochemore and Costas S. Iliopoulos and Yoan J. Pinz{\'{o}}n}, title = {Finding Motifs with Gaps}, booktitle = {{ISMIR} 2000, 1st International Symposium on Music Information Retrieval, Plymouth, Massachusetts, USA, October 23-25, 2000, Proceedings}, year = {2000}, url = {http://ismir2000.ismir.net/posters/pinzon.pdf}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ismir/CrochemoreIP00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/CrochemoreIP00, author = {Maxime Crochemore and Costas S. Iliopoulos and Yoan J. Pinz{\'{o}}n}, editor = {V{\'{a}}clav Hlav{\'{a}}c and Keith G. Jeffery and Jir{\'{\i}} Wiedermann}, title = {Fast Evolutionary Chains}, booktitle = {{SOFSEM} 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25 - December 2, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1963}, pages = {307--318}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-44411-4\_19}, doi = {10.1007/3-540-44411-4\_19}, timestamp = {Sat, 30 Sep 2023 09:57:10 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/CrochemoreIP00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/candc/CrochemoreV99, author = {Maxime Crochemore and Renaud V{\'{e}}rin}, title = {Zones of Low Entropy in Genomic Sequences}, journal = {Comput. Chem.}, volume = {23}, number = {3-4}, pages = {275--282}, year = {1999}, url = {https://doi.org/10.1016/S0097-8485(99)00009-1}, doi = {10.1016/S0097-8485(99)00009-1}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/candc/CrochemoreV99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreCGLPR99, author = {Maxime Crochemore and Artur Czumaj and Leszek Gasieniec and Thierry Lecroq and Wojciech Plandowski and Wojciech Rytter}, title = {Fast Practical Multi-Pattern Matching}, journal = {Inf. Process. Lett.}, volume = {71}, number = {3-4}, pages = {107--113}, year = {1999}, url = {https://doi.org/10.1016/S0020-0190(99)00092-7}, doi = {10.1016/S0020-0190(99)00092-7}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreCGLPR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreGR99, author = {Maxime Crochemore and Leszek Gasieniec and Wojciech Rytter}, title = {Constant-Space String-Matching in Sublinear Average Time}, journal = {Theor. Comput. Sci.}, volume = {218}, number = {1}, pages = {197--203}, year = {1999}, url = {https://doi.org/10.1016/S0304-3975(98)00259-X}, doi = {10.1016/S0304-3975(98)00259-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreGR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CrochemoreMRS99, author = {Maxime Crochemore and Filippo Mignosi and Antonio Restivo and Sergio Salemi}, editor = {Jir{\'{\i}} Wiedermann and Peter van Emde Boas and Mogens Nielsen}, title = {Text Compression Using Antidictionaries}, booktitle = {Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1644}, pages = {261--270}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48523-6\_23}, doi = {10.1007/3-540-48523-6\_23}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/CrochemoreMRS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/AllauzenCR99, author = {Cyril Allauzen and Maxime Crochemore and Mathieu Raffinot}, editor = {Jan Pavelka and Gerard Tel and Miroslav Bartosek}, title = {Factor Oracle: {A} New Structure for Pattern Matching}, booktitle = {{SOFSEM} '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27 - December 4, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1725}, pages = {295--310}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-47849-3\_18}, doi = {10.1007/3-540-47849-3\_18}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/AllauzenCR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/crc/99/CrochemoreH99, author = {Maxime Crochemore and Christophe Hancart}, editor = {Mikhail J. Atallah}, title = {Pattern Matching in Strings}, booktitle = {Algorithms and Theory of Computation Handbook}, series = {Chapman {\&} Hall/CRC Applied Algorithms and Data Structures series}, publisher = {{CRC} Press}, year = {1999}, url = {https://doi.org/10.1201/9781420049503-c12}, doi = {10.1201/9781420049503-C12}, timestamp = {Fri, 17 Jul 2020 16:12:44 +0200}, biburl = {https://dblp.org/rec/books/crc/99/CrochemoreH99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/crc/99/CrochemoreL99, author = {Maxime Crochemore and Thierry Lecroq}, editor = {Mikhail J. Atallah}, title = {Text Data Compression Algorithms}, booktitle = {Algorithms and Theory of Computation Handbook}, series = {Chapman {\&} Hall/CRC Applied Algorithms and Data Structures series}, publisher = {{CRC} Press}, year = {1999}, url = {https://doi.org/10.1201/9781420049503-c13}, doi = {10.1201/9781420049503-C13}, timestamp = {Mon, 04 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/crc/99/CrochemoreL99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/cpm/1999, editor = {Maxime Crochemore and Mike Paterson}, title = {Combinatorial Pattern Matching, 10th Annual Symposium, {CPM} 99, Warwick University, UK, July 22-24, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1645}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48452-3}, doi = {10.1007/3-540-48452-3}, isbn = {3-540-66278-2}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/1999.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/CrochemoreIK98, author = {Maxime Crochemore and Costas S. Iliopoulos and Maureen Korda}, title = {Two-Dimensional Prefix String Matching and Covering on Square Matrices}, journal = {Algorithmica}, volume = {20}, number = {4}, pages = {353--373}, year = {1998}, url = {https://doi.org/10.1007/PL00009200}, doi = {10.1007/PL00009200}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/CrochemoreIK98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreMR98, author = {Maxime Crochemore and Filippo Mignosi and Antonio Restivo}, title = {Automata and Forbidden Words}, journal = {Inf. Process. Lett.}, volume = {67}, number = {3}, pages = {111--117}, year = {1998}, url = {https://doi.org/10.1016/S0020-0190(98)00104-5}, doi = {10.1016/S0020-0190(98)00104-5}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreMR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CrochmoreGHMR98, author = {Maxime Crochemore and Leszek Gasieniec and Ramesh Hariharan and S. Muthukrishnan and Wojciech Rytter}, title = {A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching}, journal = {{SIAM} J. Comput.}, volume = {27}, number = {3}, pages = {668--681}, year = {1998}, url = {https://doi.org/10.1137/S0097539795280068}, doi = {10.1137/S0097539795280068}, timestamp = {Mon, 10 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/CrochmoreGHMR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/CrochemoreMR98, author = {Maxime Crochemore and Filippo Mignosi and Antonio Restivo}, editor = {Lubos Brim and Jozef Gruska and Jir{\'{\i}} Zlatuska}, title = {Minimal Forbidden Words and Factor Automata}, booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1450}, pages = {665--673}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/BFb0055817}, doi = {10.1007/BFB0055817}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/CrochemoreMR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreL97, author = {Maxime Crochemore and Thierry Lecroq}, title = {Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm}, journal = {Inf. Process. Lett.}, volume = {63}, number = {4}, pages = {195--203}, year = {1997}, url = {https://doi.org/10.1016/S0020-0190(97)00107-5}, doi = {10.1016/S0020-0190(97)00107-5}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreL97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CrochemoreGGPR97, author = {Maxime Crochemore and Zvi Galil and Leszek Gasieniec and Kunsoo Park and Wojciech Rytter}, title = {Constant-Time Randomized Parallel String Matching}, journal = {{SIAM} J. Comput.}, volume = {26}, number = {4}, pages = {950--960}, year = {1997}, url = {https://doi.org/10.1137/S009753979528007X}, doi = {10.1137/S009753979528007X}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/CrochemoreGGPR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/CrochemoreV97, author = {Maxime Crochemore and Renaud V{\'{e}}rin}, editor = {Jan Mycielski and Grzegorz Rozenberg and Arto Salomaa}, title = {On Compact Directed Acyclic Word Graphs}, booktitle = {Structures in Logic and Computer Science, {A} Selection of Essays in Honor of Andrzej Ehrenfeucht}, series = {Lecture Notes in Computer Science}, volume = {1261}, pages = {192--211}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/3-540-63246-8\_12}, doi = {10.1007/3-540-63246-8\_12}, timestamp = {Sat, 30 May 2020 20:05:53 +0200}, biburl = {https://dblp.org/rec/conf/birthday/CrochemoreV97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/CrochemoreV97, author = {Maxime Crochemore and Renaud V{\'{e}}rin}, editor = {Alberto Apostolico and Jotun Hein}, title = {Direct Construction of Compact Directed Acyclic Word Graphs}, booktitle = {Combinatorial Pattern Matching, 8th Annual Symposium, {CPM} 97, Aarhus, Denmark, June 30 - July 2, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1264}, pages = {116--129}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/3-540-63220-4\_55}, doi = {10.1007/3-540-63220-4\_55}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/cpm/CrochemoreV97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sequences/CrochemoreGR97, author = {Maxime Crochemore and Leszek Gasieniec and Wojciech Rytter}, editor = {Bruno Carpentieri and Alfredo De Santis and Ugo Vaccaro and James A. Storer}, title = {Constant-space string-matching in sublinear average time}, booktitle = {Compression and Complexity of {SEQUENCES} 1997, Positano, Amalfitan Coast, Salerno, Italy, June 11-13, 1997, Proceedings}, pages = {230--239}, publisher = {{IEEE}}, year = {1997}, url = {https://doi.org/10.1109/SEQUEN.1997.666918}, doi = {10.1109/SEQUEN.1997.666918}, timestamp = {Wed, 16 Oct 2019 14:14:56 +0200}, biburl = {https://dblp.org/rec/conf/sequences/CrochemoreGR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/ox/p/Crochemore97, author = {Maxime Crochemore}, editor = {Alberto Apostolico and Zvi Galil}, title = {Off-line serial exact string searching}, booktitle = {Pattern Matching Algorithms}, pages = {1--53}, publisher = {Oxford University Press}, year = {1997}, timestamp = {Thu, 12 Jan 2017 08:03:38 +0100}, biburl = {https://dblp.org/rec/books/ox/p/Crochemore97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/hfl/CrochemoreH97, author = {Maxime Crochemore and Christophe Hancart}, editor = {Grzegorz Rozenberg and Arto Salomaa}, title = {Automata for Matching Patterns}, booktitle = {Handbook of Formal Languages, Volume 2. Linear Modeling: Background and Application}, pages = {399--462}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/978-3-662-07675-0\_9}, doi = {10.1007/978-3-662-07675-0\_9}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/hfl/CrochemoreH97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/crc/tucker97/CrochemoreL97, author = {Maxime Crochemore and Thierry Lecroq}, editor = {Allen B. Tucker}, title = {Pattern Matching and Text Compression Algorithms}, booktitle = {The Computer Science and Engineering Handbook}, pages = {161--202}, publisher = {{CRC} Press}, year = {1997}, timestamp = {Sun, 09 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/crc/tucker97/CrochemoreL97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/csur/CrochemoreL96, author = {Maxime Crochemore and Thierry Lecroq}, title = {Pattern-Matching and Text-Compression Algorithms}, journal = {{ACM} Comput. Surv.}, volume = {28}, number = {1}, pages = {39--41}, year = {1996}, url = {https://doi.org/10.1145/234313.234331}, doi = {10.1145/234313.234331}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/csur/CrochemoreL96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/El-MabroukC96, author = {Nadia El{-}Mabrouk and Maxime Crochemore}, editor = {Daniel S. Hirschberg and Eugene W. Myers}, title = {Boyer-Moore Strategy to Efficient Approximate String Matching}, booktitle = {Combinatorial Pattern Matching, 7th Annual Symposium, {CPM} 96, Laguna Beach, California, USA, June 10-12, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1075}, pages = {24--38}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-61258-0\_2}, doi = {10.1007/3-540-61258-0\_2}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/cpm/El-MabroukC96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/CrochemoreR95, author = {Maxime Crochemore and Wojciech Rytter}, title = {Squares, Cubes, and Time-Space Efficient String Searching}, journal = {Algorithmica}, volume = {13}, number = {5}, pages = {405--425}, year = {1995}, url = {https://doi.org/10.1007/BF01190846}, doi = {10.1007/BF01190846}, timestamp = {Sat, 09 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/CrochemoreR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/ApostolicoC95, author = {Alberto Apostolico and Maxime Crochemore}, title = {Fast Parallel Lyndon Factorization with Applications}, journal = {Math. Syst. Theory}, volume = {28}, number = {2}, pages = {89--108}, year = {1995}, url = {https://doi.org/10.1007/BF01191471}, doi = {10.1007/BF01191471}, timestamp = {Sun, 17 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/ApostolicoC95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/CrochemoreR95, author = {Maxime Crochemore and Wojciech Rytter}, editor = {Ricardo A. Baeza{-}Yates and Eric Goles Ch. and Patricio V. Poblete}, title = {On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching}, booktitle = {{LATIN} '95: Theoretical Informatics, Second Latin American Symposium, Valpara{\'{\i}}so, Chile, April 3-7, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {911}, pages = {220--229}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-59175-3\_91}, doi = {10.1007/3-540-59175-3\_91}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/latin/CrochemoreR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/CrochemoreGPR95, author = {Maxime Crochemore and Leszek Gasieniec and Wojciech Plandowski and Wojciech Rytter}, editor = {Ernst W. Mayr and Claude Puech}, title = {Two-Dimensional Pattern Matching in Linear Time and Small Space}, booktitle = {{STACS} 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {900}, pages = {181--192}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-59042-0\_72}, doi = {10.1007/3-540-59042-0\_72}, timestamp = {Sat, 07 Sep 2019 11:59:26 +0200}, biburl = {https://dblp.org/rec/conf/stacs/CrochemoreGPR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/ox/CrochemoreR94, author = {Maxime Crochemore and Wojciech Rytter}, title = {Text Algorithms}, publisher = {Oxford University Press}, year = {1994}, url = {http://www-igm.univ-mlv.fr/\%7Emac/REC/B1.html}, isbn = {0-19-508609-0}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/ox/CrochemoreR94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/CrochemoreCGJLPR94, author = {Maxime Crochemore and Artur Czumaj and Leszek Gasieniec and Stefan Jarominek and Thierry Lecroq and Wojciech Plandowski and Wojciech Rytter}, title = {Speeding Up Two String-Matching Algorithms}, journal = {Algorithmica}, volume = {12}, number = {4/5}, pages = {247--267}, year = {1994}, url = {https://doi.org/10.1007/BF01185427}, doi = {10.1007/BF01185427}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/CrochemoreCGJLPR94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreR94, author = {Maxime Crochemore and Wojciech Rytter}, title = {On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms}, journal = {Theor. Comput. Sci.}, volume = {132}, number = {2}, pages = {403--414}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(94)00012-3}, doi = {10.1016/0304-3975(94)00012-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreR94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/cpm/1994, editor = {Maxime Crochemore and Dan Gusfield}, title = {Combinatorial Pattern Matching, 5th Annual Symposium, {CPM} 94, Asilomar, California, USA, June 5-8, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {807}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-58094-8}, doi = {10.1007/3-540-58094-8}, isbn = {3-540-58094-8}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/1994.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreGR93, author = {Maxime Crochemore and Leszek Gasieniec and Wojciech Rytter}, title = {Two-Dimensional Pattern Matching by Sampling}, journal = {Inf. Process. Lett.}, volume = {46}, number = {4}, pages = {159--162}, year = {1993}, url = {https://doi.org/10.1016/0020-0190(93)90020-A}, doi = {10.1016/0020-0190(93)90020-A}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreGR93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/ColeCGGHMPR93, author = {Richard Cole and Maxime Crochemore and Zvi Galil and Leszek Gasieniec and Ramesh Hariharan and S. Muthukrishnan and Kunsoo Park and Wojciech Rytter}, title = {Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions}, booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993}, pages = {248--258}, publisher = {{IEEE} Computer Society}, year = {1993}, url = {https://doi.org/10.1109/SFCS.1993.366862}, doi = {10.1109/SFCS.1993.366862}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/ColeCGGHMPR93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/cpm/1993, editor = {Alberto Apostolico and Maxime Crochemore and Zvi Galil and Udi Manber}, title = {Combinatorial Pattern Matching, 4th Annual Symposium, {CPM} 93, Padova, Italy, June 2-4, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {684}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/BFb0029791}, doi = {10.1007/BFB0029791}, isbn = {3-540-56764-X}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/1993.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Crochemore92, author = {Maxime Crochemore}, title = {String-Matching on Ordered Alphabets}, journal = {Theor. Comput. Sci.}, volume = {92}, number = {1}, pages = {33--47}, year = {1992}, url = {https://doi.org/10.1016/0304-3975(92)90134-2}, doi = {10.1016/0304-3975(92)90134-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Crochemore92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/NeraudC92, author = {Jean N{\'{e}}raud and Maxime Crochemore}, title = {A String-Matching Interpretation of the Equation xmyn = zp}, journal = {Theor. Comput. Sci.}, volume = {92}, number = {1}, pages = {145--164}, year = {1992}, url = {https://doi.org/10.1016/0304-3975(92)90140-B}, doi = {10.1016/0304-3975(92)90140-B}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/NeraudC92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icpia/CrochemoreR92, author = {Maxime Crochemore and Wojciech Rytter}, editor = {Akira Nakamura and Maurice Nivat and Ahmed Saoudi and Patrick Shen{-}Pei Wang and Katsushi Inoue}, title = {Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms}, booktitle = {Parallel Image Analysis, Second International Conference, {ICPIA} '92, Ube, Japan, December 21-23, 1992, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {654}, pages = {100--112}, publisher = {Springer}, year = {1992}, url = {https://doi.org/10.1007/3-540-56346-6\_33}, doi = {10.1007/3-540-56346-6\_33}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/icpia/CrochemoreR92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/CrochemoreLCGJPR92, author = {Maxime Crochemore and Thierry Lecroq and Artur Czumaj and Leszek Gasieniec and Stefan Jarominek and Wojciech Plandowski and Wojciech Rytter}, editor = {Alain Finkel and Matthias Jantzen}, title = {Speeding Up Two String-Matching Algorithms}, booktitle = {{STACS} 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {577}, pages = {589--600}, publisher = {Springer}, year = {1992}, url = {https://doi.org/10.1007/3-540-55210-3\_215}, doi = {10.1007/3-540-55210-3\_215}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/CrochemoreLCGJPR92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/cpm/1992, editor = {Alberto Apostolico and Maxime Crochemore and Zvi Galil and Udi Manber}, title = {Combinatorial Pattern Matching, Third Annual Symposium, {CPM} 92, Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {644}, publisher = {Springer}, year = {1992}, url = {https://doi.org/10.1007/3-540-56024-6}, doi = {10.1007/3-540-56024-6}, isbn = {3-540-56024-6}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/1992.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/ApostolicoC91, author = {Alberto Apostolico and Maxime Crochemore}, title = {Optimal Canonization of All Substrings of a String}, journal = {Inf. Comput.}, volume = {95}, number = {1}, pages = {76--95}, year = {1991}, url = {https://doi.org/10.1016/0890-5401(91)90016-U}, doi = {10.1016/0890-5401(91)90016-U}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/ApostolicoC91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijac/CrochemoreG91, author = {Maxime Crochemore and Pavel Goralcik}, title = {Mutually Avoiding Ternary Words of Small Exponent}, journal = {Int. J. Algebra Comput.}, volume = {1}, number = {4}, pages = {407--410}, year = {1991}, url = {https://doi.org/10.1142/S0218196791000286}, doi = {10.1142/S0218196791000286}, timestamp = {Tue, 25 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijac/CrochemoreG91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreR91, author = {Maxime Crochemore and Wojciech Rytter}, title = {Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings}, journal = {Inf. Process. Lett.}, volume = {38}, number = {2}, pages = {57--60}, year = {1991}, url = {https://doi.org/10.1016/0020-0190(91)90223-5}, doi = {10.1016/0020-0190(91)90223-5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreR91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/CrochemoreP91, author = {Maxime Crochemore and Dominique Perrin}, title = {Two-Way String Matching}, journal = {J. {ACM}}, volume = {38}, number = {3}, pages = {651--675}, year = {1991}, url = {https://doi.org/10.1145/116825.116845}, doi = {10.1145/116825.116845}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/CrochemoreP91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChytilCMR91, author = {Michal Chytil and Maxime Crochemore and Burkhard Monien and Wojciech Rytter}, title = {On the Parallel Recognition of Unambiguous Context-Free Languages}, journal = {Theor. Comput. Sci.}, volume = {81}, number = {2}, pages = {311--316}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90199-C}, doi = {10.1016/0304-3975(91)90199-C}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChytilCMR91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrochemoreR91, author = {Maxime Crochemore and Wojciech Rytter}, title = {Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays}, journal = {Theor. Comput. Sci.}, volume = {88}, number = {1}, pages = {59--82}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90073-B}, doi = {10.1016/0304-3975(91)90073-B}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrochemoreR91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreR90, author = {Maxime Crochemore and Wojciech Rytter}, title = {Parallel Construction of Minimal Suffix and Factor Automata}, journal = {Inf. Process. Lett.}, volume = {35}, number = {3}, pages = {121--128}, year = {1990}, url = {https://doi.org/10.1016/0020-0190(90)90060-B}, doi = {10.1016/0020-0190(90)90060-B}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreR90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/CrochemoreN90, author = {Maxime Crochemore and Jean N{\'{e}}raud}, editor = {Andr{\'{e}} Arnold}, title = {Unitary Monoid with Two Generators: An Algorithmic Point of View}, booktitle = {{CAAP} '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {431}, pages = {117--131}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/3-540-52590-4\_44}, doi = {10.1007/3-540-52590-4\_44}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/caap/CrochemoreN90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/CrochemoreR90, author = {Maxime Crochemore and Wojciech Rytter}, editor = {Branislav Rovan}, title = {Parallel Construction of Minimal Suffix and Factor Automata}, booktitle = {Mathematical Foundations of Computer Science 1990, MFCS'90, Bansk{\'{a}} Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {452}, pages = {217--223}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/BFb0029611}, doi = {10.1007/BFB0029611}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/CrochemoreR90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/CrochemoreR90, author = {Maxime Crochemore and Wojciech Rytter}, editor = {Christian Choffrut and Thomas Lengauer}, title = {Parallel Computations on Strings and Arrays}, booktitle = {{STACS} 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {415}, pages = {109--125}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/3-540-52282-4\_36}, doi = {10.1007/3-540-52282-4\_36}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/CrochemoreR90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BerstelCP89, author = {Jean Berstel and Maxime Crochemore and Jean{-}Eric Pin}, title = {Thue-Morse sequence and p-adic topology for the free monoid}, journal = {Discret. Math.}, volume = {76}, number = {2}, pages = {89--94}, year = {1989}, url = {https://doi.org/10.1016/0012-365X(89)90302-6}, doi = {10.1016/0012-365X(89)90302-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BerstelCP89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/Crochemore89, author = {Maxime Crochemore}, title = {String-matching and periods}, journal = {Bull. {EATCS}}, volume = {39}, pages = {149--153}, year = {1989}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/Crochemore89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/CrochemoreP88, author = {Maxime Crochemore and Dominique Perrin}, title = {Critical factorizations of words}, journal = {Bull. {EATCS}}, volume = {34}, pages = {47--51}, year = {1988}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/CrochemoreP88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/Crochemore88, author = {Maxime Crochemore}, editor = {Kesav V. Nori and Sanjeev Kumar}, title = {Constant-Space String-Matching}, booktitle = {Foundations of Software Technology and Theoretical Computer Science, Eighth Conference, Pune, India, December 21-23, 1988, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {338}, pages = {80--87}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/3-540-50517-2\_72}, doi = {10.1007/3-540-50517-2\_72}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/Crochemore88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Crochemore88, author = {Maxime Crochemore}, editor = {Jean{-}Eric Pin}, title = {Algorithms and automata}, booktitle = {Formal Properties of Finite Automata and Applications, {LITP} Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {386}, pages = {166--175}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/BFb0013119}, doi = {10.1007/BFB0013119}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/litp/Crochemore88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Crochemore88, author = {Maxime Crochemore}, editor = {Michal Chytil and Ladislav Janiga and V{\'{a}}clav Koubek}, title = {String Matching with Constraints}, booktitle = {Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {324}, pages = {44--58}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/BFb0017130}, doi = {10.1007/BFB0017130}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Crochemore88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Crochemore87, author = {Maxime Crochemore}, editor = {Maurice Gross and Dominique Perrin}, title = {Data Compression with Substitution}, booktitle = {Electronic Dictionaries and Automata in Computational Linguistics, {LITP} Spring School on Theoretical Computer Science, Saint-Pierre d'Ol{\'{e}}ron, France, May 25-29, 1987, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {377}, pages = {1--16}, publisher = {Springer}, year = {1987}, url = {https://doi.org/10.1007/3-540-51465-1\_1}, doi = {10.1007/3-540-51465-1\_1}, timestamp = {Fri, 17 Jul 2020 16:12:48 +0200}, biburl = {https://dblp.org/rec/conf/litp/Crochemore87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Crochemore87, author = {Maxime Crochemore}, editor = {Hartmut Ehrig and Robert A. Kowalski and Giorgio Levi and Ugo Montanari}, title = {Longest Common Factor of Two Words}, booktitle = {TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23-27, 1987, Volume 1: Advanced Seminar on Foundations of Innovative Software Development {I} and Colloquium on Trees in Algebra and Programming (CAAP'87)}, series = {Lecture Notes in Computer Science}, volume = {249}, pages = {26--36}, publisher = {Springer}, year = {1987}, url = {https://doi.org/10.1007/3-540-17660-8\_45}, doi = {10.1007/3-540-17660-8\_45}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Crochemore87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/Crochemore86, author = {Maxime Crochemore}, title = {Computing {LCF} in linear time}, journal = {Bull. {EATCS}}, volume = {30}, pages = {57--60}, year = {1986}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/Crochemore86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/HebrardC86, author = {Jean{-}Jacques H{\'{e}}brard and Maxime Crochemore}, title = {Calcul de La Distance Par Les Sous-Mots}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {20}, number = {4}, pages = {441--456}, year = {1986}, url = {https://doi.org/10.1051/ita/1986200404411}, doi = {10.1051/ITA/1986200404411}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/HebrardC86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Crochemore86, author = {Maxime Crochemore}, title = {Transducers and Repetitions}, journal = {Theor. Comput. Sci.}, volume = {45}, number = {1}, pages = {63--86}, year = {1986}, url = {https://doi.org/10.1016/0304-3975(86)90041-1}, doi = {10.1016/0304-3975(86)90041-1}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Crochemore86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Crochemore84, author = {Maxime Crochemore}, editor = {Jan Paredaens}, title = {Linear Searching for a Squre in a Word (Abstract)}, booktitle = {Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 16-20, 1984, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {172}, pages = {137}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-13345-3\_12}, doi = {10.1007/3-540-13345-3\_12}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Crochemore84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreRW83, author = {Maxime Crochemore and Michael Le Rest and Philippe Wender}, title = {An Optimal Test on Finite Unavoidable Sets of Words}, journal = {Inf. Process. Lett.}, volume = {16}, number = {4}, pages = {179--180}, year = {1983}, url = {https://doi.org/10.1016/0020-0190(83)90119-9}, doi = {10.1016/0020-0190(83)90119-9}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreRW83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Crochemore82, author = {Maxime Crochemore}, title = {Sharp Characterizations of Squarefree Morphisms}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {221--226}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90023-8}, doi = {10.1016/0304-3975(82)90023-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Crochemore82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CardonC82, author = {A. Cardon and Maxime Crochemore}, title = {Partitioning a Graph in O({\(\vert\)}A{\(\vert\)} log2 {\(\vert\)}V{\(\vert\)})}, journal = {Theor. Comput. Sci.}, volume = {19}, pages = {85--98}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90016-0}, doi = {10.1016/0304-3975(82)90016-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CardonC82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Crochemore81, author = {Maxime Crochemore}, title = {An Optimal Algorithm for Computing the Repetitions in a Word}, journal = {Inf. Process. Lett.}, volume = {12}, number = {5}, pages = {244--250}, year = {1981}, url = {https://doi.org/10.1016/0020-0190(81)90024-7}, doi = {10.1016/0020-0190(81)90024-7}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Crochemore81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/CardonC80, author = {A. Cardon and Maxime Crochemore}, title = {D{\'{e}}termination de la Repr{\'{e}}sentation Standard d'une S{\'{e}}rie Reconnaissable}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {4}, pages = {371--379}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140403711}, doi = {10.1051/ITA/1980140403711}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/CardonC80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.