A new universal class of hash functions and dynamic hashing in real time
- 27 June 2005
- book chapter
- Published by Springer Nature
- p. 6-19
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Not all keys can be hashed in constant time1990
- How to distribute a dictionary in a complete network1990
- An optimal parallel dictionary1989
- The generation of random permutations on the flyInformation Processing Letters, 1988
- A complexity theory of efficient parallel algorithms1988
- Probabilistic Analysis of Algorithms1987
- Storing a dynamic sparse table1986
- Parallel hashing---an efficient implementation of shared memory1986
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979