| 2012 |
|---|
| 101 | Fast and Accurate Annotation of Short Texts with Wikipedia Pages. Paolo Ferragina, Ugo Scaiella. IEEE Software (29): 70-75 (2012). Web SearchBibTeXDownload |
| 2011 |
|---|
| 100 | On Optimally Partitioning a Text to Improve Its Compression. Paolo Ferragina, Igor Nitto, Rossano Venturini. Algorithmica (61): 51-74 (2011). Web SearchBibTeXDownload |
| 99 | On the Weak Prefix-Search Problem. Paolo Ferragina. CPM 2011, 261-272. Web SearchBibTeXDownload |
| 98 | Distribution-Aware Compressed Full-Text Indexes. Paolo Ferragina, Jouni Sirén, Rossano Venturini. ESA 2011, 760-771. Web SearchBibTeXDownload |
| 97 | First Steps Beyond the Bag-Of-Words Representation of Short Texts. Paolo Ferragina, Ugo Scaiella. IIR 2011. Web SearchBibTeXDownload |
| 96 | Beyond the bag-of-words paradigm to enhance information retrieval applications. Paolo Ferragina. SISAP 2011, 3-4. Web SearchBibTeXDownload |
| 2010 |
|---|
| 95 | The compressed permuterm index. Paolo Ferragina, Rossano Venturini. ACM Transactions on Algorithms (7): 10 (2010). Web SearchBibTeXDownload |
| 94 | TAGME: on-the-fly annotation of short text fragments (by wikipedia entities). Paolo Ferragina, Ugo Scaiella. CIKM 2010, 1625-1628. Web SearchBibTeXDownload |
| 93 | TAGME: on-the-fly annotation of short text fragments (by Wikipedia entities). Paolo Ferragina, Ugo Scaiella. CoRR (abs/1006.3498) (2010). Web SearchBibTeXDownload |
| 92 | Data Structures: Time, I/Os, Entropy, Joules!. Paolo Ferragina. ESA (2) 2010, 1-16. Web SearchBibTeXDownload |
| 91 | Information processing at work: On energy-aware algorithm design. Antonio Cisternino, Paolo Ferragina, Davide Morelli, Massimo Coppola. Green Computing Conference 2010, 407-415. Web SearchBibTeXDownload |
| 90 | Lightweight Data Indexing and Compression in External Memory. Paolo Ferragina, Travis Gagie, Giovanni Manzini. LATIN 2010, 697-710. Web SearchBibTeXDownload |
| 89 | On compact representations of All-Pairs-Shortest-Path-Distance matrices. Paolo Ferragina, Igor Nitto, Rossano Venturini. Theor. Comput. Sci. (411): 3293-3300 (2010). Web SearchBibTeXDownload |
| 88 | On compressing the textual web. Paolo Ferragina, Giovanni Manzini. WSDM 2010, 391-400. Web SearchBibTeXDownload |
| 2009 |
|---|
| 87 | Lightweight Data Indexing and Compression in External Memory. Paolo Ferragina, Travis Gagie, Giovanni Manzini. CoRR (abs/0909.4341) (2009). Web SearchBibTeXDownload |
| 86 | On optimally partitioning a text to improve its compression. Paolo Ferragina, Igor Nitto, Rossano Venturini. CoRR (abs/0906.4692) (2009). Web SearchBibTeXDownload |
| 85 | Text Compression. Paolo Ferragina, Igor Nitto. Encyclopedia of Database Systems 2009, 3046-3048. Web SearchBibTeXDownload |
| 84 | Indexing Compressed Text. Paolo Ferragina, Rossano Venturini. Encyclopedia of Database Systems 2009, 1442-1448. Web SearchBibTeXDownload |
| 83 | On Optimally Partitioning a Text to Improve Its Compression. Paolo Ferragina, Igor Nitto, Rossano Venturini. ESA 2009, 420-431. Web SearchBibTeXDownload |
| 82 | The myriad virtues of Wavelet Trees. Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini. Inf. Comput. (207): 849-866 (2009). Web SearchBibTeXDownload |
| 81 | Compressing and indexing labeled trees, with applications. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan. J. ACM (57) (2009). Web SearchBibTeXDownload |
| 80 | On the bit-complexity of Lempel-Ziv compression. Paolo Ferragina, Igor Nitto, Rossano Venturini. SODA 2009, 768-777. Web SearchBibTeXDownload |
| 2008 |
|---|
| 79 | Compressed text indexes: From theory to practice. Paolo Ferragina, Rodrigo González, Gonzalo Navarro, Rossano Venturini. ACM Journal of Experimental Algorithmics (13) (2008). Web SearchBibTeXDownload |
| 78 | Query-log mining for detecting spam. Carlos Castillo, Claudio Corsi, Debora Donato, Paolo Ferragina, Aristides Gionis. AIRWeb 2008, 17-20. Cited by 6Web SearchBibTeXDownload |
| 77 | Bit-Optimal Lempel-Ziv compression. Paolo Ferragina, Igor Nitto, Rossano Venturini. CoRR (abs/0802.0835) (2008). Web SearchBibTeXDownload |
| 76 | String algorithms and data structures. Paolo Ferragina. CoRR (abs/0801.2378) (2008). Web SearchBibTeXDownload |
| 75 | Burrows-Wheeler Transform. Paolo Ferragina, Giovanni Manzini. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload |
| 74 | Boosting Textual Compression. Paolo Ferragina, Giovanni Manzini. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload |
| 73 | Tree Compression and Indexing. Paolo Ferragina, S. Srinivasa Rao. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload |
| 72 | Two-Dimensional Pattern Indexing. Joong Chae Na, Paolo Ferragina, Raffaele Giancarlo, Kunsoo Park. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload |
| 71 | Suffix Tree Construction in Hierarchical Memory. Paolo Ferragina. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload |
| 70 | On searching compressed string collections cache-obliviously. Paolo Ferragina, Roberto Grossi, Ankur Gupta, Rahul Shah, Jeffrey Scott Vitter. PODS 2008, 181-190. Web SearchBibTeXDownload |
| 69 | A personalized search engine based on Web-snippet hierarchical clustering. Paolo Ferragina, Antonio Gulli. Softw., Pract. Exper. (38): 189-225 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 68 | Compressed representations of sequences and full-text indexes. Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload |
| 67 | A data structure for a sequence of string accesses in external memory. Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan. ACM Transactions on Algorithms (3) (2007). Cited by 6Web SearchBibTeXDownload |
| 66 | Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment. Paolo Ferragina, Raffaele Giancarlo, Valentina Greco, Giovanni Manzini, Gabriel Valiente. BMC Bioinformatics (8) (2007). Web SearchBibTeXDownload |
| 65 | The BioPrompt-box: an ontology-based clustering tool for searching in biological databases. Claudio Corsi, Paolo Ferragina, Roberto Marangoni. BMC Bioinformatics (8) (2007). Web SearchBibTeXDownload |
| 64 | Compressed Text Indexes:From Theory to Practice!. Paolo Ferragina, Rodrigo González, Gonzalo Navarro, Rossano Venturini. CoRR (abs/0712.3360) (2007). Web SearchBibTeXDownload |
| 63 | Suffix Arrays on Words. Paolo Ferragina, Johannes Fischer. CPM 2007, 328-339. Web SearchBibTeXDownload |
| 62 | Compressed permuterm index. Paolo Ferragina, Rossano Venturini. SIGIR 2007, 535-542. Web SearchBibTeXDownload |
| 61 | A simple storage scheme for strings achieving entropy bounds. Paolo Ferragina, Rossano Venturini. SODA 2007, 690-696. Web SearchBibTeXDownload |
| 2006 |
|---|
| 60 | The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression. Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini. ESA 2006, 756-767. Web SearchBibTeXDownload |
| 59 | The Myriad Virtues of Wavelet Trees. Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini. ICALP (1) 2006, 560-571. Web SearchBibTeXDownload |
| 58 | Compressing and searching XML data via two zips. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan. WWW 2006, 751-760. Cited by 38Web SearchBibTeXDownload |
| 2005 |
|---|
| 57 | Cache-Oblivious Comparison-Based Algorithms on Multisets. Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro. ESA 2005, 305-316. Web SearchBibTeXDownload |
| 56 | Structuring labeled trees for optimal succinctness, and beyond. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan. FOCS 2005, 184-196. Cited by 60Web SearchBibTeXDownload |
| 55 | Boosting textual compression in optimal linear time. Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini, Marinella Sciortino. J. ACM (52): 688-713 (2005). Web SearchBibTeXDownload |
| 54 | Indexing compressed text. Paolo Ferragina, Giovanni Manzini. J. ACM (52): 552-581 (2005). Web SearchBibTeXDownload |
| 53 | A personalized search engine based on web-snippet hierarchical clustering. Paolo Ferragina, Antonio Gulli. WWW (Special interest tracks and posters) 2005, 801-810. Web SearchBibTeXDownload |
| 2004 |
|---|
| 52 | Engineering a Lightweight Suffix Array Construction Algorithm. Giovanni Manzini, Paolo Ferragina. Algorithmica (40): 33-50 (2004). Web SearchBibTeXDownload |
| 51 | The Anatomy of a Hierarchical Clustering Engine for Web-page, News and Book Snippets. Paolo Ferragina, Antonio Gulli. ICDM 2004, 395-398. Web SearchBibTeXDownload |
| 50 | Experimenting SnakeT: A Hierarchical Clustering Engine for Web-Page Snippets. Paolo Ferragina, Antonio Gulli. PKDD 2004, 543-545. Web SearchBibTeXDownload |
| 49 | The Anatomy of SnakeT: A Hierarchical Clustering Engine for Web-Page Snippets. Paolo Ferragina, Antonio Gulli. PKDD 2004, 506-508. Web SearchBibTeXDownload |
| 48 | Compression boosting in optimal linear time using the Burrows-Wheeler Transform. Paolo Ferragina, Giovanni Manzini. SODA 2004, 655-663. Web SearchBibTeXDownload |
| 47 | An Alphabet-Friendly FM-Index. Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro. SPIRE 2004, 150-160. Web SearchBibTeXDownload |
| 2003 |
|---|
| 46 | Two-dimensional substring indexing. Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava. J. Comput. Syst. Sci. (66): 763-774 (2003). Cited by 22Web SearchBibTeXDownload |
| 45 | PaTre: A Method for Paralogy Trees Construction. Nadia Pisanti, Roberto Marangoni, Paolo Ferragina, Antonio Frangioni, A. Savona, C. Pisanelli, Fabrizio Luccio. Journal of Computational Biology (10): 791-802 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 44 | A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory. Andreas Crauser, Paolo Ferragina. Algorithmica (32): 1-35 (2002). Web SearchBibTeXDownload |
| 43 | Engineering a Lightweight Suffix Array Construction Algorithm. Giovanni Manzini, Paolo Ferragina. ESA 2002, 698-710. Web SearchBibTeXDownload |
| 42 | Static Optimality Theorem for External Memory String Access. Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan. FOCS 2002, 219-227. Cited by 10Web SearchBibTeXDownload |
| 2001 |
|---|
| 41 | An experimental study of a compressed index. Paolo Ferragina, Giovanni Manzini. Inf. Sci. (135): 13-28 (2001). Web SearchBibTeXDownload |
| 40 | Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos. Int. J. Comput. Geometry Appl. (11): 305-337 (2001). Web SearchBibTeX |
| 39 | Two-dimensional Substring Indexing. Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava. PODS 2001. Web SearchBibTeXDownload |
| 38 | An experimental study of an opportunistic index. Paolo Ferragina, Giovanni Manzini. SODA 2001, 269-278. Web SearchBibTeXDownload |
| 2000 |
|---|
| 37 | An Experimental Study of Priority Queues in External Memory. Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer. ACM Journal of Experimental Algorithmics (5): 17 (2000). Web SearchBibTeXDownload |
| 36 | Opportunistic Data Structures with Applications. Paolo Ferragina, Giovanni Manzini. FOCS 2000, 390-398. Web SearchBibTeXDownload |
| 35 | On the sorting-complexity of suffix tree construction. Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan. J. ACM (47): 987-1011 (2000). Cited by 96Web SearchBibTeXDownload |
| 1999 |
|---|
| 34 | An Experimental Study of Priority Queues in External Memory. Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer. Algorithm Engineering 1999, 346-360. Web SearchBibTeXDownload |
| 33 | String Search in Coarse-Grained Parallel Computers. Paolo Ferragina, Fabrizio Luccio. Algorithmica (24): 177-194 (1999). Web SearchBibTeXDownload |
| 32 | On Constructing Suffix Arrays in External Memory. Andreas Crauser, Paolo Ferragina. ESA 1999, 224-235. Web SearchBibTeXDownload |
| 31 | The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. Paolo Ferragina, Roberto Grossi. J. ACM (46): 236-280 (1999). Web SearchBibTeXDownload |
| 30 | Improved Dynamic Text Indexing. Paolo Ferragina, Roberto Grossi. J. Algorithms (31): 291-319 (1999). Web SearchBibTeXDownload |
| 29 | An EREW PRAM Algorithm for Updating Minimum Spanning Trees. Sajal K. Das, Paolo Ferragina. Parallel Processing Letters (9): 111-122 (1999). Web SearchBibTeX |
| 28 | q-gram based database searching using a suffix array (QUASAR). Stefan Burkhardt, Andreas Crauser, Paolo Ferragina, Hans-Peter Lenhof, Eric Rivals, Martin Vingron. RECOMB 1999, 77-83. Web SearchBibTeXDownload |
| 27 | Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. Paolo Ferragina, S. Muthukrishnan, Mark de Berg. STOC 1999, 483-491. Cited by 20Web SearchBibTeXDownload |
| 1998 |
|---|
| 26 | Overcoming the Memory Bottleneck in Suffix Tree Construction. Martin Farach, Paolo Ferragina, S. Muthukrishnan. FOCS 1998, 174-185. Cited by 67Web SearchBibTeXDownload |
| 25 | Dynamic Dictionary Matching in External Memory. Paolo Ferragina, Fabrizio Luccio. Inf. Comput. (146): 85-99 (1998). Web SearchBibTeXDownload |
| 24 | Optimal On-Line Search and Sublinear Time Update in String Matching. Paolo Ferragina, Roberto Grossi. SIAM J. Comput. (27): 713-736 (1998). Web SearchBibTeXDownload |
| 23 | Randomized External-Memory Algorithms for Some Geometric Problems. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos. Symposium on Computational Geometry 1998, 259-268. Web SearchBibTeXDownload |
| 22 | On Updating Suffix Tree Labels. Paolo Ferragina, Roberto Grossi, Manuela Montangero. Theor. Comput. Sci. (201): 249-262 (1998). Web SearchBibTeXDownload |
| 1997 |
|---|
| 21 | A Note on Updating Suffix Tree Labels. Paolo Ferragina, Roberto Grossi, Manuela Montangero. CIAC 1997, 181-192. Web SearchBibTeXDownload |
| 20 | Dynamic Text Indexing under String Updates. Paolo Ferragina. J. Algorithms (22): 296-328 (1997). Web SearchBibTeXDownload |
| 19 | On Sorting Strings in External Memory (Extended Abstract). Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter. STOC 1997, 540-548. Cited by 67Web SearchBibTeXDownload |
| 1996 |
|---|
| 18 | On the Parallel Dynamic Dictionary Matching Problem: New Results with Applications. Paolo Ferragina, Fabrizio Luccio. ESA 1996, 261-275. Web SearchBibTeXDownload |
| 17 | Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract). Paolo Ferragina, S. Muthukrishnan. ESA 1996, 107-120. Cited by 21Web SearchBibTeXDownload |
| 16 | A Simple Parallel Dictionary Matching Algorithm. Paolo Ferragina. Euro-Par, Vol. I 1996, 781-788. Web SearchBibTeXDownload |
| 15 | Three Techniques for Parallel Maintenance of a Minimum Spanning Tree under Batch of Updates. Paolo Ferragina, Fabrizio Luccio. Parallel Processing Letters (6): 213-222 (1996). Web SearchBibTeXDownload |
| 14 | Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results. Paolo Ferragina, Roberto Grossi. SODA 1996, 373-382. Web SearchBibTeXDownload |
| 1995 |
|---|
| 13 | Optimal On-Line Search and Sublinear Time Update in String Matching. Paolo Ferragina, Roberto Grossi. FOCS 1995, 604-612. Web SearchBibTeXDownload |
| 12 | An EREW PRAM fully-dynamic algorithm for MST. Paolo Ferragina. IPPS 1995, 93-100. Web SearchBibTeXDownload |
| 11 | A Technique to Speed Up Parallel Fully Dynamic Algorithms for MST. Paolo Ferragina. J. Parallel Distrib. Comput. (31): 181-189 (1995). Web SearchBibTeXDownload |
| 10 | Recognition of hand-written rotated digits by neural networks. Cesare Calabró, Paolo Ferragina, Mario Notturno Granieri. Mach. Vis. Appl. (8): 351-357 (1995). Web SearchBibTeXDownload |
| 9 | Fast Incremental Text Editing. Paolo Ferragina, Roberto Grossi. SODA 1995, 531-540. Web SearchBibTeXDownload |
| 8 | A fully-dynamic data structure for external substring search (Extended Abstract). Paolo Ferragina, Roberto Grossi. STOC 1995, 693-702. Web SearchBibTeXDownload |
| 1994 |
|---|
| 7 | An o(n) Work EREW Parallel Algorithm for Updating MST. Sajal K. Das, Paolo Ferragina. ESA 1994, 331-342. Web SearchBibTeXDownload |
| 6 | Incremental Text Editing: A New Data Structure. Paolo Ferragina. ESA 1994, 495-507. Web SearchBibTeXDownload |
| 5 | Static and Dynamic Parallel Computation of Connected Components. Paolo Ferragina. Inf. Process. Lett. (50): 63-68 (1994). Web SearchBibTeXDownload |
| 4 | Batch Dynamic Algorithms for Two Graph Problems. Paolo Ferragina, Fabrizio Luccio. PARLE 1994, 713-724. Web SearchBibTeXDownload |
| 3 | Trade-off Between Computational Power and Common Knowledge in Anonymous Rings. Paolo Ferragina, Angelo Monti, Alessandro Roncato. SIROCCO 1994, 35-48. Web SearchBibTeX |
| 1993 |
|---|
| 2 | Recognition by constructive neural algorithms. Silvano Di Zenzo, Neil Burgess, Paolo Ferragina, Mario Notturno Granieri. Pattern Recognition Letters (14): 997-1007 (1993). Web SearchBibTeXDownload |
| 1992 |
|---|
| 1 | The Generalization of a Constructive Algorithm in Pattern Classification Problems. Neil Burgess, Silvano Di Zenzo, Paolo Ferragina, Mario Notturno Granieri. Int. J. Neural Syst. (3): 65-70 (1992). Web SearchBibTeXDownload |
