Noisy Broadcast Problem

Rutgers University (2009)

Navin Goyal, Lower Bounds, Noisy Broadcast Problem

We prove the first non-trivial (superlinear) lower bound in the noisy broadcast model of distributed computation. In this model, there are n +1processors P0,P1,...,Pn. Each Pi, fori ≥ 1, initially...

Rutgers University (2008)

Navin Goyal, Lower Bounds, Noisy Broadcast Problem

We prove the first non-trivial (superlinear) lower bound in the noisy broadcast model of distributed computation. In this model, there are n +1processors P0,P1,...,Pn. Each Pi, fori ≥ 1, initially...