Meeting the deadline: on the complexity of fault-tolerant continuous gossip

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Chryssis Georgiou University of Cyprus, Nicosia, Cyprus
Seth Gilbert École Polytechnique, Fédérale de Lausanne, Lausanne, Switzerland
Dariusz R. Kowalski University of Liverpool, Liverpool, United Kingdom
Published in:
Cover Image
 
· Proceeding
PODC '10 Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Pages 247-256
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-60558-888-9 doi>10.1145/1835698.1835759
Meeting the deadline: on the complexity of fault-tolerant continuous gossip Published by ACM 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 25
· Downloads (cumulative): 160
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder