SIGN IN
SIGN UP
What cannot be computed locally!
Full Text:
Pdf
Buy this Article
Authors:
Fabian Kuhn
ETH Zurich, Zurich, Switzerland
Thomas Moscibroda
ETH Zurich, Zurich, Switzerland
Rogert Wattenhofer
ETH Zurich, Zurich, Switzerland
Published in:
· Proceeding
PODC '04
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Pages 300 - 309
ACM
New York, NY
, USA
©2004
table of contents
ISBN:1-58113-802-4
doi>
10.1145/1011767.1011811
2004 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 53
· Downloads (cumulative): 663
· Citation Count: 78
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
approximation hardness
computations on discrete structures
distributed algorithms
dominating set
graph algorithms
locality
lower bounds
maximal independent set
maximal matching
network problems
theory
vertex cover
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