Explicit hash-function families for bubble-up cuckoo hashing

Extend the guarantees of bubble-up cuckoo hashing to explicit families of hash functions, including suitable variants of tabulation hashing.

Background

The analysis in the paper assumes fully independent and fully random hash functions. It remains unresolved whether comparable load, insertion-time, query-time, and failure-probability guarantees can be obtained using explicit, implementable hash-function families such as tabulation-based constructions.

References

Can our results for bubble-up cuckoo hashing be extended to work with explicit families of hash functions, for example, with variants of tabulation hashing ?

— Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up  (2501.02312 - Kuszmaul et al., 4 Jan 2025) in Section Conclusion