default search action
Giulio Ermanno Pibiri
Person information
- affiliation: Ca' Foscari University of Venice, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Jason Fan, Jamshed Khan, Noor Pratap Singh
, Giulio Ermanno Pibiri, Rob Patro:
Fulgor: a fast and compact k-mer index for large-scale matching and color queries. Algorithms Mol. Biol. 19(1): 3 (2024) - [j10]Giulio Ermanno Pibiri
Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash. IEEE Trans. Knowl. Data Eng. 36(3): 1249-1259 (2024) - [c15]Stefan Hermann, Hans-Peter Lehmann
PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding. ESA 2024: 69:1-69:17 - [c14]Giulio Ermanno Pibiri
Meta-colored Compacted de Bruijn Graphs. RECOMB 2024: 131-146 - [c13]Ragnar Groot Koerkamp, Giulio Ermanno Pibiri:
The {mod-minimizer}: A Simple and Efficient Sampling Algorithm for Long k-Mers. WABI 2024: 11:1-11:23 - [i15]Stefano Calzavara, Lorenzo Cazzaro, Claudio Lucchese, Giulio Ermanno Pibiri:
Verifiable Boosted Tree Ensembles. CoRR abs/2402.14988 (2024) - [i14]Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer:
PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding. CoRR abs/2404.18497 (2024) - 2023
- [j9]Giulio Ermanno Pibiri:
On weighted k-mer dictionaries. Algorithms Mol. Biol. 18(1): 3 (2023) - [j8]Giulio Ermanno Pibiri, Yoshihiro Shibuya, Antoine Limasset:
Locality-preserving minimal perfect hashing of k-mers. Bioinform. 39(Supplement-1): 534-543 (2023) - [c12]Stefano Calzavara
Verifiable Learning for Robust Tree Ensembles. CCS 2023: 1850-1864 - [c11]Jason Fan, Jamshed Khan, Giulio Ermanno Pibiri, Rob Patro:
Spectrum Preserving Tilings Enable Sparse and Modular Reference Indexing. RECOMB 2023: 21-40 - [c10]Jason Fan, Noor Pratap Singh, Jamshed Khan, Giulio Ermanno Pibiri, Rob Patro:
Fulgor: A Fast and Compact {k-mer} Index for Large-Scale Matching and Color Queries. WABI 2023: 18:1-18:21 - [i13]Stefano Calzavara, Lorenzo Cazzaro
Verifiable Learning for Robust Tree Ensembles. CoRR abs/2305.03626 (2023) - 2022
- [c9]Giulio Ermanno Pibiri
On Weighted k-mer Dictionaries. WABI 2022: 9:1-9:20 - [i12]Giulio Ermanno Pibiri, Yoshihiro Shibuya, Antoine Limasset:
Locality-Preserving Minimal Perfect Hashing of k-mers. CoRR abs/2210.13097 (2022) - 2021
- [j7]Giulio Ermanno Pibiri
Techniques for Inverted Index Compression. ACM Comput. Surv. 53(6): 125:1-125:36 (2021) - [j6]Giulio Ermanno Pibiri
Rank/select queries over mutable bitmaps. Inf. Syst. 99: 101756 (2021) - [j5]Giulio Ermanno Pibiri
Practical trade-offs for the prefix-sum problem. Softw. Pract. Exp. 51(5): 921-949 (2021) - [j4]Raffaele Perego
Compressed Indexes for Fast Search of Semantic Data. IEEE Trans. Knowl. Data Eng. 33(9): 3187-3198 (2021) - [c8]Giulio Ermanno Pibiri:
Fast and Compact Set Intersection through Recursive Universe Partitioning. DCC 2021: 293-302 - [c7]Raffaele Perego
Compressed Indexes for Fast Search of Semantic Data (Extended Abstract). ICDE 2021: 2325-2326 - [c6]Giulio Ermanno Pibiri, Roberto Trani:
PTHash: Revisiting FCH Minimal Perfect Hashing. SIGIR 2021: 1339-1348 - [c5]Andrea Bruno, Franco Maria Nardini
TSXor: A Simple Time Series Compression Algorithm. SPIRE 2021: 217-223 - [i11]Giulio Ermanno Pibiri, Roberto Trani:
PTHash: Revisiting FCH Minimal Perfect Hashing. CoRR abs/2104.10402 (2021) - [i10]Giulio Ermanno Pibiri, Roberto Trani:
Parallel and External-Memory Construction of Minimal Perfect Hash Functions with PTHash. CoRR abs/2106.02350 (2021) - 2020
- [j3]Giulio Ermanno Pibiri
On Optimally Partitioning Variable-Byte Codes. IEEE Trans. Knowl. Data Eng. 32(9): 1812-1823 (2020) - [c4]Simon Gog, Giulio Ermanno Pibiri
Efficient and Effective Query Auto-Completion. SIGIR 2020: 2271-2280 - [i9]Giulio Ermanno Pibiri, Rossano Venturini:
Succinct Dynamic Ordered Sets with Random Access. CoRR abs/2003.11835 (2020) - [i8]Simon Gog, Giulio Ermanno Pibiri, Rossano Venturini:
Efficient and Effective Query Auto-Completion. CoRR abs/2005.06213 (2020) - [i7]Giulio Ermanno Pibiri, Rossano Venturini:
Practical Trade-Offs for the Prefix-Sum Problem. CoRR abs/2006.14552 (2020) - [i6]Giulio Ermanno Pibiri, Shunsuke Kanda:
Rank/Select Queries over Mutable Bitmaps. CoRR abs/2009.12809 (2020)
2010 – 2019
- 2019
- [j2]Giulio Ermanno Pibiri
Handling Massive N-Gram Datasets Efficiently. ACM Trans. Inf. Syst. 37(2): 25:1-25:41 (2019) - [c3]Giulio Ermanno Pibiri
Fast Dictionary-Based Compression for Inverted Indexes. WSDM 2019: 6-14 - [r1]Giulio Ermanno Pibiri
Inverted Index Compression. Encyclopedia of Big Data Technologies 2019 - [i5]Raffaele Perego, Giulio Ermanno Pibiri, Rossano Venturini:
Compressed Indexes for Fast Search of Semantic Data. CoRR abs/1904.07619 (2019) - [i4]Giulio Ermanno Pibiri:
On Slicing Sorted Integer Sequences. CoRR abs/1907.01032 (2019) - [i3]Giulio Ermanno Pibiri, Rossano Venturini:
Techniques for Inverted Index Compression. CoRR abs/1908.10598 (2019) - 2018
- [b1]Giulio Ermanno Pibiri:
Space and Time-Efficient Data Structures for Massive Datasets. University of Pisa, 2018 - [i2]Giulio Ermanno Pibiri
Variable-Byte Encoding is Now Space-Efficient Too. CoRR abs/1804.10949 (2018) - [i1]Giulio Ermanno Pibiri, Rossano Venturini:
Handling Massive N-Gram Datasets Efficiently. CoRR abs/1806.09447 (2018) - 2017
- [j1]Giulio Ermanno Pibiri
Clustered Elias-Fano Indexes. ACM Trans. Inf. Syst. 36(1): 2:1-2:33 (2017) - [c2]Giulio Ermanno Pibiri
Dynamic Elias-Fano Representation. CPM 2017: 30:1-30:14 - [c1]Giulio Ermanno Pibiri
Efficient Data Structures for Massive N-Gram Datasets. SIGIR 2017: 615-624
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-10-07 22:18 CEST 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: