RV
Rossano Venturini
cs.IRcs.DScs.DBcs.LGcs.ITmath.ITcs.DCcs.AIcs.ARcs.CV
On Valency
published · living versionsW_wbna4w8u·v1 · currentpublished
Modular and Efficient Approximate Nearest Neighbors Search with Vectorium and kANNolo
with Silvio Martinico, Franco Maria Nardini, Cosimo Rulli
1 version
W_yqfbn3ae·v2published
Preprints & journals
35 papers in the corpus · 2007–2026Getting a GRIP on Graph-Based Search for Learned Sparse Retrieval2610.30425v1 · Vihan Lakshman, Franco Maria Nardini, Cosimo Rulli et al.2026 · 0 citationsarXiv
Compact and Efficient Indexes for Learned Sparse Retrieval2610.12300v1 · Franco Maria Nardini, Luca Rizzo, Cosimo Rulli et al.2026 · 0 citationsarXiv
FastPair: GPU-Optimized String Decoding2609.15034v1 · Joseph Isaacs, Francesco Gargiulo, Peter Boncz et al.2026 · 0 citationsarXiv
PUMA: Post-Hoc Sparsification of Universal Multimodal Embeddings for Efficient Retrieval2608.25780v1 · Matteo Attimonelli, Alessandro De Bellis, Franco Maria Nardini et al.2026 · 0 citationsarXiv
RISE: A Rust Library for Inverted Index Search Engines2606.07187v1 · Angelo Savino, Rossano Venturini2026 · 0 citationsarXiv
Efficient Multivector Retrieval with Token-Aware Clustering and Hierarchical Indexing2604.28142v1 · Silvio Martinico, Franco Maria Nardini, Cosimo Rulli et al.2026 · 1 citationarXiv
Sparton: Fast and Memory-Efficient Triton Kernel for Learned Sparse Retrieval2603.25011v1 · Thong Nguyen, Cosimo Rulli, Franco Maria Nardini et al.2026 · 0 citationsarXiv
Forward Index Compression for Learned Sparse Retrieval2602.05445v1 · Sebastian Bruch, Martino Fontana, Franco Maria Nardini et al.2026 · 0 citationsarXiv
Multivector Reranking in the Era of Strong First-Stage Retrievers2601.05200v3 · Silvio Martinico, Franco Maria Nardini, Cosimo Rulli et al.2026 · 1 citationarXiv
Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets2509.24815v1 · Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli et al.2025 · 1 citationarXiv
OnPair: Short Strings Compression for Fast Random Access2508.02280v1 · Francesco Gargiulo, Rossano Venturini2025 · 0 citationsarXiv
Effective Inference-Free Retrieval for Learned Sparse Representations2505.01452v1 · Franco Maria Nardini, Thong Nguyen, Cosimo Rulli et al.2025 · 7 citationsarXiv
Investigating the Scalability of Approximate Sparse Retrieval Algorithms to Massive Datasets2501.11628v1 · Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli et al.2025 · 9 citationsarXiv
kANNolo: Sweet and Smooth Approximate k-Nearest Neighbors Search2501.06121v2 · Leonardo Delfino, Domenico Erriquez, Silvio Martinico et al.2025 · 7 citationsProc. of the 47th European Conference on Information Retrieval (ECIR 2025), Part IV, pp. 400-406
Pairing Clustered Inverted Indexes with kNN Graphs for Fast Approximate Retrieval over Learned Sparse Representations2408.04443v1 · Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli et al.2024 · 13 citationsarXiv
Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations2404.18812v1 · Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli et al.2024 · 53 citationsarXiv
Efficient Multi-Vector Dense Retrieval Using Bit Vectors2404.02805v1 · Franco Maria Nardini, Cosimo Rulli, Rossano Venturini2024 · 1 citationarXiv
Neural Network Compression using Binarization and Few Full-Precision Weights2306.08960v2 · Franco Maria Nardini, Cosimo Rulli, Salvatore Trani et al.2023 · 2 citationsarXiv
Faster Wavelet Tree Queries2302.09239v2 · Matteo Ceregini, Florian Kurpicz, Rossano Venturini2023 · 5 citationsarXiv
Distilled Neural Networks for Efficient Learning to Rank2202.10728v1 · F.M. Nardini, C. Rulli, S. Trani et al.2022 · 21 citationsarXiv
An Optimal Algorithm for Finding Champions in Tournament Graphs2111.13621v4 · Lorenzo Beretta, Franco Maria Nardini, Roberto Trani et al.2021 · 3 citationsarXiv
Adaptive Learning of Compressible Strings2011.07143v3 · Gabriele Fici, Nicola Prezza, Rossano Venturini2020 · 1 citationarXiv
Practical Trade-Offs for the Prefix-Sum Problem2006.14552v3 · Giulio Ermanno Pibiri, Rossano Venturini2020 · 6 citationsSoftw. Pract. Exp. 51(5): 921-949 (2021)
Succinct Dynamic Ordered Sets with Random Access2003.11835v1 · Giulio Ermanno Pibiri, Rossano Venturini2020 · 0 citationsarXiv
Techniques for Inverted Index Compression1908.10598v2 · Giulio Ermanno Pibiri, Rossano Venturini2019 · 67 citationsACM Computing Surveys. Volume 53. Issue 6. November 2021. Article No.:125 pp 1-36
Compressed Indexes for Fast Search of Semantic Data1904.07619v3 · Raffaele Perego, Giulio Ermanno Pibiri, Rossano Venturini2019 · 25 citationsIEEE Trans. Knowl. Data Eng. 33(9): 3187-3198 (2021)
Handling Massive N-Gram Datasets Efficiently1806.09447v2 · Giulio Ermanno Pibiri, Rossano Venturini2018 · 25 citationsACM Trans. Inf. Syst. 37(2): 25:1-25:41 (2019)
On Optimally Partitioning Variable-Byte Codes1804.10949v2 · Giulio Ermanno Pibiri, Rossano Venturini2018 · 8 citationsIEEE Trans. Knowl. Data Eng. 32(9): 1812-1823 (2020)
An Encoding for Order-Preserving Matching1610.02865v2 · Travis Gagie, Giovanni Manzini, Rossano Venturini2016 · 5 citationsarXiv
Cache-Oblivious Peeling of Random Hypergraphs1312.0526v1 · Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano et al.2013 · 21 citationsarXiv
Bicriteria data compression1307.3872v1 · Andrea Farruggia, Paolo Ferragina, Antonio Frangioni et al.2013 · 0 citationsarXiv
On optimally partitioning a text to improve its compression0906.4692v1 · Paolo Ferragina, Igor Nitto, Rossano Venturini2009 · 28 citationsarXiv
Bit-Optimal Lempel-Ziv compression0802.0835v1 · Paolo Ferragina, Igor Nitto, Rossano Venturini2008 · 0 citationsarXiv
Compressed Text Indexes:From Theory to Practice!0712.3360v1 · Paolo Ferragina, Rodrigo Gonzalez, Gonzalo Navarro et al.2007 · 34 citationsarXiv
Searching for a dangerous host: randomized vs. deterministic0708.3734v1 · Igor Nitto, Rossano Venturini2007 · 0 citationsarXiv
Career total: 148 works. 35 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.