References
- Dolev , D. 1982 . The Byzantine Generals Strike Again . J. Algorithms , 3 : 14 – 30 .
- Dolev , D. and Strong , H. R. 1983 . Authenticated Algorithms for Byzantine Agreement . SIAM J. Comput. , 12 : 656 – 666 .
- Fischer , M. and Lynch , N. 1982 . A Lower Bound for the Time to Assure Interactive Consistency . Inform. Processing Lett. , 14 : 183 – 186 .
- Fischer , M. , Lynch , N. and Merritt , M. 1986 . Easy impossibility proofs for distributed consensus problems . Distributed Computing , 1 : 26 – 39 .
- Gupta , R. and Ramakrishnan , I. V. System-Level Fault Diagnosis in Malicious Environments . Proc. 17th Int. Symp. on Fault Tolerant Computing . pp. 184 – 189 . IEEE Computer Society Publications .
- Hadzilacos , V. 1987 . Connectivity requirements for Byzantine agreement under restricted types of failures . Distributed Computing , 1 : 95 – 103 .
- Lamport , L. , Shostak , R. and Pease , M. 1982 . The Byzantine Generals Problem . ACM Trans. Program. Lang. Syst. , 4 : 382 – 401 .
- Lynch , N. , Fischer , M. and Fowler , R. 1982 . A Simple and Efficient Byzantine Generals Algorithm . Proc.2nd Symp. on Reliable Dist. Soft. and Data Base Syst. 1982 . pp. 46 – 52 .
- Pease , M. , Shostak , R. and Lamport , L. 1980 . Reaching Agreement in the Presence of Faults . J. ACM , 27 : 228 – 234 .
- Perry , K. J. and Toueg , S. 1986 . Distributed Agreement in the Presence of Processor and Communication Faults . IEEE Trans. Software Eng. , SE-12 : 477 – 482 .
- Preparata , F. P. , Metze , G. and Chien , R. T. 1967 . On the connection assignment problem of diagnosable systems . IEEE Trans. Electronic Comput. , EC-16 : 848 – 854 .
- Srikanth , T. K. and Toueg , S. 1987 . Simulating authenticated broadcasts to derive simple fault-tolerantalgorithms . Distributed Computing , 1 : 80 – 94 .