The Performance of Concurrent Red-Black Tree Algorithms (1998)

Cached

Download Links

by Sabine Hanke
Venue:Lecture Notes in Computer Science
Citations:14 - 0 self

Active Bibliography

2 Chromatic Search Trees Revisited – Sabine Hanke - 1997
10 Concurrent Data Structures – Mark Moir, Nir Shavit - 2001
Complexity of Layered Binary Search Trees with Relaxed Balance – Lars Jacobsen, Kim S. Larsen - 1999
14 Relaxed balanced red-black trees – S. Hanke, Th. Ottmann, E. Soisalon-soininen - 1997
Variants of (a, b)-Trees with Relaxed Balance – Lars Jacobsen, Kim Larsen - 1999
5 Amortized Constant Relaxed Rebalancing Using Standard Rotations – Kim S. Larsen - 1998
6 Relaxed Balancing Made Simple – Th. Ottmann, E. Soisalon-Soininen - 1995
5 A Unified Approach to Concurrent and Parallel Algorithms on Balanced Data Structures – Joaquim Gabarro, Xavier Messeguer - 1997
Relaxed AVL Trees, Main-Memory Databases, and Concurrency – Otto Nurmi, Eljas Soisalon-soininen, Derick Wood - 1996