Giulio Ermanno Pibiri

Orcid: 0000-0003-0724-7092

Affiliations:
  • Ca' Foscari University of Venice, Italy


According to our database1, Giulio Ermanno Pibiri authored at least 29 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fulgor: a fast and compact k-mer index for large-scale matching and color queries.
Algorithms Mol. Biol., December, 2024

Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash.
IEEE Trans. Knowl. Data Eng., March, 2024

Verifiable Boosted Tree Ensembles.
CoRR, 2024

2023
On weighted k-mer dictionaries.
Algorithms Mol. Biol., December, 2023

Locality-preserving minimal perfect hashing of <i>k</i>-mers.
Bioinform., 2023

Spectrum Preserving Tilings Enable Sparse and Modular Reference Indexing.
Proceedings of the Research in Computational Molecular Biology, 2023

Verifiable Learning for Robust Tree Ensembles.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Locality-Preserving Minimal Perfect Hashing of k-mers.
CoRR, 2022

2021
Compressed Indexes for Fast Search of Semantic Data.
IEEE Trans. Knowl. Data Eng., 2021

Practical trade-offs for the prefix-sum problem.
Softw. Pract. Exp., 2021

Rank/select queries over mutable bitmaps.
Inf. Syst., 2021

Techniques for Inverted Index Compression.
ACM Comput. Surv., 2021

TSXor: A Simple Time Series Compression Algorithm.
Proceedings of the String Processing and Information Retrieval, 2021

PTHash: Revisiting FCH Minimal Perfect Hashing.
Proceedings of the SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2021

Compressed Indexes for Fast Search of Semantic Data (Extended Abstract).
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Fast and Compact Set Intersection through Recursive Universe Partitioning.
Proceedings of the 31st Data Compression Conference, 2021

2020
On Optimally Partitioning Variable-Byte Codes.
IEEE Trans. Knowl. Data Eng., 2020

Succinct Dynamic Ordered Sets with Random Access.
CoRR, 2020

Efficient and Effective Query Auto-Completion.
Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, 2020

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

Handling Massive <i>N</i>-Gram Datasets Efficiently.
ACM Trans. Inf. Syst., 2019

On Slicing Sorted Integer Sequences.
CoRR, 2019

Fast Dictionary-Based Compression for Inverted Indexes.
Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, 2019

2018
Space and Time-Efficient Data Structures for Massive Datasets.
PhD thesis, 2018

Handling Massive N-Gram Datasets Efficiently.
CoRR, 2018

Variable-Byte Encoding is Now Space-Efficient Too.
CoRR, 2018

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

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

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


  Loading...