Writing-all deterministically and optimally using a non-trivial number of asynchronous processors

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Dariusz R. Kowalski Max-Planck-Institut für Informatik, Saarbrücken, Germany and Uniwersytet Warszawski, Warszawa, Poland
Alexander A. Shvartsman University of Connecticut, Storrs, CT and MIT CSAIL, Cambridge, MA
Published in:
Cover Image
 
· Proceeding
SPAA '04 Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Pages 311 - 320
ACM New York, NY, USA ©2004
table of contents ISBN:1-58113-840-7 doi>10.1145/1007912.1007964
Writing-all deterministically and optimally using a non-trivial number of asynchronous processors Published by ACM 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 6
· Downloads (cumulative): 179
· Citation Count: 4


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder