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

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

Documents Related by Co-Citation

10 De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results – Yuriy Arbitman, Moni Naor, Gil Segev
124 Cuckoo hashing – Rasmus Pagh, Flemming Friche Rodler - 2001
10 Simulating uniform hashing in constant time and optimal space – Anna Pagh, Rasmus Pagh - 2003
669 Universal classes of hash functions – L Carter, M Wegman - 1979
27 Succinct dynamic dictionaries and trees – R Raman, S S Rao
1456 Space/Time Trade-offs in Hash Coding with Allowable Errors – Burton H. Bloom - 1970
681 Summary cache: A scalable wide-area web cache sharing protocol – Li Fan, Pei Cao, Jussara Almeida, Andrei Z. Broder - 1998
4 Fast Allocation and Deallocation with an Improved Buddy System – Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro - 2003
255 Sorting and Searching, volume 3 of The Art of Computer Programming – Donald E Knuth - 1998
281 Probability and Computing : Randomized Algorithms and Probabilistic Analysis – Michael Mitzenmacher, Eli Upfal - 2005
11 Using a Queue to De-amortize Cuckoo Hashing in Hardware – A Kirsch, M Mitzenmacher - 2007
19 More Robust Hashing: Cuckoo Hashing with a Stash – Adam Kirsch, Michael Mitzenmacher, Udi Wieder - 2008
13 Succinct Data Structures for Retrieval and Approximate Membership – Martin Dietzfelbinger, Rasmus Pagh
5 Incremental Bloom filters – F Hao, M S Kodialam, T V Lakshman
6 Applications of a splitting trick – M Dietzfelbinger, M Rink
3 A lower bound for dynamic approximate membership data structures – S Lovett, E Porat
2 Compressed static functions with applications to other dictionary problems – D Belazzougui, R Venturini - 2013
2 DBA: A dynamic Bloom filter array for scalable membership representation of variable large data sets – J Wei, H Jiang, K Zhou, D Feng
29 Cell probe complexity - a survey – Peter Bro Miltersen