Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
The spatial complexity of oblivious k-probe Hash functions
SIAM Journal on Computing
Practical minimal perfect hash functions for large databases
Communications of the ACM
An optimal algorithm for generating minimal perfect hash functions
Information Processing Letters
Theoretical Computer Science
Communications of the ACM
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Efficient Minimal Perfect Hashing in Nearly Minimal Space
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Graphs, Hypergraphs and Hashing
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Polynomial Hash Functions Are Reliable (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Space Efficient Hash Tables with Worst Case Constant Access Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A practical minimal perfect hashing method
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Maintaining external memory efficient hash tables
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Practical perfect hashing in nearly optimal space
Information Systems
Design strategies for minimal perfect hash functions
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Simple and space-efficient minimal perfect hash functions
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.01 |
A minimal perfect hash function for a set S is an injective mapping from S to {0, . . . |S|-1}. Taking as our model of computation a unit-cost RAM with a word length of w bits, we consider the problem of constructing minimal perfect hash functions with constant evaluation time for arbitrary subsets of U = {0, . . . 2w - 1}. Pagh recently described a simple randomized algorithm that, given a set S ⊆ U of size n, works in O(n) expected time and computes a minimal perfect hash function for S whose representation, besides a constant number of words, is a table of at most (2+Ɛ)n integers in the range {0,. . ., n-1}, for arbitrary fixed Ɛ 0. Extending his method, we show how to replace the factor of 2 + Ɛ by 1 + Ɛ.