| Order-preserving incomplete suffix trees and order-preserving indexes M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... String Processing and Information Retrieval: 20th International Symposium …, 2013 | 55 | 2013 |
| Order-preserving indexing M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... Theoretical Computer Science 638, 122-135, 2016 | 43 | 2016 |
| On parsing optimality for dictionary-based text compression—the Zip case A Langiu Journal of Discrete Algorithms 20, 65-70, 2013 | 26 | 2013 |
| Abelian powers and repetitions in Sturmian words G Fici, A Langiu, T Lecroq, A Lefebvre, F Mignosi, J Peltomäki, ... Theoretical Computer Science 635, 16-34, 2016 | 19 | 2016 |
| Note on the greedy parsing optimality for dictionary-based text compression M Crochemore, A Langiu, F Mignosi Theoretical Computer Science 525, 55-59, 2014 | 19 | 2014 |
| An Agent-based System for Maritime Search and Rescue Operations. S Aronica, F Benvegna, M Cossentino, S Gaglio, A Langiu, C Lodato, ... WOA 45, 46, 2010 | 17 | 2010 |
| Dictionary-symbolwise flexible parsing M Crochemore, L Giambruno, A Langiu, F Mignosi, A Restivo Journal of Discrete Algorithms 14, 74-90, 2012 | 15 | 2012 |
| Order-preserving suffix trees and their algorithmic applications M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... arXiv preprint arXiv:1303.6872, 2013 | 13 | 2013 |
| The rightmost equal-cost position problem M Crochemore, A Langiu, F Mignosi 2013 Data Compression Conference, 421-430, 2013 | 13 | 2013 |
| Abelian repetitions in Sturmian words G Fici, A Langiu, T Lecroq, A Lefebvre, F Mignosi, É Prieur-Gaston International Conference on Developments in Language Theory, 227-238, 2013 | 11 | 2013 |
| The longest common substring problem M Crochemore, CS Iliopoulos, A Langiu, F Mignosi Mathematical Structures in Computer Science 27 (2), 277-295, 2017 | 9 | 2017 |
| Algorithms for longest common abelian factors A Alatabbi, CS Iliopoulos, A Langiu, MS Rahman International Journal of Foundations of Computer Science 27 (05), 529-543, 2016 | 9 | 2016 |
| A note on the longest common compatible prefix problem for partial words M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... Journal of Discrete Algorithms 34, 49-53, 2015 | 9 | 2015 |
| Combinatorial optimisation in radiotherapy treatment planning E Altobelli, M Amichetti, A Langiu, F Marzi, F Mignosi, P Pisciotta, ... AIMS Medical Science 5 (3), 204-223, 2018 | 6 | 2018 |
| Bacteria classification using minimal absent words G Fici, A Langiu, GL Bosco, R Rizzo AIMS Medical Science 5 (1), 23-32, 2018 | 4 | 2018 |
| On-line construction of a small automaton for a finite set of words M Crochemore, L Giambruno, A Langiu International Journal of Foundations of Computer Science 23 (02), 281-301, 2012 | 3 | 2012 |
| Indexing a sequence for mapping reads with a single mismatch M Crochemore, A Langiu, MS Rahman Philosophical Transactions of the Royal Society A: Mathematical, Physical …, 2014 | 2 | 2014 |
| Optimal Parsing for dictionary text compression A Langiu Université Paris-Est, 2012 | 2 | 2012 |
| On dictionary-symbolwise data compression G Della Penna, F Mignosi, A Langiu, A Ulisse | 2 | 2006 |
| Optimal parsing in dictionary-symbolwise compression algorithms A Langiu, A Restivo Master’s thesis, University of Palermo, 2008. http://math. unipa. it …, 0 | 2 | |
Maxime CrochemoreKCL在 kcl.ac.uk 的电子邮件经过验证
