Amortization Results for Chromatic Search Trees, with an Application to Priority Queues (1997)
| Citations: | 6 - 0 self |
BibTeX
@MISC{Boyar97amortizationresults,
author = {Joan Boyar and Rolf Fagerberg and Kim S. Larsen},
title = {Amortization Results for Chromatic Search Trees, with an Application to Priority Queues},
year = {1997}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 for a greater degree of parallelism than previous proposals can be implemented. ] 1997 Academic Press 1.
