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:8 - 0 self

Documents Related by Co-Citation

231 R.: A dichromatic framework for balanced trees – L J Guibas, Sedgewick - 1978
21 Efficient Rebalancing of Chromatic Search Trees – Joan Boyar, Kim S. Larsen - 1993
23 E.: Uncoupling updating and rebalancing in chromatic binary search trees – O Nurmi, Soisalon-Soininen - 1991
13 E.: Chromatic binary search trees. A structure for concurrent rebalancing – O Nurmi, Soisalon-Soininen - 1996
15 On-the-fly optimization of data structures – J L W Kessels - 1983
13 B-Trees with Relaxed Balance – Kim S. Larsen, Rolf Fagerberg - 1993
22 AVL Trees with Relaxed Balance – Kim S. Larsen, Ny Munkegade Aarhusc Denmark - 1992
32 Concurrency control in database structures with relaxed balance – O NURMI, E SOISALON-SOININEN, D WOOD - 1987
254 Organization and maintenance of large ordered indexes – R Bayer, E M McCreight - 1972
10 Relaxed balancing in search trees – E Soisalon-Soininen, P Widmayer - 1997
19 An algorithm for the organisation of information – G M Adel’son-Vel’skii, Y M Landis - 1962
71 High performance dynamic lock-free hash tables and list-based sets – M M Michael
133 Practical lock freedom – K Fraser - 2003
55 Concurrent operations on B-trees with overtaking – Y SAGIV - 1985
3 A Comparative study of sequential and parallel priority queue algorithms – R Rnngren, R Ayani - 1997
22 An Efficient Algorithm for Concurrent Priority Queue Heaps – Galen C. Hunt, Maged M. Michael, Srinivasan Parthasarathy, Michael L. Scott - 1996
51 Concurrent Access of Priority Queues – Nageshwara Rao, Vipin Kumar - 1988
6 Relaxed Balancing Made Simple – Th. Ottmann, E. Soisalon-Soininen - 1995
138 Amortized computational complexity – R E Tarjan - 1985