HyperChromatic trees a ne grained approach to distributed algorithms on RedBlack trees

@inproceedings{Messeguer1998HyperChromaticTA,
  title={HyperChromatic trees a ne grained approach to distributed algorithms on RedBlack trees},
  author={Xavier Messeguer and Borja Valles},
  year={1998}
}
We introduce a relaxed version of RedBlack trees As con current algorithms on balanced search trees are nowadays based on local rules we propose a set of ne grained local rules that take more advan tage of concurrency than 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 and deletions