On Universal Classes of Extremely Random Constant Time Hash Functions and their Time-space Tradeoff

Authors:
A. Siegel
Affiliations:
-
Venue:
On Universal Classes of Extremely Random Constant Time Hash Functions and their Time-space Tradeoff
Year:
1995

Citing 0
Cited 3

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
Pseudo-random graphs and bit probe schemes with one-sided error

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A family of functions F that map [0,n]-1, that can be evaluated in constant time for the standard random access model of computation. Simple extensions give comparable behavior for larger domains. As a consequence, many probabilistic algorithms can for the first time be shown to achieve their expected asymptotic performance for a feasible model of computation. This paper also establishes a tight tradeoff in the number of random seeds that must be precomputed for a random function that runs in time T and is h-wise independent.