2 citations · 5 across the 7 of their papers we have counts for
Showing 2024 · cs.DSShow all
2 papers · 2 filters
cs.DS2024
PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri +2
A minimal perfect hash function (MPHF) maps a set of n keys to {1, ..., n} without collisions. Such functions find widespread application e.g. in bioinformatics and databases. In t…
cs.DS2024
Better space-time-robustness trade-offs for set reconciliation
Djamal Belazzougui, Gregory Kucherov, Stefan Walzer
We consider the problem of reconstructing the symmetric difference between similar sets from their representations (sketches) of size linear in the number of differences. Exact sol…