Perfect-information leader election with optimal resilience

SIAM Journal on Computing

Volumn 29, Issue 4, 2000, Pages 1304-1320

  Boppana, Ravi B ^a   Narayanan, Babu O ^b  

^a Bloomberg LP   (United States)

^b QUALCOMM INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; PROBABILITY; PROBLEM SOLVING;

DISTRIBUTED COMPUTING; OPTIMAL RESILIENCE; PERFECT INFORMATION LEADER ELECTION;

INFORMATION THEORY;

EID: 0033700150     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796307182     Document Type: Article

References (17)

1. M. AJTAI AND N. LINIAL, The influence of large coalitions, Combinatorica, 13 (1993), pp. 129-145.
2. N. ALON AND M. NAOR, Coin-flipping games immune against linear-sized coalitions, SIAM J. Comput., 22 (1993), pp. 403-417.
3. N. ALON AND M. O. RABIN, Biased coins and randomized algorithms, in Advances in Computing Research 5: Randomness and Computation, S. Micali, ed., JAI Press, Greenwich, CT, 1989, pp. 499-507.
4. M. BEN-OR AND N. LINIAL, Collective coin flipping, in Advances in Computing Research 5: Randomness and Computation, S. Micali, ed., JAI Press, Greenwich, CT, 1989, pp. 91-115.
5. M. BEN-OR, N. LINIAL, AND M. E. SAKS, Collective coin flipping and other models of imperfect randomness, in Proceedings of the 7th Hungarian Colloquium on Combinatorics, Colloquia Mathematica Societatis Janós Bolyai 52, A. Hajnal, L. Lovász, and V. T. Sós, eds., North-Holland, Amsterdam, 1988, pp. 75-112.
6. R. B. BOPPANA AND B. O. NARAYANAN, The biased coin problem, in Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 1993, pp. 252-257.
7. R. B. BOPPANA AND B. O. NARAYANAN, The biased coin problem, SIAM J. Discrete Math., 9 (1996), pp. 29-36.
8. B. CHOR AND C. DWORK, Randomization in Byzantine agreement, Adv. Comput. Res., 5 (1989), pp. 443-498.
9. J. COOPER AND N. LINIAL, Fast perfect-information leader-election protocols with linear immunity, Combinatorica, 15 (1995), pp. 319-332.
10. P. FELDMAN AND S. MICALI, An optimal probabilistic protocol for synchronous Byzantine agreement, SIAM J. Comput., 26 (1997), pp. 873-933.
11. W. FELLER, An Introduction to Probability Theory and Its Applications, vol. 1, 3rd ed., John Wiley and Sons, New York, 1968.
12. G. H. HARDY, J. E. LITTLEWOOD, AND G. PÓLYA, Inequalities, 2nd ed., Cambridge University Press, Cambridge, UK, 1952.
13. N. LINIAL, Game-theoretic aspects of computing, in Handbook of Game Theory with Economic Applications, vol. II, R. J. Aumann and S. Hart, eds., North-Holland, Amsterdam, 1994, pp. 1339-1395.
14. R. OSTROVSKY, S. RAJAGOPALAN, AND U. V. VAZIRANI, Simple and efficient leader election in the full information model, in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1994, pp. 234-242.
15. A. RUSSELL AND D. ZUCKERMAN, Perfect information leader election in log* n + O(1) rounds, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998.
16. M. E. SAKS, A robust noncryptographic protocol for collective coin flipping, SIAM J. Discrete Math., 2 (1989), pp. 240-244.
17. D. ZUCKERMAN, Randomness-optimal sampling, extractors, and constructive leader election, in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 1996, pp. 286-295.