Dynamic Elias-Fano Representation. - Giulio Ermanno Pibiri; Rossano Venturini (CPM, 2017)

Efficient Data Structures for Massive N-Gram Datasets. - Giulio Ermanno Pibiri; Rossano Venturini (SIGIR, 2017)

Clustered Elias-Fano Indexes. - Giulio Ermanno Pibiri; Rossano Venturini (ACM Trans. Inf. Syst., 2017)

Variable-Byte Encoding is Now Space-Efficient Too. - Giulio Ermanno Pibiri; Rossano Venturini (CoRR, 2018)

Handling Massive N-Gram Datasets Efficiently. - Giulio Ermanno Pibiri; Rossano Venturini (CoRR, 2018)

Space and Time-Efficient Data Structures for Massive Datasets. - Giulio Ermanno Pibiri (2018)

Fast Dictionary-Based Compression for Inverted Indexes. - Giulio Ermanno Pibiri; Matthias Petri; Alistair Moffat (WSDM, 2019)

On Slicing Sorted Integer Sequences. - Giulio Ermanno Pibiri (CoRR, 2019)

Handling Massive N-Gram Datasets Efficiently. - Giulio Ermanno Pibiri; Rossano Venturini (ACM Trans. Inf. Syst., 2019)

Inverted Index Compression. - Giulio Ermanno Pibiri; Rossano Venturini (Encyclopedia of Big Data Technologies, 2019)

Efficient and Effective Query Auto-Completion. - Simon Gog; Giulio Ermanno Pibiri; Rossano Venturini (SIGIR, 2020)

Succinct Dynamic Ordered Sets with Random Access. - Giulio Ermanno Pibiri; Rossano Venturini (CoRR, 2020)

On Optimally Partitioning Variable-Byte Codes. - Giulio Ermanno Pibiri; Rossano Venturini (IEEE Trans. Knowl. Data Eng., 2020)

Fast and Compact Set Intersection through Recursive Universe Partitioning. - Giulio Ermanno Pibiri (DCC, 2021)

Compressed Indexes for Fast Search of Semantic Data (Extended Abstract). - Raffaele Perego 001; Giulio Ermanno Pibiri; Rossano Venturini (ICDE, 2021)

PTHash: Revisiting FCH Minimal Perfect Hashing. - Giulio Ermanno Pibiri; Roberto Trani (SIGIR, 2021)

TSXor: A Simple Time Series Compression Algorithm. - Andrea Bruno; Franco Maria Nardini; Giulio Ermanno Pibiri; Roberto Trani; Rossano Venturini (SPIRE, 2021)

Techniques for Inverted Index Compression. - Giulio Ermanno Pibiri; Rossano Venturini (ACM Comput. Surv., 2021)

Rank/select queries over mutable bitmaps. - Giulio Ermanno Pibiri; Shunsuke Kanda (Inf. Syst., 2021)

Practical trade-offs for the prefix-sum problem. - Giulio Ermanno Pibiri; Rossano Venturini (Softw. Pract. Exp., 2021)

Compressed Indexes for Fast Search of Semantic Data. - Raffaele Perego 001; Giulio Ermanno Pibiri; Rossano Venturini (IEEE Trans. Knowl. Data Eng., 2021)

Sparse and skew hashing of K-mers. - Giulio Ermanno Pibiri (Bioinform., 2022)

Locality-Preserving Minimal Perfect Hashing of k-mers. - Giulio Ermanno Pibiri; Yoshihiro Shibuya; Antoine Limasset (CoRR, 2022)

Verifiable Learning for Robust Tree Ensembles. - Stefano Calzavara; Lorenzo Cazzaro; Giulio Ermanno Pibiri; Nicola Prezza (CCS, 2023)

Spectrum Preserving Tilings Enable Sparse and Modular Reference Indexing. - Jason Fan; Jamshed Khan; Giulio Ermanno Pibiri; Rob Patro (RECOMB, 2023)

Locality-preserving minimal perfect hashing of k-mers. - Giulio Ermanno Pibiri; Yoshihiro Shibuya; Antoine Limasset (Bioinform., 2023)

On weighted k-mer dictionaries. - Giulio Ermanno Pibiri (Algorithms Mol. Biol., 2023)

PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding. - Stefan Hermann; Hans-Peter Lehmann; Giulio Ermanno Pibiri; Peter Sanders 001; Stefan Walzer (ESA, 2024)

Meta-colored Compacted de Bruijn Graphs. - Giulio Ermanno Pibiri; Jason Fan; Rob Patro (RECOMB, 2024)

The {mod-minimizer}: A Simple and Efficient Sampling Algorithm for Long k-Mers. - Ragnar Groot Koerkamp; Giulio Ermanno Pibiri (WABI, 2024)

Where the Patterns Are: Repetition-Aware Compression for Colored de Bruijn Graphs*. - Alessio Campanelli; Giulio Ermanno Pibiri; Jason Fan; Rob Patro (J. Comput. Biol., 2024)

Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash. - Giulio Ermanno Pibiri; Roberto Trani (IEEE Trans. Knowl. Data Eng., 2024)

Fulgor: a fast and compact k-mer index for large-scale matching and color queries. - Jason Fan; Jamshed Khan; Noor Pratap Singh; Giulio Ermanno Pibiri; Rob Patro (Algorithms Mol. Biol., 2024)

Verifiable Boosted Tree Ensembles. - Stefano Calzavara; Lorenzo Cazzaro; Claudio Lucchese; Giulio Ermanno Pibiri (SP, 2025)

Fast Pseudoalignment Queries on Compressed Colored de Bruijn Graphs. - Alessio Campanelli; Giulio Ermanno Pibiri; Rob Patro (WABI, 2025)

U-Index: A Universal Indexing Framework for Matching Long Patterns. - Lorraine A. K. Ayad; Gabriele Fici; Ragnar Groot Koerkamp; Grigorios Loukides; Rob Patro; Giulio Ermanno Pibiri; Solon P. Pissis (SEA, 2025)

Modern Minimal Perfect Hashing: A Survey. - Hans-Peter Lehmann; Thomas Mueller; Rasmus Pagh; Giulio Ermanno Pibiri; Peter Sanders 001; Sebastiano Vigna; Stefan Walzer (CoRR, 2025)

The open-closed mod-minimizer algorithm. - Ragnar Groot Koerkamp; Daniel Liu; Giulio Ermanno Pibiri (Algorithms Mol. Biol., 2025)