default search action
Rossano Venturini
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
- [j24]Franco Maria Nardini, Roberto Trani, Rossano Venturini:
Learning bivariate scoring functions for ranking. Discov. Comput. 27(1): 33 (2024) - [c51]Sebastian Bruch
, Franco Maria Nardini
Pairing Clustered Inverted Indexes with κ-NN Graphs for Fast Approximate Retrieval over Learned Sparse Representations. CIKM 2024: 3642-3646 - [c50]Matteo Ceregini, Florian Kurpicz
Faster Wavelet Tree Queries. DCC 2024: 223-232 - [c49]Franco Maria Nardini
Efficient Multi-vector Dense Retrieval with Bit Vectors. ECIR (2) 2024: 3-17 - [c48]Franco Maria Nardini, Cosimo Rulli, Salvatore Trani, Rossano Venturini:
Distilled Neural Networks for Efficient Learning to Rank: (Extended Abstract). ICDE 2024: 5693-5694 - [c47]Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli, Rossano Venturini:
Seismic: Efficient and Effective Retrieval over Learned Sparse Representation. IIR 2024: 103-106 - [c46]Franco Maria Nardini, Cosimo Rulli, Rossano Venturini:
Efficient and Effective Multi-Vector Dense Retrieval with EMVB. SEBD 2024: 281-289 - [c45]Sebastian Bruch
Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations. SIGIR 2024: 152-162 - [i23]Franco Maria Nardini, Cosimo Rulli, Rossano Venturini:
Efficient Multi-Vector Dense Retrieval Using Bit Vectors. CoRR abs/2404.02805 (2024) - [i22]Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli, Rossano Venturini:
Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations. CoRR abs/2404.18812 (2024) - [i21]Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli, Rossano Venturini:
Pairing Clustered Inverted Indexes with kNN Graphs for Fast Approximate Retrieval over Learned Sparse Representations. CoRR abs/2408.04443 (2024) - 2023
- [j23]Franco Maria Nardini
Distilled Neural Networks for Efficient Learning to Rank. IEEE Trans. Knowl. Data Eng. 35(5): 4695-4712 (2023) - [j22]Lorenzo Beretta
An Optimal Algorithm for Finding Champions in Tournament Graphs. IEEE Trans. Knowl. Data Eng. 35(10): 10197-10209 (2023) - [e2]Franco Maria Nardini
String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings. Lecture Notes in Computer Science 14240, Springer 2023, ISBN 978-3-031-43979-7 [contents] - [i20]Matteo Ceregini, Florian Kurpicz, Rossano Venturini:
Faster Wavelet Trees with Quad Vectors. CoRR abs/2302.09239 (2023) - [i19]Franco Maria Nardini, Cosimo Rulli, Salvatore Trani, Rossano Venturini:
Neural Network Compression using Binarization and Few Full-Precision Weights. CoRR abs/2306.08960 (2023) - 2022
- [j21]Franco Maria Nardini
Fast Filtering of Search Results Sorted by Attribute. ACM Trans. Inf. Syst. 40(2): 40:1-40:24 (2022) - [i18]Franco Maria Nardini, Cosimo Rulli, Salvatore Trani, Rossano Venturini:
Distilled Neural Networks for Efficient Learning to Rank. CoRR abs/2202.10728 (2022) - 2021
- [j20]Giulio Ermanno Pibiri
Techniques for Inverted Index Compression. ACM Comput. Surv. 53(6): 125:1-125:36 (2021) - [j19]Giulio Ermanno Pibiri
Practical trade-offs for the prefix-sum problem. Softw. Pract. Exp. 51(5): 921-949 (2021) - [j18]Gabriele Fici
Adaptive learning of compressible strings. Theor. Comput. Sci. 896: 46-52 (2021) - [j17]Raffaele Perego
Compressed Indexes for Fast Search of Semantic Data. IEEE Trans. Knowl. Data Eng. 33(9): 3187-3198 (2021) - [c44]Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini:
Compressed Weighted de Bruijn Graphs. CPM 2021: 16:1-16:16 - [c43]Raffaele Perego
Compressed Indexes for Fast Search of Semantic Data (Extended Abstract). ICDE 2021: 2325-2326 - [c42]Andrea Bruno, Franco Maria Nardini
TSXor: A Simple Time Series Compression Algorithm. SPIRE 2021: 217-223 - [i17]Lorenzo Beretta, Franco Maria Nardini, Roberto Trani, Rossano Venturini:
An Optimal Algorithm for Finding Champions in Tournament Graphs. CoRR abs/2111.13621 (2021) - 2020
- [j16]Giulio Ermanno Pibiri
On Optimally Partitioning Variable-Byte Codes. IEEE Trans. Knowl. Data Eng. 32(9): 1812-1823 (2020) - [c41]Simon Gog, Giulio Ermanno Pibiri
Efficient and Effective Query Auto-Completion. SIGIR 2020: 2271-2280 - [i16]Giulio Ermanno Pibiri, Rossano Venturini:
Succinct Dynamic Ordered Sets with Random Access. CoRR abs/2003.11835 (2020) - [i15]Simon Gog, Giulio Ermanno Pibiri, Rossano Venturini:
Efficient and Effective Query Auto-Completion. CoRR abs/2005.06213 (2020) - [i14]Giulio Ermanno Pibiri, Rossano Venturini:
Practical Trade-Offs for the Prefix-Sum Problem. CoRR abs/2006.14552 (2020) - [i13]Gabriele Fici, Nicola Prezza, Rossano Venturini:
Substring Query Complexity of String Reconstruction. CoRR abs/2011.07143 (2020)
2010 – 2019
- 2019
- [j15]Andrea Farruggia
Bicriteria Data Compression. SIAM J. Comput. 48(5): 1603-1642 (2019) - [j14]Giulio Ermanno Pibiri
Handling Massive N-Gram Datasets Efficiently. ACM Trans. Inf. Syst. 37(2): 25:1-25:41 (2019) - [j13]Francesco Lettich
Parallel Traversal of Large Ensembles of Decision Trees. IEEE Trans. Parallel Distributed Syst. 30(9): 2075-2089 (2019) - [c40]Franco Maria Nardini
Fast Approximate Filtering of Search Results Sorted by Attribute. SIGIR 2019: 815-824 - [c39]Lorenzo Beretta
An Optimal Algorithm to Find Champions of Tournament Graphs. SPIRE 2019: 267-273 - [c38]Davide Della Giustina
A New Linear-Time Algorithm for Centroid Decomposition. SPIRE 2019: 274-282 - [r4]Giulio Ermanno Pibiri
Inverted Index Compression. Encyclopedia of Big Data Technologies 2019 - [i12]Raffaele Perego, Giulio Ermanno Pibiri, Rossano Venturini:
Compressed Indexes for Fast Search of Semantic Data. CoRR abs/1904.07619 (2019) - [i11]Giulio Ermanno Pibiri, Rossano Venturini:
Techniques for Inverted Index Compression. CoRR abs/1908.10598 (2019) - 2018
- [c37]Claudio Lucchese, Franco Maria Nardini
Efficient and Effective Query Expansion for Web Search. CIKM 2018: 1551-1554 - [r3]Paolo Ferragina, Igor Nitto, Rossano Venturini:
Text Compression. Encyclopedia of Database Systems (2nd ed.) 2018 - [r2]Paolo Ferragina, Rossano Venturini:
Indexing Compressed Text. Encyclopedia of Database Systems (2nd ed.) 2018 - [i10]Giulio Ermanno Pibiri
Variable-Byte Encoding is Now Space-Efficient Too. CoRR abs/1804.10949 (2018) - [i9]Giulio Ermanno Pibiri, Rossano Venturini:
Handling Massive N-Gram Datasets Efficiently. CoRR abs/1806.09447 (2018) - 2017
- [j12]Giulio Ermanno Pibiri
Clustered Elias-Fano Indexes. ACM Trans. Inf. Syst. 36(1): 2:1-2:33 (2017) - [c36]Giulio Ermanno Pibiri
Dynamic Elias-Fano Representation. CPM 2017: 30:1-30:14 - [c35]Travis Gagie
An Encoding for Order-Preserving Matching. ESA 2017: 38:1-38:15 - [c34]Francesco Lettich, Claudio Lucchese, Franco Maria Nardini
Multicore/Manycore Parallel Traversal of Large Forests of Regression Trees. HPCS 2017: 915 - [c33]Claudio Lucchese, Franco Maria Nardini
QuickScorer: Efficient Traversal of Large Ensembles of Decision Trees. ECML/PKDD (3) 2017: 383-387 - [c32]Giulio Ermanno Pibiri
Efficient Data Structures for Massive N-Gram Datasets. SIGIR 2017: 615-624 - [c31]Antonio Mallia
Faster BlockMax WAND with Variable-sized Blocks. SIGIR 2017: 625-634 - [e1]Gabriele Fici, Marinella Sciortino, Rossano Venturini:
String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings. Lecture Notes in Computer Science 10508, Springer 2017, ISBN 978-3-319-67427-8 [contents] - 2016
- [j11]Alessio Orlandi, Rossano Venturini
Space-Efficient Substring Occurrence Estimation. Algorithmica 74(1): 65-90 (2016) - [j10]Djamal Belazzougui, Rossano Venturini
Compressed String Dictionary Search with Edit Distance One. Algorithmica 74(3): 1099-1122 (2016) - [j9]Paolo Ferragina
Compressed Cache-Oblivious String B-Tree. ACM Trans. Algorithms 12(4): 52:1-52:17 (2016) - [j8]Domenico Dato
Fast Ranking with Additive Ensembles of Oblivious and Non-Oblivious Regression Trees. ACM Trans. Inf. Syst. 35(2): 15:1-15:31 (2016) - [c30]Simon Gog, Rossano Venturini:
Fast and Compact Hamming Distance index. IIR 2016 - [c29]Francesco Lettich, Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando, Raffaele Perego, Nicola Tonellotto, Rossano Venturini:
GPU-based Parallelization of QuickScorer to Speed-up Document Ranking with Tree Ensembles. IIR 2016 - [c28]Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando, Raffaele Perego, Nicola Tonellotto, Rossano Venturini:
Speeding-up Document Scoring with Tree Ensembles using CPU SIMD Extensions. IIR 2016 - [c27]Domenico Dato, Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando, Raffaele Perego, Nicola Tonellotto, Rossano Venturini:
Ranking Documents Effciently with QuickScorer. SEBD 2016: 166-173 - [c26]Simon Gog, Rossano Venturini:
Fast and Compact Hamming Distance Index. SIGIR 2016: 285-294 - [c25]Claudio Lucchese, Franco Maria Nardini
Exploiting CPU SIMD Extensions to Speed-up Document Scoring with Tree Ensembles. SIGIR 2016: 833-836 - [c24]Simon Gog, Rossano Venturini:
Succinct Data Structures in Information Retrieval: Theory and Practice. SIGIR 2016: 1231-1233 - [i8]Claudio Lucchese, Franco Maria Nardini, Raffaele Perego, Nicola Tonellotto, Salvatore Orlando, Rossano Venturini:
Fast Traversal of Large Ensembles of Regression Trees. ERCIM News 2016(107) (2016) - 2015
- [c23]Claudio Lucchese, Franco Maria Nardini
QuickScorer: A Fast Algorithm to Rank Documents with Additive Ensembles of Regression Trees. SIGIR 2015: 73-82 - [c22]Giuseppe Ottaviano, Nicola Tonellotto
Optimal Space-time Tradeoffs for Inverted Indexes. WSDM 2015: 47-56 - [c21]Paolo Ferragina
Compressed Indexes for String Searching in Labeled Graphs. WWW 2015: 322-332 - 2014
- [b2]Rossano Venturini
Compressed Data Structures for Strings - On Searching and Extracting Strings from Compressed Textual Data. Atlantis Studies in Computing 4, Atlantis Press 2014, ISBN 978-94-6239-032-4, pp. i-xiv, 1-118 - [c20]Djamal Belazzougui, Paolo Boldi
Cache-Oblivious Peeling of Random Hypergraphs. DCC 2014: 352-361 - [c19]Andrea Farruggia, Paolo Ferragina
Bicriteria Data Compression: Efficient and Usable. ESA 2014: 406-417 - [c18]Giuseppe Ottaviano, Rossano Venturini
Partitioned Elias-Fano indexes. SIGIR 2014: 273-282 - [c17]Andrea Farruggia, Paolo Ferragina, Antonio Frangioni
Bicriteria data compression. SODA 2014: 1582-1595 - [p2]Claudio Lucchese, Cristina Ioana Muntean, Raffaele Perego, Fabrizio Silvestri, Hossein Vahabi, Rossano Venturini:
Recommender Systems. Mining User Generated Content 2014: 287-317 - 2013
- [j7]Paolo Ferragina
Distribution-Aware Compressed Full-Text Indexes. Algorithmica 67(4): 529-546 (2013) - [j6]Paolo Ferragina
On the Bit-Complexity of Lempel-Ziv Compression. SIAM J. Comput. 42(4): 1521-1541 (2013) - [c16]Paolo Ferragina
Compressed Cache-Oblivious String B-tree. ESA 2013: 469-480 - [c15]Roberto Grossi, Rajeev Raman
Dynamic Compressed Strings with Random Access. ICALP (1) 2013: 504-515 - [c14]Djamal Belazzougui, Rossano Venturini:
Compressed static functions with applications. SODA 2013: 229-240 - [p1]Paolo Ferragina
Web Search. The Power of Algorithms 2013: 107-137 - [i7]Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, Rossano Venturini:
Bicriteria data compression. CoRR abs/1307.3872 (2013) - [i6]Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano, Rossano Venturini, Sebastiano Vigna:
Cache-Oblivious Peeling of Random Hypergraphs. CoRR abs/1312.0526 (2013) - 2012
- [c13]Marco Pennacchiotti, Fabrizio Silvestri
Making your interests follow you on twitter. CIKM 2012: 165-174 - [c12]Djamal Belazzougui, Rossano Venturini
Compressed String Dictionary Look-Up with Edit Distance One. CPM 2012: 280-292 - [c11]Claudio Lucchese
How Random Walks Can Help Tourism. ECIR 2012: 195-206 - [c10]Francesco Bonchi, Raffaele Perego
Efficient query recommendations in the long tail via center-piece subgraphs. SIGIR 2012: 345-354 - [i5]Kris Jack, Maurizio Sambati, Fabrizio Silvestri, Salvatore Trani, Rossano Venturini:
Cite-as-you-write. ERCIM News 2012(90) (2012) - 2011
- [j5]Paolo Ferragina
On Optimally Partitioning a Text to Improve Its Compression. Algorithmica 61(1): 51-74 (2011) - [c9]Paolo Ferragina
Distribution-Aware Compressed Full-Text Indexes. ESA 2011: 760-771 - [c8]Alessio Orlandi, Rossano Venturini
Space-efficient substring occurrence estimation. PODS 2011: 95-106 - [c7]Francesco Bonchi, Raffaele Perego
Recommendations for the long tail by term-query graph. WWW (Companion Volume) 2011: 15-16 - 2010
- [b1]Rossano Venturini:
On searching and extracting strings from compressed textual data. University of Pisa, Italy, 2010 - [j4]Paolo Ferragina
The compressed permuterm index. ACM Trans. Algorithms 7(1): 10:1-10:21 (2010) - [j3]Paolo Ferragina
On compact representations of All-Pairs-Shortest-Path-Distance matrices. Theor. Comput. Sci. 411(34-36): 3293-3300 (2010) - [c6]Fabrizio Silvestri
VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming. CIKM 2010: 1219-1228
2000 – 2009
- 2009
- [c5]Paolo Ferragina
On Optimally Partitioning a Text to Improve Its Compression. ESA 2009: 420-431 - [c4]Paolo Ferragina, Igor Nitto, Rossano Venturini:
On the bit-complexity of Lempel-Ziv compression. SODA 2009: 768-777 - [r1]Paolo Ferragina, Rossano Venturini:
Indexing Compressed Text. Encyclopedia of Database Systems 2009: 1442-1448 - [i4]Paolo Ferragina, Igor Nitto, Rossano Venturini:
On optimally partitioning a text to improve its compression. CoRR abs/0906.4692 (2009) - 2008
- [j2]Paolo Ferragina
Compressed text indexes: From theory to practice. ACM J. Exp. Algorithmics 13 (2008) - [c3]Igor Nitto, Rossano Venturini
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices. CPM 2008: 166-177 - [i3]Paolo Ferragina, Igor Nitto, Rossano Venturini:
Bit-Optimal Lempel-Ziv compression. CoRR abs/0802.0835 (2008) - 2007
- [j1]Paolo Ferragina
A simple storage scheme for strings achieving entropy bounds. Theor. Comput. Sci. 372(1): 115-121 (2007) - [c2]Paolo Ferragina
Compressed permuterm index. SIGIR 2007: 535-542 - [c1]Paolo Ferragina, Rossano Venturini:
A simple storage scheme for strings achieving entropy bounds. SODA 2007: 690-696 - [i2]Igor Nitto, Rossano Venturini:
Searching for a dangerous host: randomized vs. deterministic. CoRR abs/0708.3734 (2007) - [i1]Paolo Ferragina, Rodrigo González, Gonzalo Navarro, Rossano Venturini:
Compressed Text Indexes:From Theory to Practice! CoRR abs/0712.3360 (2007)
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-12-02 22:25 CET 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: