CBTree: a practical concurrent self-adjusting search tree

DOI10.1007/978-3-642-33651-5_1MaRDI QIDQ4909398zbMATH OpenOpenAlexFDO

Authors Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert E. Tarjan

Publication date 13 March 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33651-5_1

Mathematics Subject Classification ID

Distributed systems (68M14) Data structures (68P05)

Recommendations

• The CB tree: a practical concurrent self-adjusting search tree
• Self-adjusting binary search trees
• A fast contention-friendly binary search tree
• Efficient lock-free binary search trees
• scientific article; zbMATH DE number 1008516

Cited in

(8)

• Non-blocking Patricia tries with replace operations
• The CB tree: a practical concurrent self-adjusting search tree
• Efficient lock-free binary search trees
• A fast contention-friendly binary search tree
• Principles of Distributed Systems
• The splay-list: a distribution-adaptive concurrent skip-list
• The splay-list: a distribution-adaptive concurrent skip-list
• Self-tuning reactive diffracting trees

This page was built for publication: CBTree: a practical concurrent self-adjusting search tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909398)