'Eventual' is earlier than 'immediate'
暂无分享,去创建一个
[1] Danny Dolev,et al. Requirements for Agreement in a Distributed System , 1982, DDB.
[2] Leslie Lamport,et al. Using Time Instead of Timeout for Fault-Tolerant Distributed Systems. , 1984, TOPL.
[3] Danny Dolev,et al. Unanimity in an unknown and unreliable environment , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[4] Leslie Lamport,et al. The Weak Byzantine Generals Problem , 1983, JACM.
[5] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..
[6] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[7] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[8] Danny Dolev,et al. Polynomial algorithms for multiple processor agreement , 1982, STOC '82.
[9] Nancy A. Lynch,et al. Cryptographic protocols , 1982, STOC '82.
[10] Nancy A. Lynch,et al. Simple and efficient Byzantine generals algorithm , 1982 .
[11] Danny Dolev,et al. DISTRIBUTED COMMIT WITH BOUNDED WAITING , 1982 .
[12] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[13] Danny Dolev,et al. The Byzantine Generals Strike Again , 1981, J. Algorithms.