Hash and displace: efficient evaluation of minimal perfect hash functions

DOI10.1007/3-540-48447-7_5MaRDI QIDQ3024761zbMATH OpenFDO

Authors Rasmus Pagh

Publication date 4 July 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48447-7_5

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Recommendations

• A practical minimal perfect hashing method
• Simple and Space-Efficient Minimal Perfect Hash Functions
• Efficient minimal perfect hashing in nearly minimal space
• Hash, Displace, and Compress
• Simple minimal perfect hashing in less space

Cited in

(13)

• Construct a perfect word hash function in time independent of the size of integers
• Efficient minimal perfect hashing in nearly minimal space
• Compact Hash Tables Using Bidirectional Linear Probing
• d-k-min-wise independent family of hash functions
• Hash, Displace, and Compress
• Hash table reorganization
• Optimal hashing
• Collections of Functions for Perfect Hashing
• Vowel-consonant addressing mode on hashing for English letter-oriented keys
• scientific article; zbMATH DE number 2112400 (Why is no real title available?)
• Perfect hashing schemes for mining traversal patterns
• Universal Hashing via Integer Arithmetic Without Primes, Revisited
• Communication complexity vs randomness complexity in interactive proofs

This page was built for publication: Hash and displace: efficient evaluation of minimal perfect hash functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3024761)