Efficient lock-free binary search trees (Q2943632)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient lock-free binary search trees |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient lock-free binary search trees |
scientific article |
Statements
Efficient lock-free binary search trees (English)
0 references
3 September 2015
0 references
amortized analysis
0 references
binary search tree
0 references
concurrent data structures
0 references
lock-free
0 references
shared memory
0 references
0.8811891078948975
0 references
0.7947096228599548
0 references
0.7907837629318237
0 references
0.7808921337127686
0 references
