The analysis of double hashing

DOI10.1016/0022-0000(78)90046-6zbMath0369.68020OpenAlexW2055754268MaRDI QIDQ1243123

Endre Szemerédi, Leonidas J. Guibas

Publication date: 1978

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(78)90046-6

Mathematics Subject Classification ID

Searching and sorting (68P10) Arithmetic progressions (11B25) Randomized algorithms (68W20)

Related Items

More analysis of double hashing ⋮ Efficient utilization of shared caches in multicore architectures ⋮ Minimean optimal key arrangements in hash tables ⋮ Open-addressing hashing with unequal-probability keys ⋮ DOUBLE HASHING WITH MULTIPLE PASSBITS ⋮ Dynamic space efficient hashing ⋮ Hashing via finite field ⋮ Analysis of random probing hashing ⋮ Dynamic Space Efficient Hashing. ⋮ Hashing with Linear Probing under Nonuniform Probabilities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Analysis of Hashing Techniques That Exhibit k -ary Clustering
• Reducing the retrieval time of scatter storage techniques
• A Note on the Efficiency of Hashing Functions
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: The analysis of double hashing