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

Kowalski, Dariusz; Shvartsman, Alex

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

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

MPS-Authors

Kowalski, Dariusz
Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Kowalski, D., & Shvartsman, A. (2004). Writing-All deterministically and optimally using a non-trivial number of asynchronous processors. In Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04) (pp. 311-320). New York, USA: ACM.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2B84-0

Abstract

There is no abstract available