Dynamic Hashing in Real Time
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A complexity theory of efficient parallel algorithmsTheoretical Computer Science, 1990
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- The generation of random permutations on the flyInformation Processing Letters, 1988
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Data Structures and Algorithms 1Published by Springer Nature ,1984
- Expected Length of the Longest Probe Sequence in Hash Code SearchingJournal of the ACM, 1981
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963