| 2009 |
|---|
| 82 | EE | Paolo Ferragina,
Igor Nitto,
Rossano Venturini:
On the bit-complexity of Lempel-Ziv compression.
SODA 2009: 768-777 |
| 2008 |
|---|
| 81 | | Paolo Ferragina,
Gad M. Landau:
Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings
Springer 2008 |
| 80 | EE | Carlos Castillo,
Claudio Corsi,
Debora Donato,
Paolo Ferragina,
Aristides Gionis:
Query-log mining for detecting spam.
AIRWeb 2008: 17-20 |
| 79 | EE | Paolo Ferragina,
Roberto Grossi,
Ankur Gupta,
Rahul Shah,
Jeffrey Scott Vitter:
On searching compressed string collections cache-obliviously.
PODS 2008: 181-190 |
| 78 | EE | Paolo Ferragina,
Giovanni Manzini:
Boosting Textual Compression.
Encyclopedia of Algorithms 2008 |
| 77 | EE | Paolo Ferragina,
Giovanni Manzini:
Burrows-Wheeler Transform.
Encyclopedia of Algorithms 2008 |
| 76 | EE | Paolo Ferragina:
Suffix Tree Construction in Hierarchical Memory.
Encyclopedia of Algorithms 2008 |
| 75 | EE | Paolo Ferragina,
S. Srinivasa Rao:
Tree Compression and Indexing.
Encyclopedia of Algorithms 2008 |
| 74 | EE | Joong Chae Na,
Paolo Ferragina,
Raffaele Giancarlo,
Kunsoo Park:
Two-Dimensional Pattern Indexing.
Encyclopedia of Algorithms 2008 |
| 73 | EE | Paolo Ferragina,
Rodrigo González,
Gonzalo Navarro,
Rossano Venturini:
Compressed text indexes: From theory to practice.
ACM Journal of Experimental Algorithmics 13: (2008) |
| 72 | EE | Paolo Ferragina:
String algorithms and data structures
CoRR abs/0801.2378: (2008) |
| 71 | EE | Paolo Ferragina,
Igor Nitto,
Rossano Venturini:
Bit-Optimal Lempel-Ziv compression
CoRR abs/0802.0835: (2008) |
| 70 | EE | Fabio Crestani,
Paolo Ferragina,
Mark Sanderson:
Preface.
Inf. Retr. 11(4): 267-268 (2008) |
| 69 | EE | Paolo Ferragina,
Antonio Gulli:
A personalized search engine based on Web-snippet hierarchical clustering.
Softw., Pract. Exper. 38(2): 189-225 (2008) |
| 2007 |
|---|
| 68 | EE | Paolo Ferragina,
Johannes Fischer:
Suffix Arrays on Words.
CPM 2007: 328-339 |
| 67 | EE | Paolo Ferragina,
Rossano Venturini:
Compressed permuterm index.
SIGIR 2007: 535-542 |
| 66 | EE | Paolo Ferragina,
Rossano Venturini:
A simple storage scheme for strings achieving entropy bounds.
SODA 2007: 690-696 |
| 65 | EE | 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) |
| 64 | EE | Paolo Ferragina,
Giovanni Manzini,
Veli Mäkinen,
Gonzalo Navarro:
Compressed representations of sequences and full-text indexes.
ACM Transactions on Algorithms 3(2): (2007) |
| 63 | EE | Paolo Ferragina,
Rodrigo González,
Gonzalo Navarro,
Rossano Venturini:
Compressed Text Indexes:From Theory to Practice!
CoRR abs/0712.3360: (2007) |
| 62 | EE | Paolo Ferragina,
Rossano Venturini:
A simple storage scheme for strings achieving entropy bounds.
Theor. Comput. Sci. 372(1): 115-121 (2007) |
| 61 | EE | Paolo Ferragina,
Giovanni Manzini,
S. Muthukrishnan:
Foreword.
Theor. Comput. Sci. 387(3): 197-199 (2007) |
| 2006 |
|---|
| 60 | | Fabio Crestani,
Paolo Ferragina,
Mark Sanderson:
String Processing and Information Retrieval, 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings
Springer 2006 |
| 59 | EE | Paolo Ferragina,
Raffaele Giancarlo,
Giovanni Manzini:
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression.
ESA 2006: 756-767 |
| 58 | EE | Paolo Ferragina,
Raffaele Giancarlo,
Giovanni Manzini:
The Myriad Virtues of Wavelet Trees.
ICALP (1) 2006: 560-571 |
| 57 | EE | Paolo Ferragina,
Fabrizio Luccio,
Giovanni Manzini,
S. Muthukrishnan:
Compressing and searching XML data via two zips.
WWW 2006: 751-760 |
| 56 | EE | Paolo Ferragina,
Roberto Grossi,
Fabrizio Luccio:
Foreword.
Theory Comput. Syst. 39(3): 389 (2006) |
| 2005 |
|---|
| 55 | EE | Arash Farzan,
Paolo Ferragina,
Gianni Franceschini,
J. Ian Munro:
Cache-Oblivious Comparison-Based Algorithms on Multisets.
ESA 2005: 305-316 |
| 54 | EE | Paolo Ferragina,
Fabrizio Luccio,
Giovanni Manzini,
S. Muthukrishnan:
Structuring labeled trees for optimal succinctness, and beyond.
FOCS 2005: 184-196 |
| 53 | EE | Paolo Ferragina,
Antonio Gulli:
A personalized search engine based on web-snippet hierarchical clustering.
WWW (Special interest tracks and posters) 2005: 801-810 |
| 52 | EE | Paolo Ferragina,
Giovanni Manzini:
Indexing compressed text.
J. ACM 52(4): 552-581 (2005) |
| 51 | EE | Paolo Ferragina,
Raffaele Giancarlo,
Giovanni Manzini,
Marinella Sciortino:
Boosting textual compression in optimal linear time.
J. ACM 52(4): 688-713 (2005) |
| 2004 |
|---|
| 50 | EE | Paolo Ferragina,
Antonio Gulli:
The Anatomy of a Hierarchical Clustering Engine for Web-page, News and Book Snippets.
ICDM 2004: 395-398 |
| 49 | EE | Paolo Ferragina,
Antonio Gulli:
The Anatomy of SnakeT: A Hierarchical Clustering Engine for Web-Page Snippets.
PKDD 2004: 506-508 |
| 48 | EE | Paolo Ferragina,
Antonio Gulli:
Experimenting SnakeT: A Hierarchical Clustering Engine for Web-Page Snippets.
PKDD 2004: 543-545 |
| 47 | EE | Paolo Ferragina,
Giovanni Manzini:
Compression boosting in optimal linear time using the Burrows-Wheeler Transform.
SODA 2004: 655-663 |
| 46 | EE | Paolo Ferragina,
Giovanni Manzini,
Veli Mäkinen,
Gonzalo Navarro:
An Alphabet-Friendly FM-Index.
SPIRE 2004: 150-160 |
| 45 | EE | Giovanni Manzini,
Paolo Ferragina:
Engineering a Lightweight Suffix Array Construction Algorithm.
Algorithmica 40(1): 33-50 (2004) |
| 2003 |
|---|
| 44 | EE | Paolo Ferragina,
Nick Koudas,
S. Muthukrishnan,
Divesh Srivastava:
Two-dimensional substring indexing.
J. Comput. Syst. Sci. 66(4): 763-774 (2003) |
| 43 | EE | 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) |
| 2002 |
|---|
| 42 | EE | Giovanni Manzini,
Paolo Ferragina:
Engineering a Lightweight Suffix Array Construction Algorithm.
ESA 2002: 698-710 |
| 41 | EE | Valentina Ciriani,
Paolo Ferragina,
Fabrizio Luccio,
S. Muthukrishnan:
Static Optimality Theorem for External Memory String Access.
FOCS 2002: 219-227 |
| 40 | EE | Andreas Crauser,
Paolo Ferragina:
A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory.
Algorithmica 32(1): 1-35 (2002) |
| 2001 |
|---|
| 39 | EE | Paolo Ferragina,
Nick Koudas,
S. Muthukrishnan,
Divesh Srivastava:
Two-dimensional Substring Indexing.
PODS 2001 |
| 38 | EE | Paolo Ferragina,
Giovanni Manzini:
An experimental study of an opportunistic index.
SODA 2001: 269-278 |
| 37 | | Paolo Ferragina,
Giovanni Manzini:
An experimental study of a compressed index.
Inf. Sci. 135(1-2): 13-28 (2001) |
| 36 | | 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) |
| 2000 |
|---|
| 35 | | Paolo Ferragina,
Giovanni Manzini:
Opportunistic Data Structures with Applications.
FOCS 2000: 390-398 |
| 34 | EE | 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) |
| 33 | EE | Martin Farach-Colton,
Paolo Ferragina,
S. Muthukrishnan:
On the sorting-complexity of suffix tree construction.
J. ACM 47(6): 987-1011 (2000) |
| 1999 |
|---|
| 32 | EE | Klaus Brengel,
Andreas Crauser,
Paolo Ferragina,
Ulrich Meyer:
An Experimental Study of Priority Queues in External Memory.
Algorithm Engineering 1999: 346-360 |
| 31 | EE | Andreas Crauser,
Paolo Ferragina:
On Constructing Suffix Arrays in External Memory.
ESA 1999: 224-235 |
| 30 | EE | 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 |
| 29 | EE | Paolo Ferragina,
S. Muthukrishnan,
Mark de Berg:
Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems.
STOC 1999: 483-491 |
| 28 | EE | Paolo Ferragina,
Fabrizio Luccio:
String Search in Coarse-Grained Parallel Computers.
Algorithmica 24(3-4): 177-194 (1999) |
| 27 | EE | 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) |
| 26 | | Paolo Ferragina,
Roberto Grossi:
Improved Dynamic Text Indexing.
J. Algorithms 31(2): 291-319 (1999) |
| 25 | | Sajal K. Das,
Paolo Ferragina:
An EREW PRAM Algorithm for Updating Minimum Spanning Trees.
Parallel Processing Letters 9(1): 111-122 (1999) |
| 1998 |
|---|
| 24 | EE | Martin Farach,
Paolo Ferragina,
S. Muthukrishnan:
Overcoming the Memory Bottleneck in Suffix Tree Construction.
FOCS 1998: 174-185 |
| 23 | EE | 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 |
| 22 | | Paolo Ferragina,
Fabrizio Luccio:
Dynamic Dictionary Matching in External Memory.
Inf. Comput. 146(2): 85-99 (1998) |
| 21 | | Paolo Ferragina,
Roberto Grossi:
Optimal On-Line Search and Sublinear Time Update in String Matching.
SIAM J. Comput. 27(3): 713-736 (1998) |
| 20 | EE | Paolo Ferragina,
Roberto Grossi,
Manuela Montangero:
On Updating Suffix Tree Labels.
Theor. Comput. Sci. 201(1-2): 249-262 (1998) |
| 1997 |
|---|
| 19 | | Paolo Ferragina,
Roberto Grossi,
Manuela Montangero:
A Note on Updating Suffix Tree Labels.
CIAC 1997: 181-192 |
| 18 | EE | Lars Arge,
Paolo Ferragina,
Roberto Grossi,
Jeffrey Scott Vitter:
On Sorting Strings in External Memory (Extended Abstract).
STOC 1997: 540-548 |
| 17 | | Paolo Ferragina:
Dynamic Text Indexing under String Updates.
J. Algorithms 22(2): 296-328 (1997) |
| 1996 |
|---|
| 16 | | Paolo Ferragina,
S. Muthukrishnan:
Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract).
ESA 1996: 107-120 |
| 15 | | Paolo Ferragina,
Fabrizio Luccio:
On the Parallel Dynamic Dictionary Matching Problem: New Results with Applications.
ESA 1996: 261-275 |
| 14 | | Paolo Ferragina:
A Simple Parallel Dictionary Matching Algorithm.
Euro-Par, Vol. I 1996: 781-788 |
| 13 | | Paolo Ferragina,
Roberto Grossi:
Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results.
SODA 1996: 373-382 |
| 1995 |
|---|
| 12 | | Paolo Ferragina,
Roberto Grossi:
Optimal On-Line Search and Sublinear Time Update in String Matching.
FOCS 1995: 604-612 |
| 11 | EE | Paolo Ferragina:
An EREW PRAM fully-dynamic algorithm for MST.
IPPS 1995: 93-100 |
| 10 | | Paolo Ferragina,
Roberto Grossi:
Fast Incremental Text Editing.
SODA 1995: 531-540 |
| 9 | EE | Paolo Ferragina,
Roberto Grossi:
A fully-dynamic data structure for external substring search (Extended Abstract).
STOC 1995: 693-702 |
| 8 | | Paolo Ferragina:
A Technique to Speed Up Parallel Fully Dynamic Algorithms for MST.
J. Parallel Distrib. Comput. 31(2): 181-189 (1995) |
| 1994 |
|---|
| 7 | | Sajal K. Das,
Paolo Ferragina:
An o(n) Work EREW Parallel Algorithm for Updating MST.
ESA 1994: 331-342 |
| 6 | | Paolo Ferragina:
Incremental Text Editing: A New Data Structure.
ESA 1994: 495-507 |
| 5 | | Paolo Ferragina,
Fabrizio Luccio:
Batch Dynamic Algorithms for Two Graph Problems.
PARLE 1994: 713-724 |
| 4 | | Paolo Ferragina,
Angelo Monti,
Alessandro Roncato:
Trade-off Between Computational Power and Common Knowledge in Anonymous Rings.
SIROCCO 1994: 35-48 |
| 3 | | Paolo Ferragina:
Static and Dynamic Parallel Computation of Connected Components.
Inf. Process. Lett. 50(2): 63-68 (1994) |
| 1993 |
|---|
| 2 | EE | Silvano Di Zenzo,
Neil Burgess,
Paolo Ferragina,
Mario Notturno Granieri:
Recognition by constructive neural algorithms.
Pattern Recognition Letters 14(12): 997-1007 (1993) |
| 1992 |
|---|
| 1 | EE | 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) |
