36 citations · 118 across the 28 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.PR2013★ 1 cited
Balls into bins via local search: cover time and maximum load
Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer +1
We study a natural process for allocating m balls into n bins that are organized as the vertices of an undirected graph G. Balls arrive one at a time. When a ball arrives, it first…
cs.DS2013★ 2 cited
Threshold Load Balancing in Networks
Martin Hoefer, Thomas Sauerwald
We study probabilistic protocols for concurrent threshold-based load balancing in networks. There are n resources or machines represented by nodes in an undirected graph and m >> n…