Message-optimal protocols for Byzantine Agreement

[1]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[2]  Joseph Y. Halpern,et al.  The Failure Discovery problem , 1993, Mathematical systems theory.

[3]  Vassos Hadzilacos,et al.  On the message complexity of binary byzantine agreement under crash failures , 1992, Distributed Computing.

[4]  Sam Toueg,et al.  Simulating authenticated broadcasts to derive simple fault-tolerant algorithms , 1987, Distributed Computing.

[5]  Piotr Berman,et al.  Optimal Early Stopping in Distributed Consensus (Extended Abstract) , 1992, WDAG.

[6]  Brian A. Coan,et al.  Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity , 1992, Inf. Comput..

[7]  N. Lynch,et al.  Are Wait-Free Algorithms Fast? (Extended Abstract) , 1990, FOCS.

[8]  Danny Dolev,et al.  Early stopping in Byzantine agreement , 1990, JACM.

[9]  Gil Neiger,et al.  Automatically Increasing the Fault-Tolerance of Distributed Algorithms , 1990, J. Algorithms.

[10]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1990, JACM.

[11]  Piotr Berman,et al.  Towards optimal distributed consensus , 1989, 30th Annual Symposium on Foundations of Computer Science.

[12]  Nancy A. Lynch,et al.  A hundred impossibility proofs for distributed computing , 1989, PODC '89.

[13]  Cynthia Dwork,et al.  Randomization in Byzantine Agreement , 1989, Adv. Comput. Res..

[14]  Jim Gray,et al.  The cost of messages , 1988, PODC '88.

[15]  Vassos Hadzilacos,et al.  On the Relationship Between the Atomic Commitment and Consensus Problems , 1990, Fault-Tolerant Distributed Computing.

[16]  Yoram Moses,et al.  Knowledge and common knowledge in a Byzantine environment I: crash failures , 1986 .

[17]  Silvio Micali,et al.  Byzantine agreement in constant expected time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[18]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[19]  Vassos Hadzilacos,et al.  Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing) , 1985 .

[20]  Silvio Micali,et al.  Byzantine Agreement in Constant Expected Time (and Trusting No One) , 1985, FOCS 1985.

[21]  Danny Dolev,et al.  Bounds on information exchange for Byzantine agreement , 1985, JACM.

[22]  Danny Dolev,et al.  Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..

[23]  Michael J. Fischer,et al.  The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.

[24]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[25]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[26]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[27]  Nancy A. Lynch,et al.  A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..

[28]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[29]  Bela Bollobas,et al.  Graph theory , 1979 .

[30]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[31]  N. S. Barnett,et al.  Private communication , 1969 .