23 citations · 28 across the 13 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DS2022
SicHash -- Small Irregular Cuckoo Tables for Perfect Hashing
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
A Perfect Hash Function (PHF) is a hash function that has no collisions on a given input set. PHFs can be used for space efficient storage of data in an array, or for determining a…
cs.DS2022
Simple Set Sketching
Jakob Bæk Tejs Houen, Rasmus Pagh, Stefan Walzer
Imagine handling collisions in a hash table by storing, in each cell, the bit-wise exclusive-or of the set of keys hashing there. This appears to be a terrible idea: For keys…
cs.DS2022
Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold
Stefan Walzer
Most hash tables have an insertion time of , possibly qualified as expected and/or amortised. While insertions into cuckoo hash tables indeed seem to take expected tim…