Hans‐Peter Lehmann

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding

A minimal perfect hash function (or MPHF) maps a set of \(n\) keys to \([n]:=\{1,\ldots,n\}\) without collisions. Such functions find widespread application e.g. in bioinformatics and databases. In this paper we revisit PTHash – a construction technique particularly designed for...