Algorithms for the Certified Write-All Problem (Q4376186)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1116374
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the Certified Write-All Problem |
scientific article; zbMATH DE number 1116374 |
Statements
Algorithms for the Certified Write-All Problem (English)
0 references
10 February 1998
0 references
certified write-all problem
0 references
asynchronous computation
0 references
synchronization primitives
0 references
adversary models
0 references
0.8340186476707458
0 references
0.8288804888725281
0 references
0.8204551339149475
0 references
0.766102135181427
0 references
0.760698676109314
0 references
