Early stopping in Byzantine agreement
暂无分享,去创建一个
Danny Dolev | Rüdiger Reischuk | H. Raymond Strong | H. R. Strong | D. Dolev | R. Reischuk | H. Strong
[1] Journal of the Association for Computing Machinery , 1961, Nature.
[2] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[3] Danny Dolev,et al. Unanimity in an unknown and unreliable environment , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[4] Danny Dolev,et al. The Byzantine Generals Strike Again , 1981, J. Algorithms.
[5] Nancy A. Lynch,et al. An Efficient Algorithm for Byzantine Agreement without Authentication , 1982, Inf. Control..
[6] Danny Dolev,et al. 'Eventual' is earlier than 'immediate' , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[7] Nancy A. Lynch,et al. Simple and efficient Byzantine generals algorithm , 1982 .
[8] Danny Dolev,et al. Polynomial algorithms for multiple processor agreement , 1982, STOC '82.
[9] Danny Dolev,et al. Requirements for Agreement in a Distributed System , 1982, DDB.
[10] Nancy A. Lynch,et al. Cryptographic protocols , 1982, STOC '82.
[11] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..
[12] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[13] Danny Dolev,et al. DISTRIBUTED COMMIT WITH BOUNDED WAITING , 1982 .
[14] Leslie Lamport,et al. The Weak Byzantine Generals Problem , 1983, JACM.
[15] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[16] Fred B. Schneider,et al. Byzantine generals in action: implementing fail-stop processors , 1984, TOCS.
[17] Leslie Lamport,et al. Using Time Instead of Timeout for Fault-Tolerant Distributed Systems. , 1984, TOPL.
[18] D. Dolev,et al. Bounds on information exchange for Byzantine agreement , 1985, JACM.
[19] P. M. Melliar-Smith,et al. Synchronizing clocks in the presence of faults , 1985, JACM.
[20] Brian A. Coan,et al. A communication-efficient canonical form for fault-tolerant distributed protocols , 1986, PODC '86.
[21] Yoram Moses,et al. Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.
[22] Yoram Moses,et al. Knowledge and common knowledge in a Byzantine environment I: crash failures , 1986 .
[23] Sam Toueg,et al. Fast Distributed Agreement , 1987, SIAM J. Comput..
[24] 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.