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

Documents Related by Co-Citation

21 Efficient Rebalancing of Chromatic Search Trees – Joan Boyar, Kim S. Larsen - 1993
235 A dichromatic framework for balanced trees – Leo J Guibas, Robert Sedgewick - 1978
22 Soisalon-Soininen: Uncoupling updating and rebalancing in chromatic binary search trees – A-1991-2 O Nurmi, E
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
12 Chromatic binary search trees. a structure for concurrent rebalancing – O Nurmi, E Soisalon-Soininen - 1996
32 Concurrency control in database structures with relaxed balance – O NURMI, E SOISALON-SOININEN, D WOOD - 1987
255 Organization and maintenance of large ordered indexes – R Bayer, E McCreight - 1972
14 On-the-fly optimization of data structures – J L W Kessels - 1983
10 Relaxed balancing in search trees – E Soisalon-Soininen, P Widmayer - 1997
20 An algorithm for the organisation of information – G M Adel’son-Vel’skii, E M Landis - 1962
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
50 Concurrent Access of Priority Queues – Nageshwara Rao, Vipin Kumar - 1988
22 An Efficient Algorithm for Concurrent Priority Queue Heaps – Galen C. Hunt, Maged M. Michael, Srinivasan Parthasarathy, Michael L. Scott - 1996
6 Relaxed Balancing Made Simple – Th. Ottmann, E. Soisalon-Soininen - 1995
3 Slack time evaluation with RTSJ – Damien Masson, Serge Midonnet - 2008
138 Amortized computational complexity – R E Tarjan - 1985
7 J.D.Ullman, Data Structures and Algorithms – J E Hopcroft A V Aho - 1983