Paolo Ferragina

According to our database1, Paolo Ferragina authored at least 131 papers between 1992 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
On Computing Entity Relatedness in Wikipedia, with Applications.
Knowl.-Based Syst., 2020

2019
SMAPH: A Piggyback Approach for Entity-Linking in Web Queries.
ACM Trans. Inf. Syst., 2019

Brotli: A General-Purpose Data Compressor.
ACM Trans. Inf. Syst., 2019

PlayeRank: Data-driven Performance Evaluation and Player Ranking in Soccer via a Machine Learning Approach.
ACM TIST, 2019

Bicriteria Data Compression.
SIAM J. Comput., 2019

Wiser: A semantic approach for expert finding in academia based on entity linking.
Inf. Syst., 2019

The PGM-index: a multicriteria, compressed and learned approach to data indexing.
CoRR, 2019

Superseding traditional indexes by orchestrating learning and geometry.
CoRR, 2019

Swat: A system for detecting salient Wikipedia entities in texts.
Computational Intelligence, 2019

2018
Indexing Compressed Text.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Text Compression.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

PlayeRank: Multi-dimensional and role-aware rating of soccer player performance.
CoRR, 2018

Computational Thinking - First Algorithms, Then Code
Springer, ISBN: 978-3-319-97939-7, 2018

2017
Document Aboutness via Sophisticated Syntactic and Semantic Features.
Proceedings of the Natural Language Processing and Information Systems, 2017

A Two-Stage Framework for Computing Entity Relatedness in Wikipedia.
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

2016
Indexed Two-Dimensional String Matching.
Encyclopedia of Algorithms, 2016

Compressing and Indexing Structured Text.
Encyclopedia of Algorithms, 2016

Burrows-Wheeler Transform.
Encyclopedia of Algorithms, 2016

Boosting Textual Compression.
Encyclopedia of Algorithms, 2016

Suffix Tree Construction in Hierarchical Memory.
Encyclopedia of Algorithms, 2016

Compressed Cache-Oblivious String B-Tree.
ACM Trans. Algorithms, 2016

A Piggyback System for Joint Entity Mention Detection and Linking in Web Queries.
Proceedings of the 25th International Conference on World Wide Web, 2016

2015

Compressed Indexes for String Searching in Labeled Graphs.
Proceedings of the 24th International Conference on World Wide Web, 2015

On Analyzing Hashtags in Twitter.
Proceedings of the Ninth International Conference on Web and Social Media, 2015

2014
Guest Editorial: Selected Papers of European Symposium of Algorithms.
Algorithmica, 2014

From TagME to WAT: a new entity annotator.
Proceedings of the ERD'14, 2014

The SMAPH system for query entity recognition and disambiguation.
Proceedings of the ERD'14, 2014

Bicriteria Data Compression: Efficient and Usable.
Proceedings of the Algorithms - ESA 2014, 2014

2013
On the weak prefix-search problem.
Theor. Comput. Sci., 2013

On the Bit-Complexity of Lempel-Ziv Compression.
SIAM J. Comput., 2013

Distribution-Aware Compressed Full-Text Indexes.
Algorithmica, 2013

A framework for benchmarking entity-annotation systems.
Proceedings of the 22nd International World Wide Web Conference, 2013

Web Search.
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012
Fast and Accurate Annotation of Short Texts with Wikipedia Pages.
IEEE Software, 2012

Lightweight Data Indexing and Compression in External Memory.
Algorithmica, 2012

Topical clustering of search results.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

Classification of Short Texts by Deploying Topical Annotations.
Proceedings of the Advances in Information Retrieval, 2012

2011
On Optimally Partitioning a Text to Improve Its Compression.
Algorithmica, 2011

Beyond the bag-of-words paradigm to enhance information retrieval applications.
Proceedings of the Fourth International Conference on Similarity Search and Applications, 2011

First Steps Beyond the Bag-Of-Words Representation of Short Texts.
Proceedings of the 2nd Italian Information Retrieval (IIR) Workshop, 2011

2010
On compact representations of All-Pairs-Shortest-Path-Distance matrices.
Theor. Comput. Sci., 2010

The compressed permuterm index.
ACM Trans. Algorithms, 2010

On compressing the textual web.
Proceedings of the Third International Conference on Web Search and Web Data Mining, 2010

Information processing at work: On energy-aware algorithm design.
Proceedings of the International Green Computing Conference 2010, 2010

Data Structures: Time, I/Os, Entropy, Joules!
Proceedings of the Algorithms, 2010

TAGME: on-the-fly annotation of short text fragments (by wikipedia entities).
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009
Indexing Compressed Text.
Proceedings of the Encyclopedia of Database Systems, 2009

Text Compression.
Proceedings of the Encyclopedia of Database Systems, 2009

Foreword.
Theor. Comput. Sci., 2009

Compressing and indexing labeled trees, with applications.
J. ACM, 2009

The myriad virtues of Wavelet Trees.
Inf. Comput., 2009

2008
Two-Dimensional Pattern Indexing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Tree Compression and Indexing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Burrows-Wheeler Transform.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Boosting Textual Compression.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Suffix Tree Construction in Hierarchical Memory.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

A personalized search engine based on Web-snippet hierarchical clustering.
Softw., Pract. Exper., 2008

Compressed text indexes: From theory to practice.
ACM Journal of Experimental Algorithmics, 2008

Preface.
Inf. Retr., 2008

Bit-Optimal Lempel-Ziv compression
CoRR, 2008

String algorithms and data structures
CoRR, 2008

On searching compressed string collections cache-obliviously.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

Query-log mining for detecting spam.
Proceedings of the AIRWeb 2008, 2008

2007
A simple storage scheme for strings achieving entropy bounds.
Theor. Comput. Sci., 2007

Foreword.
Theor. Comput. Sci., 2007

Compressed representations of sequences and full-text indexes.
ACM Trans. Algorithms, 2007

A data structure for a sequence of string accesses in external memory.
ACM Trans. Algorithms, 2007

Compressed Text Indexes:From Theory to Practice!
CoRR, 2007

Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment.
BMC Bioinformatics, 2007

The BioPrompt-box: an ontology-based clustering tool for searching in biological databases.
BMC Bioinformatics, 2007

Suffix Arrays on Words.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Foreword.
Theory Comput. Syst., 2006

Compressing and searching XML data via two zips.
Proceedings of the 15th international conference on World Wide Web, 2006

The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression.
Proceedings of the Algorithms, 2006

2005
Indexing compressed text.
J. ACM, 2005

Boosting textual compression in optimal linear time.
J. ACM, 2005

Structuring labeled trees for optimal succinctness, and beyond.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Cache-Oblivious Comparison-Based Algorithms on Multisets.
Proceedings of the Algorithms, 2005

2004
Engineering a Lightweight Suffix Array Construction Algorithm.
Algorithmica, 2004

An Alphabet-Friendly FM-Index.
Proceedings of the String Processing and Information Retrieval, 2004

Compression boosting in optimal linear time using the Burrows-Wheeler Transform.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Experimenting SnakeT: A Hierarchical Clustering Engine for Web-Page Snippets.
Proceedings of the Knowledge Discovery in Databases: PKDD 2004, 2004

The Anatomy of SnakeT: A Hierarchical Clustering Engine for Web-Page Snippets.
Proceedings of the Knowledge Discovery in Databases: PKDD 2004, 2004

The Anatomy of a Hierarchical Clustering Engine for Web-page, News and Book Snippets.
Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 2004

2003
Two-dimensional substring indexing.
J. Comput. Syst. Sci., 2003

PaTre: A Method for Paralogy Trees Construction.
Journal of Computational Biology, 2003

2002
A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory.
Algorithmica, 2002

Static Optimality Theorem for External Memory String Access.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
An experimental study of a compressed index.
Inf. Sci., 2001

Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems.
Int. J. Comput. Geometry Appl., 2001

An experimental study of an opportunistic index.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
An Experimental Study of Priority Queues in External Memory.
ACM Journal of Experimental Algorithmics, 2000

On the sorting-complexity of suffix tree construction.
J. ACM, 2000

Opportunistic Data Structures with Applications.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
An EREW PRAM Algorithm for Updating Minimum Spanning Trees.
Parallel Processing Letters, 1999

Improved Dynamic Text Indexing.
J. Algorithms, 1999

The String B-tree: A New Data Structure for String Search in External Memory and Its Applications.
J. ACM, 1999

String Search in Coarse-Grained Parallel Computers.
Algorithmica, 1999

Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

q-gram based database searching using a suffix array (QUASAR).
Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

On Constructing Suffix Arrays in External Memory.
Proceedings of the Algorithms, 1999

1998
On Updating Suffix Tree Labels.
Theor. Comput. Sci., 1998

Optimal On-Line Search and Sublinear Time Update in String Matching.
SIAM J. Comput., 1998

Dynamic Dictionary Matching in External Memory.
Inf. Comput., 1998

Overcoming the Memory Bottleneck in Suffix Tree Construction.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

I/O-optimal computation of segment intersections.
Proceedings of the External Memory Algorithms, 1998

Randomized External-Memory Algorithms for Some Geometric Problems.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
Dynamic Text Indexing under String Updates.
J. Algorithms, 1997

On Sorting Strings in External Memory (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Multi-string search in BSP.
Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Sequence sorting in secondary storage.
Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

A Note on Updating Suffix Tree Labels.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
Three Techniques for Parallel Maintenance of a Minimum Spanning Tree under Batch of Updates.
Parallel Processing Letters, 1996

Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

A Simple Parallel Dictionary Matching Algorithm.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract).
Proceedings of the Algorithms, 1996

On the Parallel Dynamic Dictionary Matching Problem: New Results with Applications.
Proceedings of the Algorithms, 1996

1995
Recognition of hand-written rotated digits by neural networks.
Mach. Vis. Appl., 1995

A Technique to Speed Up Parallel Fully Dynamic Algorithms for MST.
J. Parallel Distrib. Comput., 1995

A fully-dynamic data structure for external substring search (Extended Abstract).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Fast Incremental Text Editing.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

An EREW PRAM fully-dynamic algorithm for MST.
Proceedings of IPPS '95, 1995

1994
Static and Dynamic Parallel Computation of Connected Components.
Inf. Process. Lett., 1994

Trade-off Between Computational Power and Common Knowledge in Anonymous Rings.
Proceedings of the Structural Information and Communication Complexity, 1994

Batch Dynamic Algorithms for Two Graph Problems.
Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994

Incremental Text Editing: A New Data Structure.
Proceedings of the Algorithms, 1994

An o(n) Work EREW Parallel Algorithm for Updating MST.
Proceedings of the Algorithms, 1994

1993
Recognition by constructive neural algorithms.
Pattern Recognition Letters, 1993

New techniques for speech understanding.
Proceedings of the IEEE International Conference on Acoustics, 1993

1992
The Generalization of a Constructive Algorithm in Pattern Classification Problems.
Int. J. Neural Syst., 1992


  Loading...