Asymptotically Optimal Distributed Consensus (Extended Abstract)
暂无分享,去创建一个
[1] Danny Dolev,et al. Families of Consensus Algorithms , 1988, AWOC.
[2] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[3] Sam Toueg,et al. Fast Distributed Agreement , 1987, SIAM J. Comput..
[4] Brian A. Coan,et al. A communication-efficient canonical form for fault-tolerant distributed protocols , 1986, PODC '86.
[5] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .
[6] Béla Bollobás,et al. Random Graphs , 1985 .
[7] Danny Dolev,et al. Shifting gears: changing algorithms on the fly to expedite Byzantine agreement , 1987, PODC '87.
[8] Danny Dolev,et al. Polynomial algorithms for multiple processor agreement , 1982, STOC '82.
[9] Piotr Berman,et al. Towards optimal distributed consensus , 1989, 30th Annual Symposium on Foundations of Computer Science.
[10] Eli Upfal,et al. Fault tolerance in networks of bounded degree , 1986, STOC '86.
[11] Danny Dolev,et al. Early stopping in Byzantine agreement , 1990, JACM.
[12] Yoram Moses,et al. Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.