The computability of relaxed data structures: queues and stacks as examples (Q3460732)
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 6527705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computability of relaxed data structures: queues and stacks as examples |
scientific article; zbMATH DE number 6527705 |
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
0.9965163469314576
0 references
0.8259264826774597
0 references
0.7998021245002747
0 references
0.7944937944412231
0 references
