Are shared objects composable under an oblivious adversary? (Q5361952)
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 6784191
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Are shared objects composable under an oblivious adversary? |
scientific article; zbMATH DE number 6784191 |
Statements
Are Shared Objects Composable under an Oblivious Adversary? (English)
0 references
29 September 2017
0 references
distributed algorithms
0 references
linearizability
0 references
randomized algorithms
0 references
shared memory
0 references
0.8356882929801941
0 references
0.790198564529419
0 references
0.7833373546600342
0 references
0.7311587929725647
0 references
0.7301772832870483
0 references
