|
210
|
Balanced Allocations
– Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
- 1994
|
|
71
|
How Asymmetry Helps Load Balancing
– Berthold Vöcking
- 1999
|
|
27
|
Geometric Generalizations of the Power of Two Choices
– John Byers, Jeffrey Considine, Michael Mitzenmacher
- 2003
|
|
159
|
The Power of Two Choices in Randomized Load Balancing
– Michael David Mitzenmacher
- 1996
|
|
51
|
BALANCED ALLOCATIONS: THE HEAVILY LOADED CASE
– Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
- 2006
|
|
51
|
Parallel Randomized Load Balancing
– Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Rasmussen
- 1995
|
|
79
|
The Power of Two Random Choices: A Survey of Techniques and Results
– Michael Mitzenmacher, Andréa W. Richa, Ramesh Sitaraman
- 2000
|
|
52
|
"Balls into Bins" - A Simple and Tight Analysis
– Martin Raab, Angelika Steger
- 1998
|
|
4
|
Handbook of Randomized Computing, chapter The power of two random choices: A survey of the techniques and results
– Michael Mitzenmacher, Andrèa Richa, Ramesh Sitaraman
- 2000
|
|
2
|
Friedhelm Meyer auf der Heide, and Klaus Schröder. Allocating weighted jobs in parallel
– Petra Berenbrink
- 1999
|
|
75
|
Simple Load Balancing for Distributed Hash Tables
– John Byers, Jeffrey Considine, Michael Mitzenmacher
- 2002
|
|
42
|
Load balancing and density dependent jump Markov processes
– M Mitzenmacher
- 1996
|
|
117
|
Concentration, Probabilistic methods for algorithmic discrete mathematics
– C McDiarmid
|
|
192
|
A Brief History of Generative Models for Power Law and Lognormal Distributions
– Michael Mitzenmacher
|
|
130
|
Path coupling: A technique for proving rapid mixing in markov chains
– R Bubley, M Dyer
- 1997
|
|
3028
|
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications
– Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan
- 2001
|
|
5
|
Balanced Allocations: The Weighted Case
– Kunal Talwar, Udi Wieder
- 2008
|
|
7
|
Panigrahy: Balanced allocation on graphs
– Krishnaram Kenthapadi, Rina
|
|
70
|
Expected length of the longest probe sequence in hash code searching
– G H Gonnet
- 1981
|