SIAM Journal on Computing
Storing information with extractors
Information Processing Letters
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Efficient Minimal Perfect Hashing in Nearly Minimal Space
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Almost random graphs with simple hash functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Dependent Sets of Constant Weight Binary Vectors
Combinatorics, Probability and Computing
On Universal Classes of Extremely Random Constant-Time Hash Functions
SIAM Journal on Computing
Journal of Algorithms
Balanced allocation and dictionaries with tightly packed constant size bins
Theoretical Computer Science
Why simple hash functions work: exploiting the entropy in a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Uniform Hashing in Constant Time and Optimal Space
SIAM Journal on Computing
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Design strategies for minimal perfect hash functions
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
The power of simple tabulation hashing
Proceedings of the forty-third annual ACM symposium on Theory of computing
The Power of Simple Tabulation Hashing
Journal of the ACM (JACM)
Independence of tabulation-based hash classes
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Practical perfect hashing in nearly optimal space
Information Systems
Explicit and efficient hash families suffice for cuckoo hashing with a stash
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Hi-index | 0.00 |
We study applications of a simple method for circumventing the "full randomness assumption" when building a hashing-based data structure for a set S of keys. The general approach is to "split" S into "pieces" S i , by a splitting hash function. On a piece S i , a method or data structure for generating full randomness is used that uses more space than |S i |. Under certain circumstances, this data structure can be "shared" among the constructions for the pieces S i , which leads to a tighter overall space bound. The method was introduced in the context of cuckoo hashing and its variants, but it seems to have wider applicability. To demonstrate its power and some subtleties, we study three new applications, improving previous constructions: (i) Space-efficient simulation of full randomness on S (following work by Pagh and Pagh (2003/08) and Dietzfelbinger and Woelfel (2003)); (ii) Construction of highly independent functions in the style of Siegel (1989/2004); (iii) One-probe schemes as in work by Buhrman, Miltersen, Radhakrishnan, and Venkatesh (2000/02) and Pagh and Pagh (2002).