Cuckoo hashing: Further analysis
From MaRDI portal
Publication:1007604
DOI10.1016/S0020-0190(02)00500-8zbMATH Open1162.68832MaRDI QIDQ1007604FDOQ1007604
Authors: Pat Morin, Luc Devroye 
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
algorithmsprobabilistic analysis of algorithmshashingcuckoo hashingopen addressingcollision resolutionworst-case search time
Cites Work
- Title not available (Why is that?)
- Probability Inequalities for Sums of Bounded Random Variables
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Title not available (Why is that?)
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Balanced Allocations
- Polynomial hash functions are reliable (extended abstract)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Title not available (Why is that?)
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- Title not available (Why is that?)
- Title not available (Why is that?)
- Membership in Constant Time and Almost-Minimum Space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Balanced allocations (extended abstract)
- The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
- Studying Balanced Allocations with Differential Equations
Cited In (25)
- Wear minimization for cuckoo hashing: how not to throw a lot of eggs into one basket
- Cuckoo hashing with pages
- Layered hashing algorithm for real-time systems
- Load Thresholds for Cuckoo Hashing with Overlapping Blocks
- Dynamic space efficient hashing
- Dynamic space efficient hashing
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Explicit and efficient hash families suffice for cuckoo hashing with a stash
- Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
- On the insertion time of random walk cuckoo hashing
- An Analysis of Random-Walk Cuckoo Hashing
- Pseudo-random graphs and bit probe schemes with one-sided error
- On the insertion time of random walk cuckoo hashing
- Some Open Questions Related to Cuckoo Hashing
- Sharp load thresholds for cuckoo hashing
- Title not available (Why is that?)
- An analysis of random-walk cuckoo hashing
- A precise analysis of cuckoo hashing
- An improved version of cuckoo hashing: average case analysis of construction cost and search operations
- Bipartite random graphs and Cuckoo hashing
- On the insertion time of cuckoo hashing
- 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
- Space efficient hash tables with worst case constant access time
- On risks of using cuckoo hashing with simple universal hash classes
This page was built for publication: Cuckoo hashing: Further analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007604)
