1 paper
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…