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

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

Active Bibliography

9 Balanced Allocation on Graphs – Krishnaram Kenthapadi, Rina Panigrahy - 2006
47 Space Efficient Hash Tables With Worst Case Constant Access Time – Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis - 2003
Hash-Based Data Structures for Extreme Conditions – Adam Lavitt Kirsch - 2008
19 Perfectly balanced allocation – Artur Czumaj, Chris Riley, Christian Scheideler - 2003
1 Fractional Matching via Balls-and-Bins – Rajeev Motwani, Rina Panigrahy, Ying Xu
9 Hash-Based Techniques for High-Speed Packet Processing – Adam Kirsch, Michael Mitzenmacher, George Varghese
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
21 Almost Random Graphs with Simple Hash Functions – Martin Dietzfelbinger, Philipp Woelfel - 2003
1 Random Arc Allocation and Applications to Disks, Drums and DRAMs – Peter Sanders, Peter S, Berthold Vöcking - 2001
1 Symmetric vs. Asymmetric Multiple-Choice Algorithms – Berthold Vöcking
3 TWO-WAY CHAINING WITH REASSIGNMENT – Ketan Dalal, Luc Devroye, Ebrahim Malalla, Erin Mcleish
13 Asynchronous scheduling of redundant disk arrays – Peter Sanders - 2000
13 Succinct Data Structures for Retrieval and Approximate Membership – Martin Dietzfelbinger, Rasmus Pagh
CIS 786: Approximation and Randomized Algorithms September 24, 2004 Lecture 4 – Lecturer Artur Czumaj, Scribe Nitesh, B. Guinde
58 BALANCED ALLOCATIONS: THE HEAVILY LOADED CASE – Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking - 2006
1 Tail bounds and expectations for random arc allocation and applications – Peter S, Berthold Vöcking
1 Orientability thresholds for random hypergraphs – Pu Gao, Nicholas Wormald
1 Tail bounds and expectations for random arc allocation and applications – Peter Sanders, Berthold Vöcking - 2002