A fast contention-friendly binary search tree (Q4598927)
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 6819494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast contention-friendly binary search tree |
scientific article; zbMATH DE number 6819494 |
Statements
A Fast Contention-Friendly Binary Search Tree (English)
0 references
15 December 2017
0 references
binary tree
0 references
concurrent data structures
0 references
efficient implementation
0 references
0.8811891078948975
0 references
0.7983819842338562
0 references
0.7720927596092224
0 references
0.7714357376098633
0 references
