Journal of the ACM (JACM)
More analysis of double hashing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Optimal Arrangement of Keys in a Hash Table
Journal of the ACM (JACM)
The Analysis of Hashing Techniques That Exhibit k-ary Clustering
Journal of the ACM (JACM)
Reducing the retrieval time of scatter storage techniques
Communications of the ACM
An Improved Program for Constructing Open Hash Tables
Proceedings of the 7th Colloquium on Automata, Languages and Programming
The analysis of an improved hashing technique
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The analysis of closed hashing under limited randomness
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A compendium of key search references
ACM SIGIR Forum
Hi-index | 0.01 |
A new approach to the analysis of random probing hashing algorithms is presented. The probability-generating function in closed form for the asymptotic cost of insertion via random probing with secondary clustering is derived. For higher-order clustering, it is shown that all the moments of the probability distribution of the insertion cost exist and are asymptotically equal to the corresponding moments of the cost distribution under uniform hashing. The method in this paper also leads to simple derivations for the expected cost of insertion for random probing with secondary and higher-order clustering.