Lower Bounds for Distributed Coin Flipping and Randomized Consensus
James Aspnes
forms the basis of the consensus lower b ound but is in Abstract
teresting in its own right
We examine a class of col lective coin ipping games
Consensus is a fundamental problem in distributed
that arises from randomized distributed algorithms with
computing in which a group of pro cesses must agree on
halting failures In these games a sequence of local coin
a bit despite the interference of an adversary An addi