viii Preface reason for this change is that sequential processors have ceased to get
proportional performance improvements from increased circuit complexity. Although the …

Minimal perfect hash functions provide space-efficient and collision-free hashing on static
sets. Existing algorithms and implementations that build such functions have practical …

Given a set S of n distinct keys, a function f that bijectively maps the keys of S into the range
(0,..., n-1) is called a minimal perfect hash function for S. Algorithms that find such functions …

A minimal perfect hash function bijectively maps a key set S out of a universe U into the first|
S| natural numbers. Minimal perfect hash functions are used, for example, to map irregularly …

A retrieval data structure for a static function $ f: S\rightarrow\{0, 1\}^ r $ supports queries that
return $ f (x) $ for any $ x\in S $. Retrieval data structures can be used to implement a static …

A minimal perfect hash function (MPHF) maps a set S of n keys to the first n integers without
collisions. There is a lower bound of n log2 ℓ—O (log n) bits of space needed to represent …

A function is a minimal perfect hash function for a set of size, if bijectively maps into the first
natural numbers. These functions are important for many practical applications in computing …

Motivation k-mer counting is a common task in bioinformatic pipelines, with many dedicated
tools available. Many of these tools produce in output k-mer count tables containing both k …

In this paper we study a fingerprint-based minimal perfect hash function (FMPH for short).
While FMPH is not as space-efficient as some other minimal perfect hash functions (for …

A minimal perfect hash function (MPHF) bijectively maps a set S of objects to the first| S|
integers. It can be used as a building block in databases and data compression. RecSplit …