Simple and Space-Efficient Minimal Perfect Hash Functions
From MaRDI portal
(Redirected from Publication:3603522)
Recommendations
Cited in
(45)- 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
- Perfect hashing
- Unique permutation hashing
- Landau: a language for dynamical systems with automatic differentiation
- A new practical algorithm for the construction of a perfect hash function
- scientific article; zbMATH DE number 1688373 (Why is no real title available?)
- Balanced families of perfect hash functions and their applications
- Minimal and monotone minimal perfect hash functions
- scientific article; zbMATH DE number 2185600 (Why is no real title available?)
- d-k-min-wise independent family of hash functions
- Semi-external LTL Model Checking
- Uniform hashing in constant time and linear space
- Design Strategies for Minimal Perfect Hash Functions
- Faster and Space-Optimal Edit Distance “1” Dictionary
- Hash, Displace, and Compress
- Collections of Functions for Perfect Hashing
- scientific article; zbMATH DE number 88958 (Why is no real title available?)
- scientific article; zbMATH DE number 370478 (Why is no real title available?)
- scientific article; zbMATH DE number 637315 (Why is no real title available?)
- Cores of random \(r\)-partite hypergraphs
- scientific article; zbMATH DE number 2043349 (Why is no real title available?)
- scientific article; zbMATH DE number 2065606 (Why is no real title available?)
- Fast and scalable minimal perfect hashing for massive key sets
- scientific article; zbMATH DE number 1875411 (Why is no real title available?)
- Real-time traffic assignment using engineered customizable contraction hierarchies
- Dense peelable random uniform hypergraphs
- scientific article; zbMATH DE number 7525476 (Why is no real title available?)
- Constant-time retrieval with O( m) extra bits
- Binary fuse filters: fast and smaller than xor filters
- Theory and practice of monotone minimal perfect hashing
- Theory and practice of monotone minimal perfect hashing
- Perfect hashing schemes for mining traversal patterns
- Experimental and Efficient Algorithms
- Xor Filters
- Graphs, hypergraphs and hashing
- Flash memory efficient LTL model checking
- SicHash -- small irregular cuckoo tables for perfect hashing
- ShockHash: towards optimal-space minimal perfect hashing beyond brute-force
- Fingerprinting-based minimal perfect hashing revisited
- Peeling close to the orientability threshold. Spatial coupling in hashing-based data structures
- Ribbon: fast succinct static retrieval and approximate membership
- PHOBIC: Perfect hashing with optimized bucket sizes and interleaved coding
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions
This page was built for publication: Simple and Space-Efficient Minimal Perfect Hash Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603522)
