ACM Home Page
Please provide us with feedback. Feedback
The weakest failure detector for solving consensus
Full text PdfPdf (1.07 MB)
Source Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing table of contents
Vancouver, British Columbia, Canada
Pages: 147 - 158  
Year of Publication: 1992
ISBN:0-89791-495-3
Authors
Tushar Deepak Chandra  Dept. of Computer Science, Upson Hall, Cornell University, Ithaca, NY
Vassos Hadzilacos  Computer Systems Research Institute, University of Toronto, 6 King's College Road, Toronto, Ontario M5S 1A1
Sam Toueg  Dept. of Computer Science, Upson Hall, Cornell University, Ithaca, NY
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 16,   Citation Count: 13
Additional Information:

references   cited by   index terms   collaborative colleagues  

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/135419.135451
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.

 
ABND+87
Hagit Attiya, Amotz Bar- Noy, Danny Dolev, Daphne KoUer, David Peleg, and Rfdiger Reischuk. Achievable cases in an asynchronous environment. In Proceedings of the Twenty-Eighth Symposium on Foundations of Computer Science, pages 337-346. IEEE Computer Society Press, October 1987.
BW87
 
CD89
Benny Chor and Cynthia Dwork. Randomization in byzantine agreement. Advances in Computer Research, 5:443-497, 1989.
CT91
DDS87
DLP+86
DLS88
FLP85
RB91

CITED BY  13

Collaborative Colleagues:
Tushar Deepak Chandra: colleagues
Vassos Hadzilacos: colleagues
Sam Toueg: colleagues