New Imperfect Random Source with Applications to Coin-Flipping
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Noncryptographic Selection Protocols
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The round complexity of two-party random selection
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fast leader-election protocols with bounded cheaters' edge
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Random selection with an adversarial majority
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |
This paper investigates the leader-election problem in the perfect-information model of distributed computing. It is shown that for every $\epsilon