SIGN IN
SIGN UP
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
Full Text:
PDF
Buy this Article
Authors:
Petra Berenbrink
Simon Fraser University, Burnaby, BC, Canada
Robert Elsaesser
University of Paderborn, Paderborn, Germany
Tom Friedetzky
Durham University, Durham, United Kingdom
Published in:
· Proceeding
PODC '08
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Pages 155-164
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-59593-989-0
doi>
10.1145/1400751.1400773
2008 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 27
· Downloads (cumulative): 224
· Citation Count: 16
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
algorithms
broadcasting
nonnumerical algorithms and problems
random regular graphs
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder