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)

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

zbMATH Keywords

randomizationdouble hashing

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• Less hashing, same performance: Building a better Bloom filter
• Hashing via finite field
• The analysis of double hashing
• Analysis of random probing hashing
• DOUBLE HASHING WITH MULTIPLE PASSBITS
• The analysis of hashing with lazy deletions
• Double hashing with passbits
• Load Thresholds for Cuckoo Hashing with Double Hashing
• On optimal arrangements of keys with double 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)