More Robust Hashing: Cuckoo Hashing with a Stash (2008)

by Adam Kirsch , Michael Mitzenmacher , Udi Wieder
Citations:19 - 5 self

Active Bibliography

2 Some Open Questions Related to Cuckoo Hashing – Michael Mitzenmacher
4 An Analysis of Random-Walk Cuckoo Hashing – Alan Frieze, Páll Melsted, Michael Mitzenmacher
9 Maximum matchings in random bipartite graphs and the space utilization of cuckoo hashtables – Alan Frieze, Páll Melsted - 2009
9 Hash-Based Techniques for High-Speed Packet Processing – Adam Kirsch, Michael Mitzenmacher, George Varghese
9 History-Independent Cuckoo Hashing – Moni Naor, Gil Segev, Udi Wieder
10 De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results – Yuriy Arbitman, Moni Naor, Gil Segev
4 Fast and compact hash tables for integer keys – Nikolas Askitis
Hash-Based Data Structures for Extreme Conditions – Adam Lavitt Kirsch - 2008
7 Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation – Yuriy Arbitman, Moni Naor, Gil Segev - 2010
Pursuing the Giant in Random Graph Processes – Michael Drmota, Mihyun Kang, Konstantinos Panagiotou - 2013
16 Efficient hashing with lookups in two memory accesses, in: 16th – Rina Panigrahy
15 Real-time parallel hashing on the gpu – Dan A. Alcantara, Andrei Sharf, Fatemeh Abbasinejad, Shubhabrata Sengupta, Michael Mitzenmacher, John D. Owens, Nina Amenta - 2009
5 Optimal fast hashing – Yossi Kanizo, David Hay, Isaac Keslassy - 2009
15 Linear probing with constant independence – Anna Pagh, Rasmus Pagh - 2007
Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability – Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher
9 Oblivious RAM Revisited – Benny Pinkas, Tzachy Reinman
3 TWO-WAY CHAINING WITH REASSIGNMENT – Ketan Dalal, Luc Devroye, Ebrahim Malalla, Erin Mcleish
Maximum Bipartite Matching Size And Application to Cuckoo Hashing ∗ – Yossi Kanizo, Isaac Keslassy, David Hay
9 Balanced Allocation on Graphs – Krishnaram Kenthapadi, Rina Panigrahy - 2006