A concurrent red–black tree
Authors:
- Juan BesaJBJuan Besa
- Yadran EterovicYEYadran Eterovic
- 1 April 2013
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 73 (4) , 434-449
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Data structures in the multicore ageCommunications of the ACM, 2011
- A practical concurrent binary search treeACM SIGPLAN Notices, 2010
- Amortized constant relaxed rebalancing using standard rotationsActa Informatica, 1998
- Relaxed balanced red-black treesLecture Notes in Computer Science, 1997
- Chromatic binary search treesActa Informatica, 1996
- Efficient rebalancing of chromatic search treesJournal of Computer and System Sciences, 1994
- A dichromatic framework for balanced trees1978