Simple and efficient leader election in the full information model
暂无分享,去创建一个
Rafail Ostrovsky | Umesh V. Vazirani | Sridhar Rajagopalan | R. Ostrovsky | U. Vazirani | S. Rajagopalan
[1] Cynthia Dwork,et al. Randomization in Byzantine Agreement , 1989, Adv. Comput. Res..
[2] Michael E. Saks. A Robust Noncryptographic Protocol for Collective Coin Flipping , 1989, SIAM J. Discret. Math..
[3] Nathan Linial,et al. Fast perfect-information leader-election protocols with linear immunity , 1993, Comb..
[4] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[5] Nathan Linial,et al. Fault-tolerant computation in the full information model , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[6] N. S. Barnett,et al. Private communication , 1969 .
[7] Gabriel Bracha,et al. An O(lg n) expected rounds randomized Byzantine generals protocol , 1985, STOC '85.
[8] Gabriel Bracha,et al. An O(log n) expected rounds randomized byzantine generals protocol , 1987, JACM.
[9] Nathan Linial,et al. The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[10] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[11] David Gillman,et al. A Chernoff bound for random walks on expander graphs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[12] Nathan Linial,et al. The influence of large coalitions , 1993, Comb..
[13] Nathan Linial,et al. Games Computers Play: Game-Theoretic Aspects of Computing , 1992 .
[14] Noga Alon,et al. Coin-Flipping Games Immune Against Linear-Sized Coalitions , 1993, SIAM J. Comput..
[15] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[16] Nathan Linial,et al. Collective Coin Flipping , 1989, Advances in Computational Research.
[17] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..
[18] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[19] Nathan Linial,et al. Collective coin flipping, robust voting schemes and minima of Banzhaf values , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[20] Silvio Micali,et al. Optimal algorithms for Byzantine agreement , 1988, STOC '88.
[21] Noga Alon,et al. Biased Coins and Randomized Algorithms , 1989, Advances in Computational Research.
[22] Ravi B. Boppana,et al. The biased coin problem , 1993, SIAM J. Discret. Math..