SIGN IN
SIGN UP
Almost tight bounds for rumour spreading with conductance
Full Text:
Pdf
Buy this Article
Authors:
Flavio Chierichetti
Sapienza University of Rome, Rome, Italy
Silvio Lattanzi
Sapienza University of Rome, Rome, Italy
Alessandro Panconesi
Sapienza University of Rome, Rome, Italy
Published in:
· Proceeding
STOC '10
Proceedings of the 42nd ACM symposium on Theory of computing
Pages 399-408
ACM
New York, NY
, USA
©2010
table of contents
ISBN: 978-1-4503-0050-6
doi>
10.1145/1806689.1806745
2010 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 71
· Downloads (cumulative): 279
· Citation Count: 18
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
conductance
probabilistic algorithms
rumor spreading
social networks
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