Bipartite Random Graphs and Cuckoo Hashing by Reinhard Kutzelnigg

“…The aim of this paper is to extend the analysis of Cuckoo Hashing of Devroye and Morin in 2003. In particular we make several asymptotic results much more precise. …”
Get full text

Hardness-Preserving Reductions via Cuckoo Hashing by Berman, Itay, Haitner, Iftach, Komargodski, Ilan, Naor, Moni

“…In this work, we show how to go beyond the aforementioned birthday attack barrier by replacing the above simple hashing approach with a variant of cuckoo hashing, a hashing paradigm that resolves collisions in a table by using two hash functions and two tables, cleverly assigning each element to one of the two tables. …”
Get full text

A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess r by Reinhard Kutzelnigg

Subjects: Get full text

Analysing the Performance of GPU Hash Tables for State Space Exploration by Nathan Cassee, Anton Wijs

“…We conclude that Cuckoo hashing is three times faster than GPUexplore hashing for random data, and that Cuckoo hashing is five to nine times faster for non-random data. …”
Get full text

Detection and Mitigation of SYN Flooding Attacks through SYN/ACK Packets and Black/White Lists by Chun-Hao Yang, Jhen-Ping Wu, Fang-Yi Lee, Ting-Yu Lin, Meng-Hsun Tsai

“…We combine those modules, which have evolved from the cuckoo hashing method and innovative whitelist, to get better performance compared to current methods Our approach reduces the traffic through the switch and improves detection accuracy, also the required register size is reduced by half for the same accuracy.…”
Get full text

CoDi$: Randomized Caches Through Confusion and Diffusion by Luis Fiolhais, Manuel Goulao, Leonel Sousa

“…CoDi<inline-formula> <tex-math notation="LaTeX">$\$ $ </tex-math></inline-formula> is able to evict any cached address by allowing addresses to be displaced in two levels of freedom, through hopscotch (local state) and cuckoo hashing (global state), without increasing the hit latency. …”
Get full text

IcebergHT: High Performance Hash Tables Through Stability and Low Associativity by Pandey, Prashant, Bender, Michael A., Conway, Alex, Farach-Colton, Martin, Kuszmaul, William, Tagliavini, Guido, Johnson, Rob

“…In contrast, existing hash-tables either modify numerous cache lines during insertions (e.g. cuckoo hashing), access numerous cache lines during queries (e.g. linear probing), or waste space (e.g. chaining). …”
Get full text

Comparison on Search Failure between Hash Tables and a Functional Bloom Filter by Hayoung Byun, Hyesook Lim

“…In search failure rates, we theoretically compare the FBF with hash-based data structures, such as multi-hash table, cuckoo hash table, and <i>d</i>-left hash table. We also provide simulation results to prove the validity of our theoretical results. …”
Get full text