Lower bounds for leader election and collective coin-flipping in the perfect information model

Authors:
Alexander Russell;Michael Saks;David Zuckerman
Affiliations:
Computer Science Division, University of California, Berkeley, Berkeley, CA;Department of Mathematics, Rutgers University, Piscataway, NJ;Computer Science Division, University of California, Berkeley, Berkeley, CA
Venue:
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Year:
1999

A robust noncrytographic protocol for collective coin flipping

SIAM Journal on Discrete Mathematics
Coin-flipping games immune against linear-sized coalitions

SIAM Journal on Computing
Randomized algorithms

Randomized algorithms
Perfect Information Leader Election in log^* n + O(1) Rounds

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The influence of variables on Boolean functions

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science

Noncryptographic Selection Protocols

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Hundreds of impossibility results for distributed computing

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Randomization helps to perform independent tasks reliably

Random Structures & Algorithms
The round complexity of two-party random selection

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Scalable leader election

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fast leader-election protocols with bounded cheaters' edge

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Lower bound for scalable Byzantine Agreement

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

Hi-index	0.01