More analysis of double hashing
From MaRDI portal
Publication:2367445
DOI10.1007/BF01202791zbMath0770.68071MaRDI QIDQ2367445
George S. Lueker, Mariko Molodowitch
Publication date: 16 August 1993
Published in: Combinatorica (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Arithmetic progressions (11B25)
Related Items (6)
More analysis of double hashing ⋮ Less hashing, same performance: Building a better Bloom filter ⋮ DOUBLE HASHING WITH MULTIPLE PASSBITS ⋮ The analysis of hashing with lazy deletions ⋮ Hashing via finite field ⋮ Load Thresholds for Cuckoo Hashing with Double Hashing
Cites Work
- Unnamed Item
- The analysis of double hashing
- There is no fast single hashing algorithm
- More analysis of double hashing
- The cost distribution of clustering in random probing
- Uniform hashing is optimal
- 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
This page was built for publication: More analysis of double hashing
