Amortization Results for Chromatic Search Trees, with an Application to Priority Queues (1997)

Cached

Download Links

by Joan Boyar , Rolf Fagerberg , Kim S. Larsen
Citations:7 - 0 self

Active Bibliography

5 Chromatic Priority Queues – Joan Boyar, Rolf Fagerberg, Kim S. Larsen - 1994
13 B-Trees with Relaxed Balance – Kim S. Larsen, Rolf Fagerberg - 1993
6 Relaxed Balancing Made Simple – Th. Ottmann, E. Soisalon-Soininen - 1995
4 Amortized Constant Relaxed Rebalancing Using Standard Rotations – Kim S. Larsen - 1998
13 The Performance of Concurrent Red-Black Tree Algorithms – Sabine Hanke - 1998
Relaxed AVL Trees, Main-Memory Databases, and Concurrency – Otto Nurmi, Eljas Soisalon-soininen, Derick Wood - 1996
15 Relaxed balanced red-black trees – S. Hanke, Th. Ottmann, E. Soisalon-soininen - 1997
3 A Highly Concurrent Priority Queue Based on the B-link Tree – Theodore Johnson - 1991
1 Chromatic Search Trees Revisited – Sabine Hanke - 1997
14 The Performance of Concurrent Data Structure Algorithms – Theodore Johnson, E. Shasha - 1994
21 Efficient Rebalancing of Chromatic Search Trees – Joan Boyar, Kim S. Larsen - 1993
6 A Unified Approach to Concurrent and Parallel Algorithms on Balanced Data Structures – Joaquim Gabarro, Xavier Messeguer - 1997
9 A General Technique for Implementation of Efficient Priority Queues – Peter Høyer - 1994
12 Relaxed Balance through Standard Rotations – Kim S. Larsen, Eljas Soisalon-soininen, Peter Widmayer - 1997
3 Characterizing the Performance of Algorithms for Lock-free Objects – Theodore Johnson - 1995
2 Concurrent Perfect Balancing of Binary Search Trees – Jürgen Eckerle, Otto Nurmi
2 Discrete-Event Simulation on the Bulk-Synchronous Parallel Model – Mauricio Marin, St Cross College, Supervisor Prof, W. F. Mccoll - 1998
3 On the Pending Event Set and Binary Tournaments – Mauricio Marín
1 Parallel and Distributed Branch-and-Bound/A* Algorithms – V.-D. Cung, S. Dowaji, B. Le Cun, T. Mautor, C. Roucairol - 1994