More analysis of double hashing

DOI10.1007/BF01202791zbMATH Open0770.68071MaRDI QIDQ2367445FDOQ2367445

Authors George S. Lueker, Mariko Molodowitch

Publication date 16 August 1993

Published in Combinatorica (Search for Journal in Brave)

zbMATH Keywords

randomizationdouble hashing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Arithmetic progressions (11B25)

Recommendations

• The analysis of double hashing
• More analysis of double hashing for balanced allocations
• Analysis of random probing hashing
• Uniform Hashing in Constant Time and Optimal Space
• Double hashing with passbits

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A Note on the Efficiency of Hashing Functions
• Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation
• More analysis of double hashing
• Probability Inequalities for Sums of Bounded Random Variables
• The analysis of double hashing
• The cost distribution of clustering in random probing
• There is no fast single hashing algorithm
• Uniform hashing is optimal

Cited in

(11)

• Less hashing, same performance: Building a better Bloom filter
• DOUBLE HASHING WITH MULTIPLE PASSBITS
• Double hashing with passbits
• The analysis of double hashing
• Load thresholds for cuckoo hashing with double hashing
• More analysis of double hashing for balanced allocations
• Hashing via finite field
• The analysis of hashing with lazy deletions
• On optimal arrangements of keys with double hashing
• Analysis of random probing hashing
• More analysis of double hashing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367445)