Are wait-free algorithms fast? (Q4310843): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:07, 6 February 2024
scientific article; zbMATH DE number 681304
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Are wait-free algorithms fast? |
scientific article; zbMATH DE number 681304 |
Statements
Are wait-free algorithms fast? (English)
0 references
3 November 1994
0 references
fault-tolerance
0 references
time complexity
0 references
wait-free algorithms
0 references
approximate agreement
0 references
