Scalable leader election

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 990-999

  King, Valerie ^a   Saia, Jared ^b   Sanwalani, Vishal ^b   Vee, Erik ^c  

^a UNIVERSITY OF VICTORIA   (Canada)

^b University of New Mexico   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT PROBABILITY; INFORMATION MODEL; POLYLOGARITHMIC MESSAGE; SUBLINEAR NUMBER;

DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBABILITY; PROGRAM PROCESSORS;

PROBLEM SOLVING;

EID: 33244463798     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109667     Document Type: Conference Paper

References (19)

1. M. Ajtai and N. Linial. The influence of large coalitions. Technical Report 7133(67380), IBM, 1989.
2. N. Alon and M. Naor. Coin-flipping games immune against linear-sized coalitions. In Proceedings of the IEEE Foundations of Computer Science (FOCS), 1990.
3. Ben-Or, N. Linial, and M. Saks. Collective coin flipping and other models of imperfect randomoness. In Colloq. Math Soc. Janos Bolyai No., 52 Combinatorics, 1987.
4. Michael Ben-Or and Nathan Linial. Collective coin flipping and other models of imperfect randomness. In Proceedings of the IEEE Foundations of Computer Science(FOCS), 1985.
5. Michael Ben-Or and Nathan Linial. Collective coin flipping. Advances in Computing Research, pages 91-115, 1989. JAI Press; Silvio Micali, editor.
6. R. Boppana and B. Narayanan. Collective coin flipping and leader election with optimal immunity. manuscript.
7. R. Boppana and B. Narayanan. The biased coin problem. In Proceedings of the Symposium on the Theory of Computing (STOC), 1993.
8. Gabriel Bracha. An o(logn) expected rounds randomized byzantine generals protocol. In Proceedings of the ACM Symposium on the Theory of Computation(STOC), 1985.
9. Jason Cooper and Nathan Linial. Fast perfect-information leader-election protocol with linear immunity. Combinatorica, 15:319-332, 1995.
10. D. Dolev, M. Fischer, R. Fowler, N. Lynch, and H. Strong. An efficient algorithm for byzantine agreement without authentication. Information and Control, 1982.
11. C. Dwork, D. Peleg, N. Pippenger, and E. Upfal. Fault tolerance in networks of bounded degree. SIAM Journal on Computing, 17:975-988, 1988.
12. Uriel Feige. Noncryptographic selection protocols. In Proceedings of 40th IEEE Foundations of Computer Science(FOCS), 1999.
13. J. Kahn, G. Kalai, and N. Linial. The influence of random variables on boolean functions. In Proceedings of 29th IEEE Foundations of Computer Science(FOCS), 1988.
14. N. Linial. Games computers play: Game-theoretic aspects of computing. Technical report, Hebrew University of Jerusalem, 1992.
15. R. Ostrovsky, S. Rajagoplan, and U. Vazirani. Simple and efficient leader election in the full information model. In Proceedings of the Twenty-Sixth Annual ACM Syposium on Theory of Computing, 1994.
16. A. Russell, M. Saks, and D. Zuckerman. Lower bounds for leader election and collective coin-flipping in the perfect information model. In Proceedings of the Symposium on the Theory of Computing (STOC), 1999.
17. A. Russell and D. Zuckerman. Perfect information leader election in log*n + o(1) rounds. In Proceedings of 39th Annual Symposium on Foundations of Computer Science(FOCS), 1998.
18. Michael Saks. A robust noncryptographic protocol for collective coin flipping. SIAM Journal of Discrete Mathematics, pages 240-244, 1989.
19. D. Zuckerman. Randomness-optimal oblivious sampling. Random Structures and Algorithms, 11:345-367, 1997.