Hash, Displace, and Compress
From MaRDI portal
Recommendations
Cited in
(22)- The effect of table expansion on the program complexity of perfect hash functions
- Unique permutation hashing
- Linear-space data structures for range frequency queries on arrays and trees
- A new practical algorithm for the construction of a perfect hash function
- Minimal and monotone minimal perfect hash functions
- scientific article; zbMATH DE number 2185600 (Why is no real title available?)
- Simple and Space-Efficient Minimal Perfect Hash Functions
- Constant-time retrieval with O( m) extra bits
- SSLC: A Search Algorithm Based on Linear Collisions and Poisson Probability Distribution
- Secure two-party input-size reduction: challenges, solutions and applications
- T5: Hashing five inputs with three compression calls
- Flash memory efficient LTL model checking
- SicHash -- small irregular cuckoo tables for perfect hashing
- Fingerprinting-based minimal perfect hashing revisited
- The mod-minimizer: a simple and efficient sampling algorithm for long k-mers
- Simplified tight bounds for monotone minimal perfect hashing
- ShockHash: near optimal-space minimal perfect hashing beyond brute-force
- PHOBIC: Perfect hashing with optimized bucket sizes and interleaved coding
- Counting on general run-length grammars
- Engineering minimal \(k\)-perfect hash functions
- Combined search and encoding for seeds, with an application to minimal perfect hashing
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions
This page was built for publication: Hash, Displace, and Compress
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639281)
