Are wait-free algorithms fast? (Q4310843): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/179812.179902 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079344171 / rank | |||
Normal rank | |||
Latest revision as of 20:52, 19 March 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
