Cuckoo Hashing (2001)

by Rasmus Pagh , Flemming Friche Rodler
Citations:125 - 6 self

Active Bibliography

Hash-Based Data Structures for Extreme Conditions – Adam Lavitt Kirsch - 2008
9 Hash-Based Techniques for High-Speed Packet Processing – Adam Kirsch, Michael Mitzenmacher, George Varghese
47 Space Efficient Hash Tables With Worst Case Constant Access Time – Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis - 2003
17 Cuckoo hashing: Further analysis – Luc Devroye, Pat Morin, Communicated F. Dehne - 2003
On Worst Case Robin-Hood Hashing – Luc Devroye, Pat Morin, Alfredo Viola - 2004
34 Why simple hash functions work: Exploiting the entropy in a data stream – Michael Mitzenmacher, Salil Vadhan - 2008
4 Lossy Dictionaries – Rasmus Pagh, Flemming Friche Rodler - 2001
9 Faster Deterministic Dictionaries – Rasmus Pagh, Rasmus Pagh, Rasmus Pagh - 1999
21 Almost Random Graphs with Simple Hash Functions – Martin Dietzfelbinger, Philipp Woelfel - 2003
3 TWO-WAY CHAINING WITH REASSIGNMENT – Ketan Dalal, Luc Devroye, Ebrahim Malalla, Erin Mcleish
10 De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results – Yuriy Arbitman, Moni Naor, Gil Segev
10 Simple Summaries for Hashing with Multiple Choices – Adam Kirsch , Michael Mitzenmacher
4 Simple Fast Parallel Hashing by Oblivious Execution – Joseph Gil, Yossi Matias - 1994
3 Some Open Questions Related to Cuckoo Hashing – Michael Mitzenmacher
57 Fast hash table lookup using extended Bloom filter: an aid to network processing – Haoyu Song, Sarang Dharmapurikar, Jonathan Turner, John Lockwood - 2005
Spring ’12 Scribe Notes Collection – Prof Erik Demaine, Ta Tom Morgan, Justin Zhang, Editing Justin, Zhang Contents
1 A New Trade-off for Deterministic Dictionaries – Rasmus Pagh - 2000
18 Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time – Rasmus Pagh - 1998
10 Perfect hashing for network applications – Yi Lu, Balaji Prabhakar - 2006