Thomas Mueller Graf

According to our database, Thomas Mueller Graf authored at least 5 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Modern Minimal Perfect Hashing: A Survey.

Hans-Peter Lehmann, Thomas Mueller Graf, Rasmus Pagh, Giulio Ermanno Pibiri, Peter Sanders, Sebastiano Vigna, Stefan Walzer

ACM Comput. Surv., July, 2026

2022

Binary Fuse Filters: Fast and Smaller Than Xor Filters.

Thomas Mueller Graf, Daniel Lemire

ACM J. Exp. Algorithmics, 2022

2020

Xor Filters.

Thomas Mueller Graf, Daniel Lemire

ACM J. Exp. Algorithmics, 2020

RecSplit: Minimal Perfect Hashing via Recursive Splitting.

Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna

Proceedings of the 22nd Symposium on Algorithm Engineering and Experiments, 2020

2019

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters.

Thomas Mueller Graf, Daniel Lemire

CoRR, 2019