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

Kowalski, Dariusz; Shvartsman, Alex

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2B84-0 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2B85-E

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Kowalski, Dariusz¹, Author
Shvartsman, Alex, Author

Affiliations:
1Max Planck Society, ou_persistent13

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2005-05-23Date issued: 2004

Publication Status: Issued

Pages: -

Publishing info: New York, USA : ACM

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 231937
Other: Local-ID: C1256428004B93B8-190C5F64C3D3D397C1256ED000363D85-Kowalski-SPAA-2004

Degree: -

Event

show

hide

Title: Untitled Event

Place of Event: Barcelona, Spain

Start-/End Date: 2004-07-13

Legal Case

show

Project information

show

Source 1

show

hide

Title: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04)

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: New York, USA : ACM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 311 - 320 Identifier: -