The Computability of Relaxed Data Structures: Queues and Stacks as Examples (Q3460732): 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:42, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Computability of Relaxed Data Structures: Queues and Stacks as Examples |
scientific article |
Statements
The Computability of Relaxed Data Structures: Queues and Stacks as Examples (English)
0 references
8 January 2016
0 references
relaxed data structure
0 references
consensus number
0 references
synchronization
0 references
wait-freedom
0 references
queue
0 references
stack
0 references
multiset
0 references
