A practical minimal perfect hashing method
From MaRDI portal
Recommendations
Cited in
(32)- An ordered minimal perfect hashing scheme based upon Euler's theorem
- Perfect hashing
- A scheme for constructing ordered minimal perfect hashing functions
- Efficient minimal perfect hashing in nearly minimal space
- The self-indexed search algorithm: a bit-level approach to minimal perfect hashing
- Hash and displace: efficient evaluation of minimal perfect hash functions
- A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
- Compact Hash Tables Using Bidirectional Linear Probing
- d-k-min-wise independent family of hash functions
- Simple and Space-Efficient Minimal Perfect Hash Functions
- Design Strategies for Minimal Perfect Hash Functions
- Collections of Functions for Perfect Hashing
- scientific article; zbMATH DE number 31674 (Why is no real title available?)
- scientific article; zbMATH DE number 88958 (Why is no real title available?)
- scientific article; zbMATH DE number 370478 (Why is no real title available?)
- Quasi-perfect Hashing
- scientific article; zbMATH DE number 637315 (Why is no real title available?)
- Square hash with a small key size
- 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 1873290 (Why is no real title available?)
- Simple minimal perfect hashing in less space
- scientific article; zbMATH DE number 898085 (Why is no real title available?)
- scientific article; zbMATH DE number 7525476 (Why is no real title available?)
- Theory and practice of monotone minimal perfect hashing
- Theory and practice of monotone minimal perfect hashing
- Perfect hashing schemes for mining traversal patterns
- Graphs, hypergraphs and hashing
- ShockHash: towards optimal-space minimal perfect hashing beyond brute-force
- Fingerprinting-based minimal perfect hashing revisited
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions
- Minimal perfect hashing in polynomial time
This page was built for publication: A practical minimal perfect hashing method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710049)