Uniform hashing in constant time and linear space
Authors:
Open Access
- 9 June 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 622-628
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A new universal class of hash functions and dynamic hashing in real time2005
- Almost random graphs with simple hash functions2003
- Min-Wise Independent PermutationsJournal of Computer and System Sciences, 2000
- Balanced AllocationsSIAM Journal on Computing, 1999
- Non-Expansive HashingCombinatorica, 1998
- Polynomial hash functions are reliable1992
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Eigenvalues and expandersCombinatorica, 1986
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979