Simulating crash failures with many faulty processors (extended abstract)
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 166-184
- https://doi.org/10.1007/3-540-56188-9_12
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Optimally simulating crash failures in a byzantine environmentPublished by Springer Nature ,2005
- The possibility and the complexity of achieving fault-tolerant coordinationPublished by Association for Computing Machinery (ACM) ,1992
- Common knowledge and consistent simultaneous coordinationPublished by Springer Nature ,1991
- Bounds on the time to reach agreement in the presence of timing uncertaintyPublished by Association for Computing Machinery (ACM) ,1991
- Automatically increasing the fault-tolerance of distributed algorithmsJournal of Algorithms, 1990
- A compiler that increases the fault tolerance of asynchronous protocolsIEEE Transactions on Computers, 1988
- Connectivity requirements for Byzantine agreement under restricted types of failuresDistributed Computing, 1987
- Distributed agreement in the presence of processor and communication faultsIEEE Transactions on Software Engineering, 1986
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- The Byzantine generals strike againJournal of Algorithms, 1982