Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement
暂无分享,去创建一个
[1] Piotr Berman,et al. Towards optimal distributed consensus , 1989, 30th Annual Symposium on Foundations of Computer Science.
[2] Brian A. Coan,et al. A communication-efficient canonical form for fault-tolerant distributed protocols , 1986, PODC '86.
[3] Brian A. Coan,et al. Achieving consensus in fault-tolerant distributed computer systems: protocols, lower bounds, and simulations , 1987 .
[4] Danny Dolev,et al. Shifting gears: changing algorithms on the fly to expedite Byzantine agreement , 1987, PODC '87.
[5] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[6] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[7] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..
[8] Brian A. Coan,et al. Modular construction of nearly optimal Byzantine agreement protocols , 1989, PODC '89.
[9] Danny Dolev,et al. Early stopping in Byzantine agreement , 1990, JACM.