Rossano Venturini

According to our database1, Rossano Venturini authored at least 55 papers between 2007 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Inverted Index Compression.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Parallel Traversal of Large Ensembles of Decision Trees.
IEEE Trans. Parallel Distrib. Syst., 2019

Handling Massive N-Gram Datasets Efficiently.
ACM Trans. Inf. Syst., 2019

Fast Approximate Filtering of Search Results Sorted by Attribute.
Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, 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

Efficient and Effective Query Expansion for Web Search.
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

2017
Clustered Elias-Fano Indexes.
ACM Trans. Inf. Syst., 2017

Efficient Data Structures for Massive N-Gram Datasets.
Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2017

Faster BlockMax WAND with Variable-sized Blocks.
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.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2017

Multicore/Manycore Parallel Traversal of Large Forests of Regression Trees.
Proceedings of the 2017 International Conference on High Performance Computing & Simulation, 2017

An Encoding for Order-Preserving Matching.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Dynamic Elias-Fano Representation.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
Fast Ranking with Additive Ensembles of Oblivious and Non-Oblivious Regression Trees.
ACM Trans. Inf. Syst., 2016

Fast Traversal of Large Ensembles of Regression Trees.
ERCIM News, 2016

Compressed String Dictionary Search with Edit Distance One.
Algorithmica, 2016

Exploiting CPU SIMD Extensions to Speed-up Document Scoring with Tree Ensembles.
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.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Fast and Compact Hamming Distance Index.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Ranking Documents Effciently with QuickScorer.
Proceedings of the 24th Italian Symposium on Advanced Database Systems, 2016

Speeding-up Document Scoring with Tree Ensembles using CPU SIMD Extensions.
Proceedings of the 7th Italian Information Retrieval Workshop, 2016

GPU-based Parallelization of QuickScorer to Speed-up Document Ranking with Tree Ensembles.
Proceedings of the 7th Italian Information Retrieval Workshop, 2016

Fast and Compact Hamming Distance index.
Proceedings of the 7th Italian Information Retrieval Workshop, 2016

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

Optimal Space-time Tradeoffs for Inverted Indexes.
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.
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.
Atlantis Studies in Computing 4, Atlantis Press, ISBN: 978-94-6239-033-1, 2014

Bicriteria data compression.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Partitioned Elias-Fano indexes.
Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2014

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

Cache-Oblivious Peeling of Random Hypergraphs.
Proceedings of the Data Compression Conference, 2014

Recommender Systems.
Proceedings of the Mining User Generated Content., 2014

2013
Compressed static functions with applications.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Dynamic Compressed Strings with Random Access.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Compressed Cache-Oblivious String B-tree.
Proceedings of the Algorithms - ESA 2013, 2013

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

2012
Cite-as-you-write.
ERCIM News, 2012

Efficient query recommendations in the long tail via center-piece subgraphs.
Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

How Random Walks Can Help Tourism.
Proceedings of the Advances in Information Retrieval, 2012

Compressed String Dictionary Look-Up with Edit Distance One.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Making your interests follow you on twitter.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Recommendations for the long tail by term-query graph.
Proceedings of the 20th International Conference on World Wide Web, 2011

Space-efficient substring occurrence estimation.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Distribution-Aware Compressed Full-Text Indexes.
Proceedings of the Algorithms - ESA 2011, 2011

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

The compressed permuterm index.
ACM Trans. Algorithms, 2010

VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

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

On the bit-complexity of Lempel-Ziv compression.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

On Optimally Partitioning a Text to Improve Its Compression.
Proceedings of the Algorithms, 2009

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

On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007
A simple storage scheme for strings achieving entropy bounds.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Compressed permuterm index.
Proceedings of the SIGIR 2007: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007


  Loading...