SIGN IN
SIGN UP
Quorum placement in networks to minimize access delays
Full Text:
Pdf
Buy this Article
Authors:
Anupam Gupta
Carnegie Mellon University, Pittsburgh, PA
Bruce M. Maggs
Carnegie Mellon University, Pittsburgh, PA
Florian Oprea
Carnegie Mellon University, Pittsburgh, PA
Michael K. Reiter
Carnegie Mellon University, Pittsburgh, PA
2005 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 159
· Citation Count: 4
Published in:
· Proceeding
PODC '05
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Pages 87-96
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-58113-994-2
doi>
10.1145/1073814.1073829
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 algorithms
distributed applications
location
lp rounding
performance
problems
quorum systems
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