A Fast Contention-Friendly Binary Search Tree

DOI10.1142/S0129626416500158zbMath1376.68033OpenAlexW2522383192MaRDI QIDQ4598927

Michel Raynal, Vincent Gramoli, Tyler Crain

Publication date: 15 December 2017

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626416500158

zbMATH Keywords

binary treeefficient implementationconcurrent data structures

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Related Items

The CB tree: a practical concurrent self-adjusting search tree ⋮ Unnamed Item