Rossano Venturini

Cosimo Rulli

Proceedings of the Advances in Information Retrieval, 2024

2023

An Optimal Algorithm for Finding Champions in Tournament Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., October, 2023

Distilled Neural Networks for Efficient Learning to Rank.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., May, 2023

Neural Network Compression using Binarization and Few Full-Precision Weights.

[BibT_eX]

[DOI]

CoRR, 2023

Faster Wavelet Trees with Quad Vectors.

[BibT_eX]

[DOI]

Matteo Ceregini

Florian Kurpicz

CoRR, 2023

2022

Fast Filtering of Search Results Sorted by Attribute.

[BibT_eX]

[DOI]

Roberto Trani

ACM Trans. Inf. Syst., 2022

2021

Compressed Indexes for Fast Search of Semantic Data.

[BibT_eX]

[DOI]

Raffaele Perego

IEEE Trans. Knowl. Data Eng., 2021

Adaptive learning of compressible strings.

[BibT_eX]

[DOI]

Gabriele Fici

Nicola Prezza

Theor. Comput. Sci., 2021

Practical trade-offs for the prefix-sum problem.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2021

Techniques for Inverted Index Compression.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2021

TSXor: A Simple Time Series Compression Algorithm.

[BibT_eX]

[DOI]

Andrea Bruno

Roberto Trani

Proceedings of the String Processing and Information Retrieval, 2021

Compressed Indexes for Fast Search of Semantic Data (Extended Abstract).

[BibT_eX]

[DOI]

Raffaele Perego

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Compressed Weighted de Bruijn Graphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

On Optimally Partitioning Variable-Byte Codes.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2020

Substring Query Complexity of String Reconstruction.

[BibT_eX]

[DOI]

Gabriele Fici

Nicola Prezza

CoRR, 2020

Succinct Dynamic Ordered Sets with Random Access.

[BibT_eX]

[DOI]

CoRR, 2020

Efficient and Effective Query Auto-Completion.

[BibT_eX]

[DOI]

Simon Gog

Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, 2020

2019

Inverted Index Compression.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Big Data Technologies., 2019

Parallel Traversal of Large Ensembles of Decision Trees.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2019

Handling Massive <i>N</i>-Gram Datasets Efficiently.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., 2019

Bicriteria Data Compression.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

A New Linear-Time Algorithm for Centroid Decomposition.

[BibT_eX]

[DOI]

Davide Della Giustina

Nicola Prezza

Proceedings of the String Processing and Information Retrieval, 2019

An Optimal Algorithm to Find Champions of Tournament Graphs.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

Fast Approximate Filtering of Search Results Sorted by Attribute.

[BibT_eX]

[DOI]

Roberto Trani

Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2019

2018

Indexing Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Text Compression.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Handling Massive N-Gram Datasets Efficiently.

[BibT_eX]

[DOI]

CoRR, 2018

Variable-Byte Encoding is Now Space-Efficient Too.

[BibT_eX]

[DOI]

CoRR, 2018

Efficient and Effective Query Expansion for Web Search.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

2017

Clustered Elias-Fano Indexes.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., 2017

Efficient Data Structures for Massive <i>N</i>-Gram Datasets.

[BibT_eX]

[DOI]

Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2017

Faster BlockMax WAND with Variable-sized Blocks.

[BibT_eX]

[DOI]

Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2017

QuickScorer: Efficient Traversal of Large Ensembles of Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2017

Multicore/Manycore Parallel Traversal of Large Forests of Regression Trees.

[BibT_eX]

[DOI]

Proceedings of the 2017 International Conference on High Performance Computing & Simulation, 2017

An Encoding for Order-Preserving Matching.

[BibT_eX]

[DOI]

Travis Gagie

Giovanni Manzini

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Dynamic Elias-Fano Representation.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Fast Ranking with Additive Ensembles of Oblivious and Non-Oblivious Regression Trees.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., 2016

Compressed Cache-Oblivious String B-Tree.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Fast Traversal of Large Ensembles of Regression Trees.

[BibT_eX]

[DOI]

ERCIM News, 2016

Space-Efficient Substring Occurrence Estimation.

[BibT_eX]

[DOI]

Alessio Orlandi

Algorithmica, 2016

Compressed String Dictionary Search with Edit Distance One.

[BibT_eX]

[DOI]

Djamal Belazzougui

Algorithmica, 2016

Exploiting CPU SIMD Extensions to Speed-up Document Scoring with Tree Ensembles.

[BibT_eX]

[DOI]

Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Succinct Data Structures in Information Retrieval: Theory and Practice.

[BibT_eX]

[DOI]

Simon Gog

Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Ranking Documents Effciently with QuickScorer.

[BibT_eX]

Proceedings of the 24th Italian Symposium on Advanced Database Systems, 2016

Speeding-up Document Scoring with Tree Ensembles using CPU SIMD Extensions.

[BibT_eX]

[DOI]

Proceedings of the 7th Italian Information Retrieval Workshop, 2016

GPU-based Parallelization of QuickScorer to Speed-up Document Ranking with Tree Ensembles.

[BibT_eX]

[DOI]

Proceedings of the 7th Italian Information Retrieval Workshop, 2016

Fast and Compact Hamming Distance index.

[BibT_eX]

[DOI]

Simon Gog

Proceedings of the 7th Italian Information Retrieval Workshop, 2016

2015

Compressed Indexes for String Searching in Labeled Graphs.

[BibT_eX]

[DOI]

Francesco Piccinno

Proceedings of the 24th International Conference on World Wide Web, 2015

Optimal Space-time Tradeoffs for Inverted Indexes.

[BibT_eX]

[DOI]

Giuseppe Ottaviano

Nicola Tonellotto

Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

QuickScorer: A Fast Algorithm to Rank Documents with Additive Ensembles of Regression Trees.

[BibT_eX]

[DOI]

Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015

2014

Compressed Data Structures for Strings - On Searching and Extracting Strings from Compressed Textual Data.

[BibT_eX]

[DOI]

Atlantis Studies in Computing 4, Atlantis Press, ISBN: 978-94-6239-033-1, 2014

Partitioned Elias-Fano indexes.

[BibT_eX]

[DOI]

Giuseppe Ottaviano

Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2014

Bicriteria Data Compression: Efficient and Usable.

[BibT_eX]

[DOI]

Andrea Farruggia

Proceedings of the Algorithms - ESA 2014, 2014

Cache-Oblivious Peeling of Random Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2014

Recommender Systems.

[BibT_eX]

[DOI]

Claudio Lucchese

Cristina Ioana Muntean

Proceedings of the Mining User Generated Content., 2014

2013

On the Bit-Complexity of Lempel-Ziv Compression.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Distribution-Aware Compressed Full-Text Indexes.

[BibT_eX]

[DOI]

Jouni Sirén

Algorithmica, 2013

Compressed static functions with applications.

[BibT_eX]

[DOI]

Djamal Belazzougui

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Dynamic Compressed Strings with Random Access.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Web Search.

[BibT_eX]

[DOI]

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

2012

Cite-as-you-write.

[BibT_eX]

[DOI]

ERCIM News, 2012

Efficient query recommendations in the long tail via center-piece subgraphs.

[BibT_eX]

[DOI]

Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

How Random Walks Can Help Tourism.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information Retrieval, 2012

Compressed String Dictionary Look-Up with Edit Distance One.

[BibT_eX]

[DOI]

Djamal Belazzougui

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Making your interests follow you on twitter.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011

On Optimally Partitioning a Text to Improve Its Compression.

[BibT_eX]

[DOI]

Algorithmica, 2011

Recommendations for the long tail by term-query graph.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on World Wide Web, 2011

2010

On searching and extracting strings from compressed textual data.

[BibT_eX]

[DOI]

PhD thesis, 2010

On compact representations of All-Pairs-Shortest-Path-Distance matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

The compressed permuterm index.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming.

[BibT_eX]

[DOI]

Fabrizio Silvestri

Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009

Indexing Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, 2009

2008

Compressed text indexes: From theory to practice.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2008

Bit-Optimal Lempel-Ziv compression

[BibT_eX]

[DOI]

CoRR, 2008

On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007

A simple storage scheme for strings achieving entropy bounds.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Compressed Text Indexes:From Theory to Practice!

[BibT_eX]

[DOI]

CoRR, 2007

Searching for a dangerous host: randomized vs. deterministic

[BibT_eX]

[DOI]