A Contention-Friendly Binary Search Tree
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 229-240
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A speculation-friendly binary search treeACM SIGPLAN Notices, 2012
- Data structures in the multicore ageCommunications of the ACM, 2011
- Elastic Transactions2009
- A Simple Optimistic Skiplist Algorithm2007
- Amortization Results for Chromatic Search Trees, with an Application to Priority QueuesJournal of Computer and System Sciences, 1997
- Chromatic binary search treesActa Informatica, 1996
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- On-the-fly optimization of data structuresCommunications of the ACM, 1983
- A new data structure for representing sorted listsActa Informatica, 1982
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972