Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Paolo Ferragina
2010 – today
- 2013
[j43]- [c55]Marco Cornolti, Paolo Ferragina, Massimiliano Ciaramita: A framework for benchmarking entity-annotation systems. WWW 2013: 249-260
- [e4]Stefano Leonardi, Alessandro Panconesi, Paolo Ferragina, Aristides Gionis (Eds.): Sixth ACM International Conference on Web Search and Data Mining, WSDM 2013, Rome, Italy, February 4-8, 2013. ACM 2013, ISBN 978-1-4503-1869-3
- 2012
- [j42]Paolo Ferragina, Travis Gagie, Giovanni Manzini: Lightweight Data Indexing and Compression in External Memory. Algorithmica 63(3): 707-730 (2012)
- [j41]Paolo Ferragina, Ugo Scaiella: Fast and Accurate Annotation of Short Texts with Wikipedia Pages. IEEE Software 29(1): 70-75 (2012)
- [c54]Daniele Vitale, Paolo Ferragina, Ugo Scaiella: Classification of Short Texts by Deploying Topical Annotations. ECIR 2012: 376-387
- [c53]Ugo Scaiella, Paolo Ferragina, Andrea Marino, Massimiliano Ciaramita: Topical clustering of search results. WSDM 2012: 223-232
- [e3]Leah Epstein, Paolo Ferragina (Eds.): Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Lecture Notes in Computer Science 7501, Springer 2012, ISBN 978-3-642-33089-6
- 2011
- [j40]Paolo Ferragina, Igor Nitto, Rossano Venturini: On Optimally Partitioning a Text to Improve Its Compression. Algorithmica 61(1): 51-74 (2011)
- [c52]
- [c51]Paolo Ferragina, Jouni Sirén, Rossano Venturini: Distribution-Aware Compressed Full-Text Indexes. ESA 2011: 760-771
- [c50]Paolo Ferragina, Ugo Scaiella: First Steps Beyond the Bag-Of-Words Representation of Short Texts. IIR 2011
- [c49]Paolo Ferragina: Beyond the bag-of-words paradigm to enhance information retrieval applications. SISAP 2011: 3-4
- 2010
- [j39]Paolo Ferragina, Rossano Venturini: The compressed permuterm index. ACM Transactions on Algorithms 7(1): 10 (2010)
- [j38]Paolo Ferragina, Igor Nitto, Rossano Venturini: On compact representations of All-Pairs-Shortest-Path-Distance matrices. Theor. Comput. Sci. 411(34-36): 3293-3300 (2010)
- [c48]Paolo Ferragina, Ugo Scaiella: TAGME: on-the-fly annotation of short text fragments (by wikipedia entities). CIKM 2010: 1625-1628
- [c47]
- [c46]Antonio Cisternino, Paolo Ferragina, Davide Morelli, Massimo Coppola: Information processing at work: On energy-aware algorithm design. Green Computing Conference 2010: 407-415
- [c45]Paolo Ferragina, Travis Gagie, Giovanni Manzini: Lightweight Data Indexing and Compression in External Memory. LATIN 2010: 697-710
- [c44]
- [i6]Paolo Ferragina, Ugo Scaiella: TAGME: on-the-fly annotation of short text fragments (by Wikipedia entities). CoRR abs/1006.3498 (2010)
2000 – 2009
- 2009
- [j37]Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini: The myriad virtues of Wavelet Trees. Inf. Comput. 207(8): 849-866 (2009)
- [j36]Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan: Compressing and indexing labeled trees, with applications. J. ACM 57(1) (2009)
- [j35]
- [c43]Paolo Ferragina, Igor Nitto, Rossano Venturini: On Optimally Partitioning a Text to Improve Its Compression. ESA 2009: 420-431
- [c42]Paolo Ferragina, Igor Nitto, Rossano Venturini: On the bit-complexity of Lempel-Ziv compression. SODA 2009: 768-777
- [r7]Paolo Ferragina, Rossano Venturini: Indexing Compressed Text. Encyclopedia of Database Systems 2009: 1442-1448
- [r6]
- [i5]Paolo Ferragina, Igor Nitto, Rossano Venturini: On optimally partitioning a text to improve its compression. CoRR abs/0906.4692 (2009)
- [i4]Paolo Ferragina, Travis Gagie, Giovanni Manzini: Lightweight Data Indexing and Compression in External Memory. CoRR abs/0909.4341 (2009)
- 2008
- [j34]
- [j33]Paolo Ferragina, Rodrigo González, Gonzalo Navarro, Rossano Venturini: Compressed text indexes: From theory to practice. ACM Journal of Experimental Algorithmics 13 (2008)
- [j32]Paolo Ferragina, Antonio Gulli: A personalized search engine based on Web-snippet hierarchical clustering. Softw., Pract. Exper. 38(2): 189-225 (2008)
- [c41]Carlos Castillo, Claudio Corsi, Debora Donato, Paolo Ferragina, Aristides Gionis: Query-log mining for detecting spam. AIRWeb 2008: 17-20
- [c40]Paolo Ferragina, Roberto Grossi, Ankur Gupta, Rahul Shah, Jeffrey Scott Vitter: On searching compressed string collections cache-obliviously. PODS 2008: 181-190
- [e2]Paolo Ferragina, Gad M. Landau (Eds.): Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings. Lecture Notes in Computer Science 5029, Springer 2008, ISBN 978-3-540-69066-5
- [r5]
- [r4]
- [r3]
- [r2]
- [r1]Joong Chae Na, Paolo Ferragina, Raffaele Giancarlo, Kunsoo Park: Two-Dimensional Pattern Indexing. Encyclopedia of Algorithms 2008
- [i3]
- [i2]Paolo Ferragina, Igor Nitto, Rossano Venturini: Bit-Optimal Lempel-Ziv compression. CoRR abs/0802.0835 (2008)
- 2007
- [j31]Claudio Corsi, Paolo Ferragina, Roberto Marangoni: The BioPrompt-box: an ontology-based clustering tool for searching in biological databases. BMC Bioinformatics 8(S-1) (2007)
- [j30]Paolo Ferragina, Raffaele Giancarlo, Valentina Greco, Giovanni Manzini, Gabriel Valiente: Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment. BMC Bioinformatics 8 (2007)
- [j29]Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan: A data structure for a sequence of string accesses in external memory. ACM Transactions on Algorithms 3(1) (2007)
- [j28]Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro: Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms 3(2) (2007)
- [j27]Paolo Ferragina, Rossano Venturini: A simple storage scheme for strings achieving entropy bounds. Theor. Comput. Sci. 372(1): 115-121 (2007)
- [j26]Paolo Ferragina, Giovanni Manzini, S. Muthukrishnan: Foreword. Theor. Comput. Sci. 387(3): 197-199 (2007)
- [c39]
- [c38]
- [c37]Paolo Ferragina, Rossano Venturini: A simple storage scheme for strings achieving entropy bounds. SODA 2007: 690-696
- [i1]Paolo Ferragina, Rodrigo González, Gonzalo Navarro, Rossano Venturini: Compressed Text Indexes:From Theory to Practice! CoRR abs/0712.3360 (2007)
- 2006
- [j25]
- [c36]Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini: The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression. ESA 2006: 756-767
- [c35]Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini: The Myriad Virtues of Wavelet Trees. ICALP (1) 2006: 560-571
- [c34]Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan: Compressing and searching XML data via two zips. WWW 2006: 751-760
- [e1]Fabio Crestani, Paolo Ferragina, Mark Sanderson (Eds.): String Processing and Information Retrieval, 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings. Lecture Notes in Computer Science 4209, Springer 2006, ISBN 3-540-45774-7
- 2005
- [j24]
- [j23]Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini, Marinella Sciortino: Boosting textual compression in optimal linear time. J. ACM 52(4): 688-713 (2005)
- [c33]Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro: Cache-Oblivious Comparison-Based Algorithms on Multisets. ESA 2005: 305-316
- [c32]Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan: Structuring labeled trees for optimal succinctness, and beyond. FOCS 2005: 184-196
- [c31]Paolo Ferragina, Antonio Gulli: A personalized search engine based on web-snippet hierarchical clustering. WWW (Special interest tracks and posters) 2005: 801-810
- 2004
- [j22]Giovanni Manzini, Paolo Ferragina: Engineering a Lightweight Suffix Array Construction Algorithm. Algorithmica 40(1): 33-50 (2004)
- [c30]Paolo Ferragina, Antonio Gulli: The Anatomy of a Hierarchical Clustering Engine for Web-page, News and Book Snippets. ICDM 2004: 395-398
- [c29]Paolo Ferragina, Antonio Gulli: The Anatomy of SnakeT: A Hierarchical Clustering Engine for Web-Page Snippets. PKDD 2004: 506-508
- [c28]Paolo Ferragina, Antonio Gulli: Experimenting SnakeT: A Hierarchical Clustering Engine for Web-Page Snippets. PKDD 2004: 543-545
- [c27]Paolo Ferragina, Giovanni Manzini: Compression boosting in optimal linear time using the Burrows-Wheeler Transform. SODA 2004: 655-663
- [c26]Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro: An Alphabet-Friendly FM-Index. SPIRE 2004: 150-160
- 2003
- [j21]Nadia Pisanti, Roberto Marangoni, Paolo Ferragina, Antonio Frangioni, A. Savona, C. Pisanelli, Fabrizio Luccio: PaTre: A Method for Paralogy Trees Construction. Journal of Computational Biology 10(5): 791-802 (2003)
- [j20]Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava: Two-dimensional substring indexing. J. Comput. Syst. Sci. 66(4): 763-774 (2003)
- 2002
- [j19]Andreas Crauser, Paolo Ferragina: A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory. Algorithmica 32(1): 1-35 (2002)
- [c25]Giovanni Manzini, Paolo Ferragina: Engineering a Lightweight Suffix Array Construction Algorithm. ESA 2002: 698-710
- [c24]Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan: Static Optimality Theorem for External Memory String Access. FOCS 2002: 219-227
- 2001
- [j18]Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos: Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. Int. J. Comput. Geometry Appl. 11(3): 305-337 (2001)
- [j17]Paolo Ferragina, Giovanni Manzini: An experimental study of a compressed index. Inf. Sci. 135(1-2): 13-28 (2001)
- [c23]Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava: Two-dimensional Substring Indexing. PODS 2001
- [c22]Paolo Ferragina, Giovanni Manzini: An experimental study of an opportunistic index. SODA 2001: 269-278
- 2000
- [j16]Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan: On the sorting-complexity of suffix tree construction. J. ACM 47(6): 987-1011 (2000)
- [j15]Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer: An Experimental Study of Priority Queues in External Memory. ACM Journal of Experimental Algorithmics 5: 17 (2000)
- [c21]Paolo Ferragina, Giovanni Manzini: Opportunistic Data Structures with Applications. FOCS 2000: 390-398
1990 – 1999
- 1999
- [j14]Paolo Ferragina, Fabrizio Luccio: String Search in Coarse-Grained Parallel Computers. Algorithmica 24(3-4): 177-194 (1999)
- [j13]Paolo Ferragina, Roberto Grossi: The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. J. ACM 46(2): 236-280 (1999)
- [j12]Paolo Ferragina, Roberto Grossi: Improved Dynamic Text Indexing. J. Algorithms 31(2): 291-319 (1999)
- [j11]Sajal K. Das, Paolo Ferragina: An EREW PRAM Algorithm for Updating Minimum Spanning Trees. Parallel Processing Letters 9(1): 111-122 (1999)
- [c20]Andreas Crauser, Paolo Ferragina: On Constructing Suffix Arrays in External Memory. ESA 1999: 224-235
- [c19]Stefan Burkhardt, Andreas Crauser, Paolo Ferragina, Hans-Peter Lenhof, Eric Rivals, Martin Vingron: q-gram based database searching using a suffix array (QUASAR). RECOMB 1999: 77-83
- [c18]Paolo Ferragina, S. Muthukrishnan, Mark de Berg: Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. STOC 1999: 483-491
- [c17]Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer: An Experimental Study of Priority Queues in External Memory. Algorithm Engineering 1999: 346-360
- 1998
- [j10]Paolo Ferragina, Fabrizio Luccio: Dynamic Dictionary Matching in External Memory. Inf. Comput. 146(2): 85-99 (1998)
- [j9]Paolo Ferragina, Roberto Grossi: Optimal On-Line Search and Sublinear Time Update in String Matching. SIAM J. Comput. 27(3): 713-736 (1998)
- [j8]Paolo Ferragina, Roberto Grossi, Manuela Montangero: On Updating Suffix Tree Labels. Theor. Comput. Sci. 201(1-2): 249-262 (1998)
- [c16]Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos: Randomized External-Memory Algorithms for Some Geometric Problems. Symposium on Computational Geometry 1998: 259-268
- [c15]Martin Farach, Paolo Ferragina, S. Muthukrishnan: Overcoming the Memory Bottleneck in Suffix Tree Construction. FOCS 1998: 174-185
- 1997
- [j7]
- [c14]Paolo Ferragina, Roberto Grossi, Manuela Montangero: A Note on Updating Suffix Tree Labels. CIAC 1997: 181-192
- [c13]Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter: On Sorting Strings in External Memory (Extended Abstract). STOC 1997: 540-548
- 1996
- [j6]Paolo Ferragina, Fabrizio Luccio: Three Techniques for Parallel Maintenance of a Minimum Spanning Tree under Batch of Updates. Parallel Processing Letters 6(2): 213-222 (1996)
- [c12]Paolo Ferragina, S. Muthukrishnan: Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract). ESA 1996: 107-120
- [c11]Paolo Ferragina, Fabrizio Luccio: On the Parallel Dynamic Dictionary Matching Problem: New Results with Applications. ESA 1996: 261-275
- [c10]
- [c9]Paolo Ferragina, Roberto Grossi: Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results. SODA 1996: 373-382
- 1995
- [j5]Paolo Ferragina: A Technique to Speed Up Parallel Fully Dynamic Algorithms for MST. J. Parallel Distrib. Comput. 31(2): 181-189 (1995)
- [j4]Cesare Calabró, Paolo Ferragina, Mario Notturno Granieri: Recognition of hand-written rotated digits by neural networks. Mach. Vis. Appl. 8(5): 351-357 (1995)
- [c8]Paolo Ferragina, Roberto Grossi: Optimal On-Line Search and Sublinear Time Update in String Matching. FOCS 1995: 604-612
- [c7]
- [c6]
- [c5]Paolo Ferragina, Roberto Grossi: A fully-dynamic data structure for external substring search (Extended Abstract). STOC 1995: 693-702
- 1994
- [j3]Paolo Ferragina: Static and Dynamic Parallel Computation of Connected Components. Inf. Process. Lett. 50(2): 63-68 (1994)
- [c4]Sajal K. Das, Paolo Ferragina: An o(n) Work EREW Parallel Algorithm for Updating MST. ESA 1994: 331-342
- [c3]
- [c2]Paolo Ferragina, Fabrizio Luccio: Batch Dynamic Algorithms for Two Graph Problems. PARLE 1994: 713-724
- [c1]Paolo Ferragina, Angelo Monti, Alessandro Roncato: Trade-off Between Computational Power and Common Knowledge in Anonymous Rings. SIROCCO 1994: 35-48
- 1993
- [j2]Silvano Di Zenzo, Neil Burgess, Paolo Ferragina, Mario Notturno Granieri: Recognition by constructive neural algorithms. Pattern Recognition Letters 14(12): 997-1007 (1993)
- 1992
- [j1]Neil Burgess, Silvano Di Zenzo, Paolo Ferragina, Mario Notturno Granieri: The Generalization of a Constructive Algorithm in Pattern Classification Problems. Int. J. Neural Syst. 3(Supplement): 65-70 (1992)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-12 21:35 CEST by the dblp team