The amortized complexity of non-blocking binary search trees (Q2943634)
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 6478419
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The amortized complexity of non-blocking binary search trees |
scientific article; zbMATH DE number 6478419 |
Statements
The amortized complexity of non-blocking binary search trees (English)
0 references
3 September 2015
0 references
amortized analysis
0 references
asynchronous
0 references
binary search tree
0 references
compare-and-swap
0 references
concurrent
0 references
lock-free
0 references
non-blocking
0 references
0.8056776523590088
0 references
0.7907837629318237
0 references
0.7822417616844177
0 references
0.7651804685592651
0 references
0.762717068195343
0 references
