Distributed Consensus Revisited
暂无分享,去创建一个
[1] Yoram Moses,et al. Fully polynomial Byzantine agreement in t + 1 rounds , 1993, STOC.
[2] Rida A. Bazzi,et al. Using Knowledge to Optimally Achieve Coordination in Distributed Systems , 1992, Theor. Comput. Sci..
[3] Piotr Berman,et al. Bit optimal distributed consensus , 1992 .
[4] Piotr Berman,et al. Efficient distributed consensus with n=(3 + ɛ)t processors , 1991 .
[5] Gil Neiger,et al. Automatically Increasing the Fault-Tolerance of Distributed Algorithms , 1990, J. Algorithms.
[6] Soma Chaudhuri,et al. Agreement is harder than consensus: set consensus problems in totally asynchronous systems , 1990, PODC '90.
[7] Piotr Berman,et al. Towards optimal distributed consensus , 1989, 30th Annual Symposium on Foundations of Computer Science.
[8] 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.
[9] Danny Dolev,et al. Shifting gears: changing algorithms on the fly to expedite Byzantine agreement , 1987, PODC '87.
[10] Yoram Moses,et al. Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.
[11] Vassos Hadzilacos,et al. Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing) , 1985 .
[12] Brian A. Coan,et al. Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement , 1984, Inf. Process. Lett..
[13] Kenneth Jay Perry. Early Stopping Protocols for Fault-Tolerant Distributed Agreement , 1985 .
[14] Michael J. Fischer,et al. The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.
[15] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.
[16] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[17] Nancy A. Lynch,et al. An Efficient Algorithm for Byzantine Agreement without Authentication , 1982, Inf. Control..
[18] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[19] Arkady Zamsky,et al. Optimal time Byzantine Agreement for t < n/8 with linear-messages* , .