Balanced allocation and dictionaries with tightly packed constant size bins (2007)

by Martin Dietzfelbinger, et al.
Citations:29 - 1 self

Documents Related by Co-Citation

124 Cuckoo hashing – Rasmus Pagh, Flemming Friche Rodler - 2001
47 Space Efficient Hash Tables With Worst Case Constant Access Time – Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis - 2003
19 More Robust Hashing: Cuckoo Hashing with a Stash – Adam Kirsch, Michael Mitzenmacher, Udi Wieder - 2008
68 Using Multiple Hash Functions to Improve IP Lookups – Michael Mitzenmacher, Andrei Broder - 2000
33 Why simple hash functions work: Exploiting the entropy in a data stream – Michael Mitzenmacher, Salil Vadhan - 2008
11 Using a Queue to De-amortize Cuckoo Hashing in Hardware – A Kirsch, M Mitzenmacher - 2007
16 Efficient hashing with lookups in two memory accesses, in: 16th – Rina Panigrahy
6 Bipartite Random Graphs and Cuckoo Hashing – Reinhard Kutzelnigg - 2006
254 Balanced Allocations – Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal - 1994
15 The power of one move: Hashing schemes for hardware – Adam Kirsch, Michael Mitzenmacher - 2008
669 Universal classes of hash functions – L Carter, M Wegman - 1979
17 Cuckoo hashing: Further analysis – Luc Devroye, Pat Morin, Communicated F. Dehne - 2003
61 The Bloomier filter: An efficient data structure for static support lookup tables – Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal - 2004
47 Multilevel Adaptive Hashing – A Broder, A Karlin - 1990
21 Almost Random Graphs with Simple Hash Functions – Martin Dietzfelbinger, Philipp Woelfel - 2003
9 History-Independent Cuckoo Hashing – Moni Naor, Gil Segev, Udi Wieder
82 How Asymmetry Helps Load Balancing – Berthold Vöcking - 1999
222 Storing a sparse table with O(1) worst case access time – M L Fredman, J Komlós, E Szemerédi - 1984
11 Efficient hash probes on modern processors – Kenneth A. Ross - 2007