We introduce a relaxed version of RedBlack trees. As concurrent algorithms on
balanced search trees are nowadays based on local rules, we propose a
set of fine-grained local rules that take more advantage of
concurrency that previous approaches. Based on them we design a
rebalancing concurrent algorithm and prove its correctness. Finally we
sketch how to complete this algorithm to include concurrent insertions
CitationMesseguer, X., Valles, B. "HyperChromatic trees: a fine-grained approach to distributed algorithms on RedBlack trees". 1998.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com