Paolo Ferragina
Paolo Ferragina
Professor of Algorithms, Dept. Computer Science, University of Pisa
Verified email at - Homepage
TitleCited byYear
Indexing compressed text
P Ferragina, G Manzini
Journal of the ACM (JACM) 52 (4), 552-581, 2005
Opportunistic data structures with applications
P Ferragina, G Manzini
Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on …, 2000
Trust-aware collaborative filtering for recommender systems
P Massa, P Avesani
OTM Confederated International Conferences" On the Move to Meaningful …, 2004
Tagme: on-the-fly annotation of short text fragments (by wikipedia entities)
P Ferragina, U Scaiella
Proceedings of the 19th ACM international conference on Information and …, 2010
The string B-tree: a new data structure for string search in external memory and its applications
P Ferragina, R Grossi
Journal of the ACM (JACM) 46 (2), 236-280, 1999
A personalized search engine based on Web‐snippet hierarchical clustering
P Ferragina, A Gulli
Software: Practice and Experience 38 (2), 189-225, 2008
Optical recognition of motor vehicle license plates
P Comelli, P Ferragina, MN Granieri, F Stabile
IEEE transactions on Vehicular Technology 44 (4), 790-799, 1995
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, 2007
On the sorting-complexity of suffix tree construction
M Farach-Colton, P Ferragina, S Muthukrishnan
Journal of the ACM (JACM) 47 (6), 987-1011, 2000
An experimental study of an opportunistic index
P Ferragina, G Manzini
Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001
Fast and accurate annotation of short texts with wikipedia pages
P Ferragina, U Scaiella
IEEE software 29 (1), 70-75, 2012
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
Engineering a lightweight suffix array construction algorithm
G Manzini, P Ferragina
Algorithmica 40 (1), 33-50, 2004
Engineering a lightweight suffix array construction algorithm
G Manzini, P Ferragina
Algorithmica 40 (1), 33-50, 2004
A framework for benchmarking entity-annotation systems
M Cornolti, P Ferragina, M Ciaramita
Proceedings of the 22nd international conference on World Wide Web, 249-260, 2013
-gram based database searching using a suffix array (QUASAR)
S Burkhardt, A Crauser, P Ferragina, HP Lenhof, E Rivals, M Vingron
Max-Planck-Institut für Informatik, 1998
GERBIL: general entity annotator benchmarking framework
R Usbeck, M Röder, AC Ngonga Ngomo, C Baron, A Both, M Brümmer, ...
Proceedings of the 24th international conference on World Wide Web, 1133-1143, 2015
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
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
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), 252, 2007
The system can't perform the operation now. Try again later.
Articles 1–20