Simple minimal perfect hashing in less space
From MaRDI portal
Recommendations
Cited in
(25)- A backtracking method for constructing perfect hash functions from a set of mapping functions
- Two results on tables
- The effect of table expansion on the program complexity of perfect hash functions
- An optimal algorithm for generating minimal perfect hash functions
- On perfect hashing of numbers with sparse digit representation via multiplication by a constant
- A new practical algorithm for the construction of a perfect hash function
- Efficient minimal perfect hashing in nearly minimal space
- Minimal and monotone minimal perfect hash functions
- scientific article; zbMATH DE number 2185600 (Why is no real title available?)
- A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
- Simple and Space-Efficient Minimal Perfect Hash Functions
- Design Strategies for Minimal Perfect Hash Functions
- Hash, Displace, and Compress
- scientific article; zbMATH DE number 31674 (Why is no real title available?)
- scientific article; zbMATH DE number 88958 (Why is no real title available?)
- Perfect Hashing and Probability
- A nearly memory-optimal data structure for sets and mappings
- scientific article; zbMATH DE number 2043349 (Why is no real title available?)
- Fast and scalable minimal perfect hashing for massive key sets
- Experimental and Efficient Algorithms
- Fast and simple compact hashing via bucketing
- SicHash -- small irregular cuckoo tables for perfect hashing
- ShockHash: towards optimal-space minimal perfect hashing beyond brute-force
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions
- Minimal perfect hashing in polynomial time
This page was built for publication: Simple minimal perfect hashing in less space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796170)
