ACM Home Page
Please provide us with feedback. Feedback
Brief announcement: on the inherent cost of generic broadcast
Full text PdfPdf (56 KB)
Source Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing table of contents
St. John's, Newfoundland, Canada
SESSION: BA session: failure detectors table of contents
Pages: 401 - 401  
Year of Publication: 2004
ISBN:1-58113-802-4
Authors
Fernando Pedone  Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland
André Schiper  Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Citation Count: 0
Additional Information:

references   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/1011767.1011868
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
 
2
 
3
F. Pedone and A. Schiper. Lower bounds on generic broadcast algorithms. Technical Report IC/2004/46, EPFL, 2004.

Collaborative Colleagues:
Fernando Pedone: colleagues
André Schiper: colleagues