Cuckoo hashing: Further analysis
From MaRDI portal
Publication:1007604
DOI10.1016/S0020-0190(02)00500-8zbMath1162.68832MaRDI QIDQ1007604
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
algorithmsprobabilistic analysis of algorithmshashingcuckoo hashingopen addressingcollision resolutionworst-case search time
Related Items (10)
Sharp load thresholds for cuckoo hashing ⋮ Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables ⋮ An improved version of cuckoo hashing: average case analysis of construction cost and search operations ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Explicit and efficient hash families suffice for cuckoo hashing with a stash ⋮ Dynamic space efficient hashing ⋮ Layered hashing algorithm for real-time systems ⋮ Pseudo-random graphs and bit probe schemes with one-sided error ⋮ Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes ⋮ Dynamic Space Efficient Hashing.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Balanced allocations (extended abstract)
- The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- Membership in Constant Time and Almost-Minimum Space
- Balanced Allocations
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Studying Balanced Allocations with Differential Equations
- Polynomial hash functions are reliable
- Probability Inequalities for Sums of Bounded Random Variables
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: Cuckoo hashing: Further analysis