Sciweavers

6 search results - page 2 / 2
» New Circular Security Counterexamples from Decision Linear a...
Sort
View
FOCS
2005
IEEE
14 years 2 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks