default search action
Paolo Ferragina
Person information
- affiliation: University of Pisa, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j68]Andrea Somazzi
, Paolo Ferragina
On Nonlinear Compression Costs: When Shannon Meets Rényi. IEEE Access 12: 77750-77763 (2024) - [j67]Antonio Boffa
CoCo-trie: Data-aware compression and indexing of strings. Inf. Syst. 120: 102316 (2024) - [j66]Marco Costa
Grafite: Taming Adversarial Queries with Optimal Range Filters. Proc. ACM Manag. Data 2(1): 3:1-3:23 (2024) - [i18]Francesco Tosoni, Philip Bille, Valerio Brunacci, Alessio De Angelis, Paolo Ferragina, Giovanni Manzini:
Toward Greener Matrix Operations by Lossless Compressed Formats. CoRR abs/2409.18620 (2024) - 2023
- [j65]Paolo Ferragina
On Nonlinear Learned String Indexing. IEEE Access 11: 74021-74034 (2023) - [c80]Paolo Ferragina, Hans-Peter Lehmann
Learned Monotone Minimal Perfect Hashing. ESA 2023: 46:1-46:17 - [c79]Paolo Ferragina
Engineering a Textbook Approach to Index Massive String Dictionaries. SPIRE 2023: 203-217 - [i17]Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, Giorgio Vinciguerra:
Learned Monotone Minimal Perfect Hashing. CoRR abs/2304.11012 (2023) - [i16]Andrea Somazzi, Paolo Ferragina, Diego Garlaschelli:
On nonlinear compression costs: when Shannon meets Rényi. CoRR abs/2310.18419 (2023) - [i15]Marco Costa, Paolo Ferragina, Giorgio Vinciguerra:
Grafite: Taming Adversarial Queries with Optimal Range Filters. CoRR abs/2311.15380 (2023) - 2022
- [j64]Paolo Ferragina
Compressing and Querying Integer Dictionaries Under Linearities and Repetitions. IEEE Access 10: 118831-118848 (2022) - [j63]Alessandro Muscolino, Antonio Di Maria
NETME: on-the-fly knowledge network construction from biomedical literature. Appl. Netw. Sci. 7(1): 1-24 (2022) - [j62]Paolo Ferragina, Giovanni Manzini, Travis Gagie, Dominik Köppl
Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices. Proc. VLDB Endow. 15(10): 2175-2187 (2022) - [j61]Antonio Boffa
A Learned Approach to Design Compressed Rank/Select Data Structures. ACM Trans. Algorithms 18(3): 24:1-24:28 (2022) - [j60]Francesco Tosoni
Locality Filtering for Efficient Ride Sharing Platforms. IEEE Trans. Intell. Transp. Syst. 23(7): 7785-7804 (2022) - [c78]Antonio Boffa
Compressed String Dictionaries via Data-Aware Subtrie Compaction. SPIRE 2022: 233-249 - [i14]Paolo Ferragina, Travis Gagie, Dominik Köppl
Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices. CoRR abs/2203.14540 (2022) - 2021
- [j59]Mirco Nanni, Gennady L. Andrienko, Albert-László Barabási, Chiara Boldrini, Francesco Bonchi, Ciro Cattuto, Francesca Chiaromonte, Giovanni Comandè, Marco Conti, Mark Coté, Frank Dignum, Virginia Dignum, Josep Domingo-Ferrer, Paolo Ferragina, Fosca Giannotti, Riccardo Guidotti, Dirk Helbing, Kimmo Kaski, János Kertész, Sune Lehmann, Bruno Lepri, Paul Lukowicz, Stan Matwin, David Megías Jiménez, Anna Monreale, Katharina Morik, Nuria Oliver, Andrea Passarella, Andrea Passerini, Dino Pedreschi
Give more data, awareness and control to individual citizens, and they will help COVID-19 containment. Ethics Inf. Technol. 23(S1): 1-6 (2021) - [j58]Paolo Ferragina
On the performance of learned data structures. Theor. Comput. Sci. 871: 107-120 (2021) - [c77]Antonio Boffa, Paolo Ferragina, Giorgio Vinciguerra:
A "Learned" Approach to Quicken and Compress Rank/Select Dictionaries. ALENEX 2021: 46-59 - [c76]Paolo Ferragina, Giovanni Manzini, Giorgio Vinciguerra
Repetition- and Linearity-Aware Rank/Select Dictionaries. ISAAC 2021: 64:1-64:16 - [c75]Marco Ponza, Diego Ceccarelli, Paolo Ferragina, Edgar Meij, Sambhav Kothari:
Contextualizing Trending Entities in News Stories. WSDM 2021: 346-354 - [i13]Paolo Cintia, Giovanni Mauro, Luca Pappalardo, Paolo Ferragina:
An interactive dashboard for searching and comparing soccer performance scores. CoRR abs/2105.04293 (2021) - 2020
- [j57]Ajoy K. Datta, Paolo Ferragina, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe
Linear time distributed swap edge algorithms. Inf. Process. Lett. 161: 105979 (2020) - [j56]Marco Ponza, Paolo Ferragina
On Computing Entity Relatedness in Wikipedia, with Applications. Knowl. Based Syst. 188 (2020) - [j55]Paolo Ferragina, Giorgio Vinciguerra
The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds. Proc. VLDB Endow. 13(8): 1162-1175 (2020) - [j54]Mirco Nanni, Gennady L. Andrienko, Albert-László Barabási, Chiara Boldrini, Francesco Bonchi, Ciro Cattuto, Francesca Chiaromonte, Giovanni Comandè, Marco Conti, Mark Coté, Frank Dignum, Virginia Dignum, Josep Domingo-Ferrer, Paolo Ferragina, Fosca Giannotti, Riccardo Guidotti, Dirk Helbing, Kimmo Kaski, János Kertész, Sune Lehmann, Bruno Lepri, Paul Lukowicz, Stan Matwin, David Megías, Anna Monreale, Katharina Morik, Nuria Oliver, Andrea Passarella, Andrea Passerini, Dino Pedreschi, Alex Pentland, Fabio Pianesi, Francesca Pratesi, Salvatore Rinzivillo, Salvatore Ruggieri, Arno Siebes, Vicenç Torra
Give more data, awareness and control to individual citizens, and they will help COVID-19 containment. Trans. Data Priv. 13(1): 61-66 (2020) - [c74]Alessandro Muscolino, Antonio Di Maria
NETME: On-the-Fly Knowledge Network Construction from Biomedical Literature. COMPLEX NETWORKS (2) 2020: 386-397 - [c73]Paolo Ferragina, Fabrizio Lillo, Giorgio Vinciguerra:
Why Are Learned Indexes So Effective? ICML 2020: 3123-3132
2010 – 2019
- 2019
- [j53]Marco Ponza
Swat: A system for detecting salient Wikipedia entities in texts. Comput. Intell. 35(4): 858-890 (2019) - [j52]Paolo Cifariello, Paolo Ferragina
Wiser: A semantic approach for expert finding in academia based on entity linking. Inf. Syst. 82: 1-16 (2019) - [j51]Andrea Farruggia
Bicriteria Data Compression. SIAM J. Comput. 48(5): 1603-1642 (2019) - [j50]Luca Pappalardo
PlayeRank: Data-driven Performance Evaluation and Player Ranking in Soccer via a Machine Learning Approach. ACM Trans. Intell. Syst. Technol. 10(5): 59:1-59:27 (2019) - [j49]Jyrki Alakuijala, Andrea Farruggia, Paolo Ferragina
Brotli: A General-Purpose Data Compressor. ACM Trans. Inf. Syst. 37(1): 4:1-4:30 (2019) - [j48]Marco Cornolti, Paolo Ferragina
SMAPH: A Piggyback Approach for Entity-Linking in Web Queries. ACM Trans. Inf. Syst. 37(1): 13:1-13:42 (2019) - [c72]Paolo Ferragina, Giorgio Vinciguerra
Learned Data Structures. INNSBDDL (Tutorials) 2019: 5-41 - [i12]Giorgio Vinciguerra, Paolo Ferragina, Michele Miccinesi:
Superseding traditional indexes by orchestrating learning and geometry. CoRR abs/1903.00507 (2019) - [i11]Paolo Ferragina, Giorgio Vinciguerra:
The PGM-index: a multicriteria, compressed and learned approach to data indexing. CoRR abs/1910.06169 (2019) - 2018
- [b1]Paolo Ferragina, Fabrizio Luccio:
Computational Thinking - First Algorithms, Then Code. Springer 2018, ISBN 978-3-319-97939-7, pp. 1-174 - [r14]Paolo Ferragina, Igor Nitto, Rossano Venturini:
Text Compression. Encyclopedia of Database Systems (2nd ed.) 2018 - [r13]Paolo Ferragina, Rossano Venturini:
Indexing Compressed Text. Encyclopedia of Database Systems (2nd ed.) 2018 - [i10]Luca Pappalardo, Paolo Cintia, Paolo Ferragina, Emanuele Massucco, Dino Pedreschi, Fosca Giannotti:
PlayeRank: Multi-dimensional and role-aware rating of soccer player performance. CoRR abs/1802.04987 (2018) - [i9]Marco Ponza, Paolo Ferragina, Francesco Piccinno:
SWAT: A System for Detecting Salient Wikipedia Entities in Texts. CoRR abs/1804.03580 (2018) - [i8]Paolo Cifariello, Paolo Ferragina, Marco Ponza:
WISER: A Semantic Approach for Expert Finding in Academia based on Entity Linking. CoRR abs/1805.03947 (2018) - 2017
- [c71]Marco Ponza, Paolo Ferragina
A Two-Stage Framework for Computing Entity Relatedness in Wikipedia. CIKM 2017: 1867-1876 - [c70]Marco Ponza, Paolo Ferragina
Document Aboutness via Sophisticated Syntactic and Semantic Features. NLDB 2017: 441-453 - 2016
- [j47]Paolo Ferragina
Compressed Cache-Oblivious String B-Tree. ACM Trans. Algorithms 12(4): 52:1-52:17 (2016) - [c69]Marco Cornolti, Paolo Ferragina
A Piggyback System for Joint Entity Mention Detection and Linking in Web Queries. WWW 2016: 567-578 - [r12]Paolo Ferragina, Giovanni Manzini:
Boosting Textual Compression. Encyclopedia of Algorithms 2016: 228-232 - [r11]Paolo Ferragina, Giovanni Manzini:
Burrows-Wheeler Transform. Encyclopedia of Algorithms 2016: 250-255 - [r10]Paolo Ferragina, Srinivasa Rao Satti:
Compressing and Indexing Structured Text. Encyclopedia of Algorithms 2016: 401-407 - [r9]Joong Chae Na, Paolo Ferragina, Raffaele Giancarlo, Kunsoo Park:
Indexed Two-Dimensional String Matching. Encyclopedia of Algorithms 2016: 973-977 - [r8]Paolo Ferragina:
Suffix Tree Construction in Hierarchical Memory. Encyclopedia of Algorithms 2016: 2149-2154 - 2015
- [c68]Paolo Ferragina, Francesco Piccinno, Roberto Santoro:
On Analyzing Hashtags in Twitter. ICWSM 2015: 110-119 - [c67]Paolo Ferragina
Compressed Indexes for String Searching in Labeled Graphs. WWW 2015: 322-332 - [c66]Ricardo Usbeck
GERBIL: General Entity Annotator Benchmarking Framework. WWW 2015: 1133-1143 - 2014
- [j46]Leah Epstein, Paolo Ferragina
Guest Editorial: Selected Papers of European Symposium of Algorithms. Algorithmica 70(3): 365-367 (2014) - [c65]Andrea Farruggia, Paolo Ferragina
Bicriteria Data Compression: Efficient and Usable. ESA 2014: 406-417 - [c64]Marco Cornolti, Paolo Ferragina
The SMAPH system for query entity recognition and disambiguation. ERD@SIGIR 2014: 25-30 - [c63]Francesco Piccinno, Paolo Ferragina
From TagME to WAT: a new entity annotator. ERD@SIGIR 2014: 55-62 - [c62]Andrea Farruggia, Paolo Ferragina, Antonio Frangioni
Bicriteria data compression. SODA 2014: 1582-1595 - 2013
- [j45]Paolo Ferragina
Distribution-Aware Compressed Full-Text Indexes. Algorithmica 67(4): 529-546 (2013) - [j44]Paolo Ferragina
On the Bit-Complexity of Lempel-Ziv Compression. SIAM J. Comput. 42(4): 1521-1541 (2013) - [j43]Paolo Ferragina
On the weak prefix-search problem. Theor. Comput. Sci. 483: 75-84 (2013) - [c61]Paolo Ferragina
Compressed Cache-Oblivious String B-tree. ESA 2013: 469-480 - [c60]Marco Cornolti, Paolo Ferragina, Massimiliano Ciaramita:
A framework for benchmarking entity-annotation systems. WWW 2013: 249-260 - [p1]Paolo Ferragina
Web Search. The Power of Algorithms 2013: 107-137 - [e4]Stefano Leonardi, Alessandro Panconesi, Paolo Ferragina, Aristides Gionis:
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 [contents] - [i7]Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, Rossano Venturini:
Bicriteria data compression. CoRR abs/1307.3872 (2013) - 2012
- [j42]Paolo Ferragina
Lightweight Data Indexing and Compression in External Memory. Algorithmica 63(3): 707-730 (2012) - [j41]Paolo Ferragina
Fast and Accurate Annotation of Short Texts with Wikipedia Pages. IEEE Softw. 29(1): 70-75 (2012) - [c59]Daniele Vitale, Paolo Ferragina
Classification of Short Texts by Deploying Topical Annotations. ECIR 2012: 376-387 - [c58]Ugo Scaiella, Paolo Ferragina
Topical clustering of search results. WSDM 2012: 223-232 - [e3]Leah Epstein, Paolo Ferragina:
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 [contents] - 2011
- [j40]Paolo Ferragina
On Optimally Partitioning a Text to Improve Its Compression. Algorithmica 61(1): 51-74 (2011) - [c57]Paolo Ferragina
On the Weak Prefix-Search Problem. CPM 2011: 261-272 - [c56]Paolo Ferragina
Distribution-Aware Compressed Full-Text Indexes. ESA 2011: 760-771 - [c55]Paolo Ferragina, Ugo Scaiella:
First Steps Beyond the Bag-Of-Words Representation of Short Texts. IIR 2011 - [c54]Paolo Ferragina
Beyond the bag-of-words paradigm to enhance information retrieval applications. SISAP 2011: 3-4 - 2010
- [j39]Paolo Ferragina
The compressed permuterm index. ACM Trans. Algorithms 7(1): 10:1-10:21 (2010) - [j38]Paolo Ferragina
On compact representations of All-Pairs-Shortest-Path-Distance matrices. Theor. Comput. Sci. 411(34-36): 3293-3300 (2010) - [c53]Paolo Ferragina
TAGME: on-the-fly annotation of short text fragments (by wikipedia entities). CIKM 2010: 1625-1628 - [c52]Paolo Ferragina
Data Structures: Time, I/Os, Entropy, Joules! ESA (2) 2010: 1-16 - [c51]Antonio Cisternino
Information processing at work: On energy-aware algorithm design. Green Computing Conference 2010: 407-415 - [c50]Paolo Ferragina
Lightweight Data Indexing and Compression in External Memory. LATIN 2010: 697-710 - [c49]Paolo Ferragina
On compressing the textual web. WSDM 2010: 391-400 - [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
The myriad virtues of Wavelet Trees. Inf. Comput. 207(8): 849-866 (2009) - [j36]Paolo Ferragina
Compressing and indexing labeled trees, with applications. J. ACM 57(1): 4:1-4:33 (2009) - [j35]Paolo Ferragina
Foreword. Theor. Comput. Sci. 410(51): 5299 (2009) - [c48]Paolo Ferragina
On Optimally Partitioning a Text to Improve Its Compression. ESA 2009: 420-431 - [c47]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]Paolo Ferragina, Igor Nitto:
Text Compression. Encyclopedia of Database Systems 2009: 3046-3048 - [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]Fabio Crestani
Preface. Inf. Retr. 11(4): 267-268 (2008) - [j33]Paolo Ferragina
Compressed text indexes: From theory to practice. ACM J. Exp. Algorithmics 13 (2008) - [j32]Paolo Ferragina
A personalized search engine based on Web-snippet hierarchical clustering. Softw. Pract. Exp. 38(2): 189-225 (2008) - [c46]Carlos Castillo
Query-log mining for detecting spam. AIRWeb 2008: 17-20 - [c45]Paolo Ferragina
On searching compressed string collections cache-obliviously. PODS 2008: 181-190 - [e2]Paolo Ferragina, Gad M. Landau:
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 [contents] - [r5]Paolo Ferragina:
Suffix Tree Construction in Hierarchical Memory. Encyclopedia of Algorithms 2008 - [r4]Paolo Ferragina, Giovanni Manzini:
Boosting Textual Compression. Encyclopedia of Algorithms 2008 - [r3]Paolo Ferragina, Giovanni Manzini:
Burrows-Wheeler Transform. Encyclopedia of Algorithms 2008 - [r2]Paolo Ferragina, S. Srinivasa Rao:
Tree Compression and Indexing. Encyclopedia of Algorithms 2008 - [r1]Joong Chae Na, Paolo Ferragina, Raffaele Giancarlo, Kunsoo Park:
Two-Dimensional Pattern Indexing. Encyclopedia of Algorithms 2008 - [i3]Paolo Ferragina:
String algorithms and data structures. CoRR abs/0801.2378 (2008) - [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 Bioinform. 8(S-1) (2007) - [j30]Paolo Ferragina
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment. BMC Bioinform. 8 (2007) - [j29]Valentina Ciriani
A data structure for a sequence of string accesses in external memory. ACM Trans. Algorithms 3(1): 6:1-6:23 (2007) - [j28]Paolo Ferragina
Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 3(2): 20 (2007) - [j27]Paolo Ferragina
A simple storage scheme for strings achieving entropy bounds. Theor. Comput. Sci. 372(1): 115-121 (2007) - [j26]Paolo Ferragina
Foreword. Theor. Comput. Sci. 387(3): 197-199 (2007) - [c44]Paolo Ferragina, Johannes Fischer:
Suffix Arrays on Words. CPM 2007: 328-339 - [c43]Paolo Ferragina
Compressed permuterm index. SIGIR 2007: 535-542 - [c42]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]Paolo Ferragina
Foreword. Theory Comput. Syst. 39(3): 389 (2006) - [c41]Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini:
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression. ESA 2006: 756-767 - [c40]Paolo Ferragina
The Myriad Virtues of Wavelet Trees. ICALP (1) 2006: 560-571 - [c39]Paolo Ferragina
Compressing and searching XML data via two zips. WWW 2006: 751-760 - [e1]Fabio Crestani, Paolo Ferragina, Mark Sanderson
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 [contents] - 2005
- [j24]Paolo Ferragina
Indexing compressed text. J. ACM 52(4): 552-581 (2005) - [j23]Paolo Ferragina
Boosting textual compression in optimal linear time. J. ACM 52(4): 688-713 (2005) - [c38]Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro:
Cache-Oblivious Comparison-Based Algorithms on Multisets. ESA 2005: 305-316 - [c37]Paolo Ferragina
Structuring labeled trees for optimal succinctness, and beyond. FOCS 2005: 184-196 - [c36]Paolo Ferragina
A personalized search engine based on web-snippet hierarchical clustering. WWW (Special interest tracks and posters) 2005: 801-810 - 2004
- [j22]Giovanni Manzini
Engineering a Lightweight Suffix Array Construction Algorithm. Algorithmica 40(1): 33-50 (2004) - [c35]Paolo Ferragina
The Anatomy of a Hierarchical Clustering Engine for Web-page, News and Book Snippets. ICDM 2004: 395-398 - [c34]Paolo Ferragina, Antonio Gulli
The Anatomy of SnakeT: A Hierarchical Clustering Engine for Web-Page Snippets. PKDD 2004: 506-508 - [c33]Paolo Ferragina, Antonio Gulli
Experimenting SnakeT: A Hierarchical Clustering Engine for Web-Page Snippets. PKDD 2004: 543-545 - [c32]Paolo Ferragina, Giovanni Manzini:
Compression boosting in optimal linear time using the Burrows-Wheeler Transform. SODA 2004: 655-663 - [c31]Paolo Ferragina
An Alphabet-Friendly FM-Index. SPIRE 2004: 150-160 - 2003
- [j21]Nadia Pisanti
PaTre: A Method for Paralogy Trees Construction. J. Comput. Biol. 10(5): 791-802 (2003) - [j20]Paolo Ferragina
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) - [c30]Giovanni Manzini, Paolo Ferragina:
Engineering a Lightweight Suffix Array Construction Algorithm. ESA 2002: 698-710 - [c29]Valentina Ciriani
Static Optimality Theorem for External Memory String Access. FOCS 2002: 219-227 - 2001
- [j18]Andreas Crauser, Paolo Ferragina
Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. Int. J. Comput. Geom. Appl. 11(3): 305-337 (2001) - [j17]Paolo Ferragina
An experimental study of a compressed index. Inf. Sci. 135(1-2): 13-28 (2001) - [c28]Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava:
Two-dimensional Substring Indexing. PODS 2001 - [c27]Paolo Ferragina, Giovanni Manzini:
An experimental study of an opportunistic index. SODA 2001: 269-278 - 2000
- [j16]Martin Farach-Colton
On the sorting-complexity of suffix tree construction. J. ACM 47(6): 987-1011 (2000) - [j15]Klaus Brengel, Andreas Crauser, Paolo Ferragina
An Experimental Study of Priority Queues in External Memory. ACM J. Exp. Algorithmics 5: 17 (2000) - [c26]Paolo Ferragina, Giovanni Manzini:
Opportunistic Data Structures with Applications. FOCS 2000: 390-398
1990 – 1999
- 1999
- [j14]Paolo Ferragina
String Search in Coarse-Grained Parallel Computers. Algorithmica 24(3-4): 177-194 (1999) - [j13]Paolo Ferragina
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
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 Process. Lett. 9(1): 111-122 (1999) - [c25]Andreas Crauser, Paolo Ferragina
On Constructing Suffix Arrays in External Memory. ESA 1999: 224-235 - [c24]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 - [c23]Paolo Ferragina, S. Muthukrishnan, Mark de Berg:
Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. STOC 1999: 483-491 - [c22]Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer:
An Experimental Study of Priority Queues in External Memory. WAE 1999: 346-360 - 1998
- [j10]Paolo Ferragina
Dynamic Dictionary Matching in External Memory. Inf. Comput. 146(2): 85-99 (1998) - [j9]Paolo Ferragina
Optimal On-Line Search and Sublinear Time Update in String Matching. SIAM J. Comput. 27(3): 713-736 (1998) - [j8]Paolo Ferragina
On Updating Suffix Tree Labels. Theor. Comput. Sci. 201(1-2): 249-262 (1998) - [c21]Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos:
Randomized External-Memory Algorithms for Some Geometric Problems. SCG 1998: 259-268 - [c20]Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos:
I/O-optimal computation of segment intersections. External Memory Algorithms 1998: 131-138 - [c19]Martin Farach, Paolo Ferragina, S. Muthukrishnan:
Overcoming the Memory Bottleneck in Suffix Tree Construction. FOCS 1998: 174-185 - 1997
- [j7]Paolo Ferragina
Dynamic Text Indexing under String Updates. J. Algorithms 22(2): 296-328 (1997) - [c18]Paolo Ferragina
A Note on Updating Suffix Tree Labels. CIAC 1997: 181-192 - [c17]Paolo Ferragina, Fabrizio Luccio:
Multi-string search in BSP. SEQUENCES 1997: 240-252 - [c16]Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter:
Sequence sorting in secondary storage. SEQUENCES 1997: 329-346 - [c15]Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter:
On Sorting Strings in External Memory (Extended Abstract). STOC 1997: 540-548 - [c14]Artur Czumaj, Paolo Ferragina, Leszek Gasieniec, S. Muthukrishnan, Jesper Larsson Träff:
The Architecture of a Software Library for String Processing. WAE 1997: 166-176 - 1996
- [j6]Paolo Ferragina
Three Techniques for Parallel Maintenance of a Minimum Spanning Tree under Batch of Updates. Parallel Process. Lett. 6(2): 213-222 (1996) - [c13]Paolo Ferragina
Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract). ESA 1996: 107-120 - [c12]Paolo Ferragina
On the Parallel Dynamic Dictionary Matching Problem: New Results with Applications. ESA 1996: 261-275 - [c11]Paolo Ferragina:
A Simple Parallel Dictionary Matching Algorithm. Euro-Par, Vol. I 1996: 781-788 - [c10]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 Distributed Comput. 31(2): 181-189 (1995) - [j4]Cesare Calabró, Paolo Ferragina
Recognition of hand-written rotated digits by neural networks. Mach. Vis. Appl. 8(5): 351-357 (1995) - [c9]Paolo Ferragina, Roberto Grossi:
Optimal On-Line Search and Sublinear Time Update in String Matching. FOCS 1995: 604-612 - [c8]Paolo Ferragina:
An EREW PRAM fully-dynamic algorithm for MST. IPPS 1995: 93-100 - [c7]Paolo Ferragina, Roberto Grossi:
Fast Incremental Text Editing. SODA 1995: 531-540 - [c6]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) - [c5]Sajal K. Das, Paolo Ferragina:
An o(n) Work EREW Parallel Algorithm for Updating MST. ESA 1994: 331-342 - [c4]Paolo Ferragina:
Incremental Text Editing: A New Data Structure. ESA 1994: 495-507 - [c3]Paolo Ferragina, Fabrizio Luccio:
Batch Dynamic Algorithms for Two Graph Problems. PARLE 1994: 713-724 - [c2]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
Recognition by constructive neural algorithms. Pattern Recognit. Lett. 14(12): 997-1007 (1993) - [c1]P. Bianchini, Paolo Ferragina, Mario Notturno Granieri, L. Tarricone:
New techniques for speech understanding. ICASSP (2) 1993: 127-130 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 19:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: