SIGN IN
SIGN UP
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Full Text:
PDF
Get this Article
Authors:
Gurmeet Singh Manku
Stanford University, CA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
Udi Wieder
Weizmann Institute of Science, Rehovot, Israel
Published in:
· Proceeding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Pages 54-63
ACM
New York, NY
, USA
©2004
table of contents
ISBN:1-58113-852-0
doi>
10.1145/1007352.1007368
2004 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 1,052
· Citation Count: 66
Tools and Resources
Buy this Article
Recommend the ACM DL
to your organization
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC '17
Share:
|
Author Tags
algorithms
greedy routing
network architectures
peer to peer networks
random structures
Contact Us
|
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
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder