92 citations · 220 across the 35 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2017★ 5 cited
On the complexity of hazard-free circuits
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen +3
The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows th…
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…