Tight bounds for asynchronous renaming (Q3189653)
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 6344022
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds for asynchronous renaming |
scientific article; zbMATH DE number 6344022 |
Statements
Tight Bounds for Asynchronous Renaming (English)
0 references
12 September 2014
0 references
distributed computing
0 references
concurrent data structures
0 references
lower bounds
0 references
renaming
0 references
shared memory
0 references
0 references
0 references
0 references
0.8914907574653625
0 references
0.8867459893226624
0 references
0.8831056356430054
0 references
0.8436691164970398
0 references
0.8351996541023254
0 references
