| Opportunistic data structures with applications P Ferragina, G Manzini Proceedings 41st annual symposium on foundations of computer science, 390-398, 2000 | 1602 | 2000 |
| Indexing compressed text P Ferragina, G Manzini Journal of the ACM (JACM) 52 (4), 552-581, 2005 | 852 | 2005 |
| An analysis of the Burrows—Wheeler transform G Manzini Journal of the ACM (JACM) 48 (3), 407-430, 2001 | 438 | 2001 |
| Compressed representations of sequences and full-text indexes P Ferragina, G Manzini, V Mäkinen, G Navarro ACM Transactions on Algorithms (TALG) 3 (2), 20-es, 2007 | 423 | 2007 |
| Engineering a lightweight suffix array construction algorithm G Manzini, P Ferragina Algorithms—ESA 2002, 135-142, 2002 | 262 | 2002 |
| An experimental study of an opportunistic index. P Ferragina, G Manzini SODA 1, 269-278, 2001 | 252 | 2001 |
| Compressing and indexing labeled trees, with applications P Ferragina, F Luccio, G Manzini, S Muthukrishnan Journal of the ACM (JACM) 57 (1), 1-33, 2009 | 181 | 2009 |
| An alphabet-friendly FM-index P Ferragina, G Manzini, V Mäkinen, G Navarro International Symposium on String Processing and Information Retrieval, 150-160, 2004 | 160 | 2004 |
| Structuring labeled trees for optimal succinctness, and beyond P Ferragina, F Luccio, G Manzini, S Muthukrishnan 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 184-193, 2005 | 154 | 2005 |
| Permuted longest-common-prefix array J Kärkkäinen, G Manzini, SJ Puglisi Combinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille …, 2009 | 148 | 2009 |
| Compression-based classification of biological sequences and structures via the universal similarity metric: experimental assessment P Ferragina, R Giancarlo, V Greco, G Manzini, G Valiente BMC bioinformatics 8, 1-20, 2007 | 144 | 2007 |
| Compression of low entropy strings with Lempel--Ziv algorithms SR Kosaraju, G Manzini SIAM Journal on Computing 29 (3), 893-911, 2000 | 136 | 2000 |
| Boosting textual compression in optimal linear time P Ferragina, R Giancarlo, G Manzini, M Sciortino Journal of the ACM (JACM) 52 (4), 688-713, 2005 | 134 | 2005 |
| Two space saving tricks for linear time LCP array computation G Manzini Scandinavian Workshop on Algorithm Theory, 372-383, 2004 | 121 | 2004 |
| Perturbation: An efficient technique for the solution of very large instances of the Euclidean TSP B Codenotti, G Manzini, L Margara, G Resta INFORMS Journal on Computing 8 (2), 125-133, 1996 | 117 | 1996 |
| Wheeler graphs: A framework for BWT-based data structures T Gagie, G Manzini, J Sirén Theoretical computer science 698, 67-78, 2017 | 107 | 2017 |
| Lightweight data indexing and compression in external memory P Ferragina, T Gagie, G Manzini Algorithmica 63 (3), 707-730, 2012 | 106 | 2012 |
| On computing the entropy of cellular automata M D'amico, G Manzini, L Margara Theoretical Computer Science 290 (3), 1629-1646, 2003 | 104 | 2003 |
| BIDA∗: an improved perimeter search algorithm G Manzini Artificial Intelligence 75 (2), 347-360, 1995 | 101 | 1995 |
| Compressing and searching XML data via two zips P Ferragina, F Luccio, G Manzini, S Muthukrishnan Proceedings of the 15th international conference on World Wide Web, 751-760, 2006 | 94 | 2006 |
Paolo FerraginaProfessor of Algorithms, Dept. Computer Science, University of Pisa在 unipi.it 的电子邮件经过验证
