The flip markov chain and a randomising P2P protocol

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Colin Cooper King's College London, London, United Kingdom
Martin Dyer University of Leeds, Leeds, United Kingdom
Andrew J. Handley University of Leeds, Leeds, United Kingdom
Published in:
Cover Image
 
· Proceeding
PODC '09 Proceedings of the 28th ACM symposium on Principles of distributed computing
Pages 141-150
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-396-9 doi>10.1145/1582716.1582742
The flip markov chain and a randomising P2P protocol Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 22
· Downloads (cumulative): 224
· Citation Count: 5


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