Efficient lock-free binary search trees

DOI10.1145/2611462.2611500zbMath1321.68460arXiv1404.3272OpenAlexW2008182922MaRDI QIDQ2943632

Philippas Tsigas, Nhan T. Nguyen, Bapi Chatterjee

Publication date: 3 September 2015

Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.3272

zbMATH Keywords

shared memorybinary search treelock-freeamortized analysisconcurrent data structures

Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)

Related Items (3)

Concurrent linearizable nearest neighbour search in LockFree-kD-tree ⋮ Non-blocking Patricia tries with replace operations ⋮ Unnamed Item

This page was built for publication: Efficient lock-free binary search trees