Automatically increasing the fault-tolerance of distributed algorithms
- 30 September 1990
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 11 (3), 374-419
- https://doi.org/10.1016/0196-6774(90)90019-b
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A compiler that increases the fault tolerance of asynchronous protocolsIEEE Transactions on Computers, 1988
- Programming simultaneous actions using common knowledgeAlgorithmica, 1988
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Asynchronous Byzantine agreement protocolsInformation and Computation, 1987
- Connectivity requirements for Byzantine agreement under restricted types of failuresDistributed Computing, 1987
- Streets of Byzantium: Network Architectures for Fast Reliable BroadcastsIEEE Transactions on Software Engineering, 1985
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- The Byzantine generals strike againJournal of Algorithms, 1982