The amortized complexity of non-blocking binary search trees (Q2943634)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The amortized complexity of non-blocking binary search trees |
scientific article |
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
