Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Consensus for Compressed Static Functions
Dominik Rosch, Jonatan Ziegler
The Consensus technique marked a breakthrough in the construction of minimal perfect hash functions (MPHFs), reaching a linear tradeoff between construction time and space overhead…
cs.DS2025
Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer +1
Randomised algorithms often employ methods that can fail and that are retried with independent randomness until they succeed. Randomised data structures therefore often store indic…