Searching for "Relaxed Balanced Red-Black Trees." – sorted by Relevance.
-
Relaxed Balanced Red-Black Trees
- Relaxed Balanced Red-Black Trees S. Hanke 1 , Th. Ottmann 2 , and E. Soisalon-Soininen 3 1
- Cited by 12 (2 self) – Add To MetaCart
-
The Performance of Concurrent Red-Black Tree Algorithms
- . This paper presents an experimental comparison of three relaxed balancing algorithms for red-black trees
- Cited by 7 (0 self) – Add To MetaCart
-
Chromatic Search Trees Revisited
- was first suggested in [4] for red-black trees. The first actual solution for relaxed balancing is presented
- Cited by 1 (1 self) – Add To MetaCart

