|
34
|
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
|
|
1
|
Fractional Matching via Balls-and-Bins
– Rajeev Motwani, Rina Panigrahy, Ying Xu
|
|
13
|
Perfectly balanced allocation
– Artur Czumaj, Chris Riley, Christian Scheideler
- 2003
|
|
7
|
Hash-Based Techniques for High-Speed Packet Processing
– Adam Kirsch, Michael Mitzenmacher, George Varghese
|
|
13
|
Efficient hashing with lookups in two memory accesses, in: 16th
– Rina Panigrahy
|
|
15
|
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
|
|
3
|
TWO-WAY CHAINING WITH REASSIGNMENT
– Ketan Dalal, Luc Devroye, Ebrahim Malalla, Erin Mcleish
|
|
1
|
Symmetric vs. Asymmetric Multiple-Choice Algorithms
– Berthold Vöcking
|
|
12
|
Asynchronous scheduling of redundant disk arrays
– Peter Sanders
- 2000
|
|
51
|
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
|
|
7
|
The Random Graph Threshold for k-orientiability and a Fast Algorithm for Optimal Multiple-Choice Allocation
– Julie Anne Cain, et al.
- 2006
|
|
6
|
History-Independent Cuckoo Hashing
– Moni Naor, Gil Segev, Udi Wieder
|
|
8
|
Succinct Data Structures for Retrieval and Approximate Membership
– Martin Dietzfelbinger, Rasmus Pagh
|
|
4
|
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
– Yuriy Arbitman, Moni Naor, Gil Segev
|
