On the message complexity of binary byzantine agreement under crash failures

This publication has 12 references indexed in Scilit:

• A hundred impossibility proofs for distributed computing
  Published by Association for Computing Machinery (ACM) ,1989
• Towards optimal distributed consensus
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
  SIAM Journal on Computing, 1986
• Knowledge and Common Knowledge in a Byzantine Environment I: Crash failures
  Published by Elsevier ,1986
• Byzantine agreement in constant expected time
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• Authenticated Algorithms for Byzantine Agreement
  SIAM Journal on Computing, 1983
• The consensus problem in unreliable distributed systems (a brief survey)
  Published by Springer Nature ,1983
• A lower bound for the time to assure interactive consistency
  Information Processing Letters, 1982
• Bounds on information exchange for Byzantine Agreement
  Published by Association for Computing Machinery (ACM) ,1982
• Reaching Agreement in the Presence of Faults
  Journal of the ACM, 1980