Joan Boyar, Rolf Fagerberg, Kim S. Larsen  Home/Search
Context Related
| leekillough.com/heaps/pa...ss971511.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: leekillough.com/heaps/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we prove that only an amortized constant amount of rebalancing is necessary after an update in a chromatic search tree. We also prove that the amount of rebalancing done at any particular level decreases exponentially, going from the leaves toward the root. These results imply that, in principle, a linear number of processes can access the tree simultaneously. We have included one interesting application of chromatic trees. Based on these trees, a priority queue with possibilities... (Update)
Context of citations to this paper: More
...rebalancing operations per update is O(log(n i) if i insertions are performed on a tree which initially contains n leaves. Boyar et al. [3] prove for a slightly modified set of rebalancing operations that only an amortized constant amount of rebalancing is necessary after...
Cited by: More
Relaxed Balanced Red-Black Trees - Hanke, Ottmann, Soisalon-Soininen (1997) (Correct)
Similar documents (at the sentence level):
34.4%: Chromatic Priority Queues - Boyar, Fagerberg, Larsen (1994) (Correct)
21.2%: Amortization Results for Chromatic Search Trees, with an .. - Boyar, Fagerberg, Larsen (1995) (Correct)
Active bibliography (related documents): More All
1.0: Complexity of Layered Binary Search Trees with Relaxed Balance - Jacobsen, Larsen (1999) (Correct)
0.7: B-Trees with Relaxed Balance - Larsen, Fagerberg (1995) (Correct)
0.6: Efficient Rebalancing of Chromatic Search Trees - Boyar, Larsen (1993) (Correct)
Similar documents based on text: More All
0.1: Priority Queues on Parallel Machines - Brodal (1996) (Correct)
0.1: Worst Case Efficient Data Structures for Priority Queues and.. - Sekhar (Correct)
0.1: On RAM priority queues - Thorup (1996) (Correct)
BibTeX entry: (Update)
Boyar, J., Fagerberg, R., Larsen, K.: "Amortization Results for Chromatic Search Trees, with an Application to Priority Queues"; 4th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, 955 (1995), 270--281. http://citeseer.ist.psu.edu/boyar97amortization.html More
@article{ boyar97amortization,
author = "Joan Boyar and Rolf Fagerberg and Kim S. Larsen",
title = "Amortization Results for Chromatic Search Trees, with an Application to Priority Queues",
journal = "Journal of Computer and System Sciences",
volume = "55",
number = "3",
pages = "504-521",
year = "1997",
url = "citeseer.ist.psu.edu/boyar97amortization.html" }
Citations (may not include all citations):452 Data Structures and Algorithms (context) - Aho, Hopcroft et al. - 1983
198 Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
157 Scheduling multithreaded computations by work stealing - Blumofe, Leiserson - 1994
124 A dichromatic framework for balanced trees (context) - Guibas, Sedgewick - 1978
80 Efficient locking for concurrent operations on B-trees (context) - Lehman, Yao - 1981
67 A new data structure for representing sorted lists (context) - Huddleston, Mehlhorn - 1982
62 An empirical comparison of priority-queue and event-set impl.. (context) - Jones - 1986
48 Concurrent access of priority queues - Rao, Kumar - 1988
48 trees: data structure and maintenance algorithms (context) - Bayer, B- - 1972
42 Algorithm 232: Heapsort (context) - Williams - 1964
38 Concurrent operations on priority queues (context) - Jones - 1989
34 trees with overtaking (context) - Sagiv, on - 1986
31 Simultaneous update of priority structures (context) - Biswas, Browne - 1987
25 Concurrency control in database structures with relaxed bala.. (context) - Nurmi, Soisalon-Soininen et al. - 1987
22 Concurrent manipulation of binary search trees (context) - Kung, Lehman - 1980
22 fly optimization of data structures (context) - Kessels - 1983
17 AVL trees with relaxed balance - Larsen - 1994
14 Efficient rebalancing of chromatic search trees - Boyar, Larsen - 1994
13 Uncoupling updating and rebalancing in chromatic binary sear.. (context) - Nurmi, Soisalon-Soininen - 1991
13 the selection of access paths in a data base system (context) - Wedekind - 1974
12 A new method for concurrency in B-trees (context) - Kwong, Wood - 1982
11 trees with relaxed balance (context) - Larsen, Fagerberg et al. - 1996
11 trees in a system with multiple users (context) - Samadi - 1976
10 Amortization results for chromatic search trees (context) - Boyar, Fagerberg et al. - 1995
4 unpublished work on 2-3 trees (context) - Hopcroft - 1970
4 An Efficient Algorithm for Balancing Binary Search Trees (context) - Malmi - 1992
2 An algorithm for the organisation of information (context) - Adel'son-Vel'ski, Landis - 1962
Documents on the same site (http://www.leekillough.com/heaps/): More
A Survey on Parallel Algorithms for Priority Queue Operations - Yu (Correct)
Data Structural Bootstrapping, Linear Path Compression.. - Buchsbaum, Sundar.. (1992) (Correct)
Chromatic Priority Queues - Boyar, Fagerberg, Larsen (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC