The Failure Discovery problem

This publication has 18 references indexed in Scilit:

• Are wait-free algorithms fast?
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Message-optimal protocols for Byzantine Agreement
  Theory of Computing Systems, 1993
• On the message complexity of binary byzantine agreement under crash failures
  Distributed Computing, 1992
• Strong verifiable secret sharing extended abstract
  Published by Springer Nature ,1991
• Unreliable failure detectors for asynchronous systems (preliminary version)
  Published by Association for Computing Machinery (ACM) ,1991
• Knowledge and common knowledge in a distributed environment
  Journal of the ACM, 1990
• Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
  Published by Association for Computing Machinery (ACM) ,1987
• Achieving robustness in distributed database systems
  ACM Transactions on Database Systems, 1983
• The consensus problem in unreliable distributed systems (a brief survey)
  Published by Springer Nature ,1983
• The Byzantine generals strike again
  Journal of Algorithms, 1982