Impossibility of distributed consensus with one faulty process
暂无分享,去创建一个
[1] Butler W. Lampson,et al. Crash Recovery in a Distributed Data Storage System , 1981 .
[2] David P. Reed,et al. Naming and synchronization in a decentralized computer system , 1978 .
[3] Daniel J. Rosenkrantz,et al. System level concurrency control for distributed database systems , 1978, TODS.
[4] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[5] Nancy A. Lynch,et al. An Efficient Algorithm for Byzantine Agreement without Authentication , 1982, Inf. Control..
[6] Hector Garcia-Molina,et al. Elections in a Distributed Computing System , 1982, IEEE Transactions on Computers.
[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] Nancy A. Lynch,et al. Cryptographic protocols , 1982, STOC '82.
[10] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..
[11] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[12] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[13] Michael Stonebraker,et al. A Formal Model of Crash Recovery in a Distributed System , 1983, IEEE Transactions on Software Engineering.
[14] Sam Toueg,et al. Resilient consensus protocols , 1983, PODC '83.
[15] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[16] Gabriel Bracha,et al. An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.
[17] Hagit Attiya,et al. Asynchronous Byzantine consensus , 1984, PODC '84.
[18] Sam Toueg,et al. Randomized Byzantine Agreements , 1984, PODC '84.
[19] Nancy A. Lynch,et al. Reaching approximate agreement in the presence of faults , 1986, JACM.