ACM Home Page
Please provide us with feedback. Feedback
The Byzantine Generals Problem
Full text PdfPdf (1.25 MB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 4 ,  Issue 3  (July 1982) table of contents
Pages: 382 - 401  
Year of Publication: 1982
ISSN:0164-0925
Authors
Leslie Lamport  Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CA
Robert Shostak  Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CA
Marshall Pease  Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 85,   Downloads (12 Months): 789,   Citation Count: 340
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/357172.357176
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
DIFFIE, W., AND HELLMAN, M.E. New directions in cryptography. IEEE Trans. Inf. Theory IT-22 (Nov. 1976), 644-654.
 
2
DOLEV, D. The Byzantine generals strike again. J. Algorithms 3, I (Jan. 1982).
3
4

CITED BY  341
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Leslie Lamport: colleagues
Robert Shostak: colleagues
Marshall Pease: colleagues

Peer to Peer - Readers of this Article have also read: