27 citations · 27 across the 1 of their papers we have counts for
2 papers
cs.DC2012
Fast Routing Table Construction Using Small Messages
Christoph Lenzen, Boaz Patt-Shamir
We describe a distributed randomized algorithm computing approximate distances and routes that approximate shortest paths. Let n denote the number of nodes in the graph, and let HD…
cs.CC2011★ 27 cited
Tight Bounds for Parallel Randomized Load Balancing
Christoph Lenzen, Roger Wattenhofer
We explore the fundamental limits of distributed balls-into-bins algorithms. We present an adaptive symmetric algorithm that achieves a bin load of two in log* n+O(1) communication…