SIGN IN
SIGN UP
Cooperative asynchronous update of shared memory
Full Text:
Pdf
Buy this Article
Authors:
Bogdan S. Chlebus
University of Colorado at Denver and Health Sciences Center, Denver, CO
Dariusz R. Kowalski
Uniwersytet Warszawski, Warszawa, Poland
Published in:
· Proceeding
STOC '05
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-58113-960-8
doi>
10.1145/1060590.1060698
2005 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 8
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'12
Share:
|
Tags:
algorithms
asynchrony
disperser
distributed algorithm
expander
general
performance
problem write-all
read and write register
theory
work efficiency
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