Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation (2010)

by Yuriy Arbitman , Moni Naor , Gil Segev
Citations:7 - 3 self

Active Bibliography

Hash-Based Data Structures for Extreme Conditions – Adam Lavitt Kirsch - 2008
17 Cuckoo hashing: Further analysis – Luc Devroye, Pat Morin, Communicated F. Dehne - 2003
9 Hash-Based Techniques for High-Speed Packet Processing – Adam Kirsch, Michael Mitzenmacher, George Varghese
5 Compact Dictionaries for Variable-Length Keys and Data, with Applications – Daniel K. Blandford, Guy E. Blelloch - 2007
47 Space Efficient Hash Tables With Worst Case Constant Access Time – Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis - 2003
10 De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results – Yuriy Arbitman, Moni Naor, Gil Segev
13 Succinct Data Structures for Retrieval and Approximate Membership – Martin Dietzfelbinger, Rasmus Pagh
3 TWO-WAY CHAINING WITH REASSIGNMENT – Ketan Dalal, Luc Devroye, Ebrahim Malalla, Erin Mcleish
11 Simple Summaries for Hashing with Multiple Choices – Adam Kirsch , Michael Mitzenmacher
31 Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines – Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese - 2006
for Transactional Memory Systems – Daniel Sanchez, Daniel Sanchez
33 Implementing signatures for transactional memory – Daniel Sanchez, Luke Yen, Mark D. Hill, Karthikeyan Sankaralingam - 2007
61 The Bloomier filter: An efficient data structure for static support lookup tables – Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal - 2004
33 Why simple hash functions work: Exploiting the entropy in a data stream – Michael Mitzenmacher, Salil Vadhan - 2008
4 Compact Data Structures with Fast Queries – Daniel K. Blandford, Christos Faloutsos, Danny Sleator - 2005
Succincter – Mihai Patrascu
On Worst Case Robin-Hood Hashing – Luc Devroye, Pat Morin, Alfredo Viola - 2004
2 Some Open Questions Related to Cuckoo Hashing – Michael Mitzenmacher
28 Less hashing, same performance: Building a better bloom filter – Adam Kirsch, Michael Mitzenmacher - 2006