Sciweavers

21 search results - page 2 / 5
» Cuckoo Hashing
Sort
View
ACSC
2009
IEEE
13 years 11 months ago
Fast and Compact Hash Tables for Integer Keys
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...
Nikolas Askitis
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
13 years 11 months ago
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
Eric Lehman, Rina Panigrahy
ICALP
2010
Springer
13 years 9 months ago
Tight Thresholds for Cuckoo Hashing via XORSAT
We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a s...
Martin Dietzfelbinger, Andreas Goerdt, Michael Mit...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 4 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy