Double Hashing
Double Hashing is a collision resolution technique in hash tables that uses a secondary hash function to determine the probe interval, thereby reducing clustering and improving distribution compared to fixed-interval probing methods.
25
Publications
984
Citations
72
Authors
45
Institutions
Publications per year
2017–2026
11
Parents
25
Per-Åke Larson · Communications of the ACM · 1988 · 105 citations · Full text
The analysis of double hashing
Leo J. Guibas, Endre Szemerédi · Journal of Computer and System Sciences · 1978 · 67 citations
Weighted distributed hash tables
Christian Schindelhauer, Gunnar Schomaker · 2005 · 46 citations
1–5 of 25
72
Institut national de recherche en sciences et technologies du numérique, France
2 publications · 38 citations
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 72
45
University of California, Irvine
Irvine, United States
2 h-index
3 publications
68 citations
National Taiwan University of Science and Technology
Taipei, Taiwan
1 h-index
3 publications
78 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
1 h-index
1 publications
301 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
301 citations
Shandong Institute of Automation
Jinan, China
1 h-index
1 publications
25 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
105 citations
Institute of Information Engineering
Beijing, China
1 h-index
1 publications
25 citations
Universiti Malaysia Perlis
Perlis, Malaysia
1 h-index
1 publications
13 citations
1–8 of 45
2 publications · 126 citations
2
h-index
Conference · 1 publications · 27 citations
1
h-index
1 publications · 67 citations
1
h-index
1 publications · 11 citations
1
h-index
Conference · 1 publications · 86 citations
1
h-index
1–5