Invited

• Repetition-aware compression and query of colored de Bruijn graphs. RIKEN-AIP Workshop: Compressed Data Structures for Advanced Data Analysis 2025. Tokyo, Japan, 04/07/2025.
• The anatomy of an order-preserving k-mer dictionary. RIKEN-AIP Workshop: Compressed Data Structures for Advanced Data Analysis 2025. Tokyo, Japan, 02/07/2025.
• Compressing and indexing pangenomes with meta-colored compacted de Bruijn graphs. ALPACA-PANGAIA Winter School 2023. Amsterdam, Netherlands, 22/11/2023.
• Modular reference indexing with the de Bruijn graph: overview and challenges. Workshop on Indexing Omic Sequences. Rennes, France, 20/10/2022.
• On Weighted K-Mer Dictionaries. TUDASTIC 2022. Lille, France, 10/05/2022.

Conferences

• U-Index: A Universal Indexing Framework for Matching Long Patterns. SEA 2025. Venice, Italy, 22/07/2025.
• The Mod-Minimizer: A Simple and Efficient Sampling Algorithm for Long K-Mers. WABI 2024. Egham, UK, 02/09/2024.
• Meta-Colored Compacted de Bruijn Graphs. RECOMB 2024. Boston, USA, 30/04/2024.
• Locality-Preserving Minimal Perfect Hashing of K-Mers. ISMB 2023. Lyon, France, 25/07/2023.
• Spectrum Preserving Tilings Enable Sparse and Modular Reference Indexing. DSB 2023. Delft, Netherlands, 21/03/2023.
• On Weighted K-Mer Dictionaries. WABI 2022. Potsdam, Germany, 05/09/2022.
• Sparse and Skew Hashing of K-Mers. ISMB 2022. Madison, USA (virtual), 13/07/2022.
• PTHash: Revisiting FCH Minimal Perfect Hashing. DSB 2022, Düsseldorf, Germany, 14/06/2022.
• Sparse and Skew Hashing of K-Mers. RECOMB-seq 2022. La Jolla, California, USA (virtual), 20/05/2022.
• TSXor: A Simple Time-Series Compression Algorithm. SPIRE 2021. Lille, France (virtual), 04/10/2021.
• PTHash: Revisiting FCH Minimal Perfect Hashing. IIR 2021. Polytechnic University of Bari, Bari (virtual), 14/09/2021.
• PTHash: Revisiting FCH Minimal Perfect Hashing. SIGIR 2021. Montreal, Canada (virtual), 07/2021.
• Compressed Indexes for Fast Search of Semantic Data. ICDE 2021. Chania, Greece (virtual), 04/2021.
• Fast and Compact Set Intersection through Recursive Universe Partitioning. DCC 2021. Snow Bird, USA (virtual), 03/2021.
• Efficient and Effective Query Auto-Completion. SIGIR 2020. Xi’An, China (virtual), 27/07/2020.
• Compressed Indexes for Fast Search of Semantic Data. IIR 2019. Department of Information Engineering, Padova, Italy, 17/09/2019.
• Fast Dictionary-based Compression for Inverted Indexes. WSDM 2019. Melbourne Exhibition Center, Melbourne, Australia, 12/02/2019.
• Efficient Data Structures for Massive N-Gram Datasets. SIGIR 2017. Keio Plaza Hotel, Tokyo, Japan, 10/08/2017.
• Dynamic Elias-Fano Representation. CPM 2017. University Library of Warsaw, Warsaw, Poland, 06/07/2017.
• Efficient Data Structures for Massive N-Gram Datasets. IIR 2017. Università della Svizzera Italiana, Lugano, Switzerland, 06/06/2017.

Seminars

• Compressed data structures for big data indexing. Ca’ Foscari University of Venice, Venice, Italy, 12/07/2024.
• Compressing and Indexing Pangenomes with Meta-Colored de Bruijn Graphs. ISTI-CNR, Pisa, Italy (virtual), 02/11/2023.
• Sparse and Skew Hashing of K-Mers. ISTI-CNR, Pisa, Italy (virtual), 19/05/2022.
• Minimal Perfect Hashing and K-Mer String Dictionaries. Ca’ Foscari University of Venice, Venice, Italy (virtual), 22/12/2021.
• PTHash: Revisiting FCH Minimal Perfect Hashing. ISTI-CNR, Pisa, Italy (virtual), 16/11/2021.
• Efficiency for Real-World Applications. ISTI-CNR, Pisa, Italy (virtual), 04/03/2021.
• Ordered Set Problems. ISTI-CNR, Pisa, Italy, 07/06/2019.
• Indexing Compressed Data for Fast Retrieval. University of Pisa, Pisa, Italy, 01/02/2019.
• Effective Web Graph Representations. University of Pisa, Pisa, Italy, 29/10/2018.
• On Optimally Partitioning Variable-Byte Index Data. RMIT University, Melbourne, Australia, 17/05/2018.
• Elias-Fano Encoding: a powerful tool for data structure design. RIKEN AIP, Tokyo, Japan, 10/04/2018.
• Elias-Fano Encoding: succinct representation of monotone integer sequences with search operations. University of Pisa, Pisa, Italy, 21/06/2016.