
Giulio Ermanno Pibiri
@giulio_pibiri
Followers
455
Following
3K
Media
32
Statuses
2K
Associate Prof. of CS at @CaFoscari University of Venice. Indexing, Data Compression, Algorithms.
Padua/Venice/Florence ⚜️ 🇮🇹
Joined November 2010
I don’t think we should align our standards to match them, rather tell them to behave properly. Why not just ask him to use headphones? It happened to me several times on trains and metros.
I’m in an airport and the guy next to me has been watching videos with NO HEADPHONES. It’s so annoying. I finally took out my phone and started doing the same. But I made sure to slowly increase my volume over his. He looked over at me like he was super annoyed. And then turned.
0
0
1
RT @dominik_kempa: Congratulations to Tomasz Kociumaka for winning the prestigious 2025 Presburger Award! An incredibly well-deserved recog….
eatcs.org
European Association for Theoretical Computer Science
0
6
0
RT @lemire: I was honored to deliver the keynote address at the 23rd Symposium on Experimental Algorithms (SEA 2025). My talk, “Algorithms….
0
6
0
Proud of my student @AlessioCampa_ who led this work, to appear in WABI ‘25!.Check this out for the latest advancements on the Fulgor index: now faster to query and build. 🧬⚡️.
With @giulio_pibiri and @nomad421, we are about to release Fulgor v4.0.0, which is much faster to build and query, without affecting its memory efficiency. You can find all the information in our #WABI2025 paper (. 🧵 (1/7).
0
1
9
RT @nomad421: We're thrilled to announce that one of our keynote speakers at #WABI2025 will be the inimitable Ben Langmead! .
wabiconf.github.io
Talk by Ben Langmead - WABI 2025
0
7
0
RT @mourisl: Our lab is hiring! We are looking for a postdoc in the area of immunology/microbiology+ML, or in pure method/software developm….
mourisl.github.io
Li Song Lab
0
19
0
A monumental collaborative effort with many incredible people ☺️ Proud to be part of this!.
arxiv.org
Given a set $S$ of $n$ keys, a perfect hash function for $S$ maps the keys in $S$ to the first $m \geq n$ integers without collisions. It may return an arbitrary result for any key not in $S$ and...
2
13
38
RT @RayanChikhi: Slides from my talk (with Kamil Jaron) on an history of k-mers in bioinformatics:
0
31
0
Oooh! Congrats boys! 🎉.
I am also extremely happy to also share that our paper has received a Distinguished Paper Award at @IEEESSP 2025!. A huge thank you to @stecalzavara @claudiolucchese @giulio_pibiri for making this possible!.
0
0
2
RT @LorenzoCazz: ❓How can we efficiently verify the robustness of machine learning models, particularly boosted tree ensembles?. ✨In our ML….
0
1
0
". one index to rule them all." :).
In the context of responding to reviews for our alevin-fry-ATAC paper, we ended up producing a short note describing the piscem index. While a full piscem paper is still in the works, folks might be interested in this w Noor, Jamshed & @giulio_pibiri.
1
1
3
Congrats to @KarelBrinda et al. Fantastic work :) you know I love compressed data very much!.
A decade ago, we had thousands of bacterial genomes. Now, we have millions. How to scale computational methods?. Our paper in @naturemethods answers this: use evolutionary history to guide compression and search. …From terabytes to tens of GBs…. w/@Baym @ZaminIqbal et al. 🧵1/
0
0
6
What a killer program for DSB '25 in Pisa! Can't wait to meet you there next week!.
dsb-meeting.github.io
Workshop Data Structures in Bioinformatics
1
3
8
RT @curious_coding: PtrHash MPHF has a DOI, At last! 1.5y after starting the project. - 2.4bits/key.- 1.75x faster lookup than PTHash&PHOB….
arxiv.org
Given a set $K$ of $n$ keys, a minimal perfect hash function (MPHF) is a collision-free bijective map $\mathsf{H_{mphf}}$ from $K$ to $\{0, \dots, n-1\}$. This work presents a (minimal) perfect...
0
7
0