Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
The design and analysis of coalesced hashing
The design and analysis of coalesced hashing
More analysis of double hashing
STOC '88 Proceedings of the twentieth 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
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Analysis of the Search Performance of Coalesced Hashing
Journal of the ACM (JACM)
Handling identifies as internal symbols in language processors
Communications of the ACM
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
Algorithms and theory of computation handbook
| Hi-index | 0.00 |