Modern Minimal Perfect Hashing: A Survey

Hans-Peter Lehmann, Thomas Mueller, Rasmus Pagh +4

Given a set $S$ of $n$ keys, a perfect hash function for $S$ maps the keys in $S$ to the first $m\ge n$ integers without collisions. It may return an arbitrary result for any key…