On the Complexity of Certified Write-All Algorithms (Q4290913)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Complexity of Certified Write-All Algorithms |
scientific article; zbMATH DE number 563093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Certified Write-All Algorithms |
scientific article; zbMATH DE number 563093 |
Statements
On the Complexity of Certified Write-All Algorithms (English)
0 references
5 May 1994
0 references
parallel computation
0 references
asynchronous PRAM algorithms
0 references
synchronization
0 references
certified write-all problem
0 references
0.8797522783279419
0 references
0.8501505851745605
0 references
0.8371738195419312
0 references
0.8340186476707458
0 references
