Techniques for collision resolution in hash tables with open addressing

Authors:
J. Ian Munro;Pedro Celis
Affiliations:
Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1;-
Venue:
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Year:
1986

Citing 14
Cited 3

Robin Hood hashing

Robin Hood hashing
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
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)
Expected Length of the Longest Probe Sequence in Hash Code Searching

Journal of the ACM (JACM)
Analysis of Uniform Hashing

Journal of the ACM (JACM)
Hash Table Methods

ACM Computing Surveys (CSUR)
Packed scatter tables

Communications of the ACM
The reallocation of hash-coded tables

Communications of the ACM
Reducing the retrieval time of scatter storage techniques

Communications of the ACM
Analysis of a file addressing method

Communications of the ACM
Handbook of Algorithms

Handbook of Algorithms
Computational analysis of the random components induced by a binary equivalence relation

Computational analysis of the random components induced by a binary equivalence relation

Fast and compact hash tables for integer keys

ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
Redesigning the string hash table, burst trie, and BST to exploit cache

Journal of Experimental Algorithmics (JEA)
Cache-Conscious collision resolution in string hash tables

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract