| L.J. Guibas, R. Sedgewick, A Dichromatic Framework for Balanced Trees. Proc. of the 19th Symposium on Foundations of Computer Science (1983), pp. 8--21. |
....the bad worst case behaviour of these trees, various strategies have been developed to maintain them in balance. Global balancing algorithms periodically rebuild the whole tree [3, 9, 15] Balanced trees, e.g. AVL trees and red black trees, perform rebalancing coupled with each update operation [1, 5, 6, 8, 11, 13]. These data structures and algorithms were developed and analyzed assuming the Random Access Memory (RAM) model [2] This was a reasonable assumption when memory was slow and processors even slower. However, a long term trend has been that processor speed has doubled every two years and memory ....
L.J. Guibas, R. Sedgewick, A Dichromatic Framework for Balanced Trees. Proc. of the 19th Symposium on Foundations of Computer Science (1983), pp. 8--21.
....the bad worst case behaviour of these trees, various strategies have been developed to maintain them in balance. Global balancing algorithms periodically rebuild the whole tree [3, 9, 15] Balanced trees, e.g. AVL trees and red black trees, perform rebalancing coupled with each update operation [1, 5, 6, 8, 11, 13]. These data structures and algorithms were developed and analyzed assuming the Random Access Memory (RAM) model [2] This was a reasonable assumption when memory was slow and processors even slower. However, a long term trend has been that processor speed has doubled every two years and memory ....
L.J. Guibas, R. Sedgewick, A Dichromatic Framework for Balanced Trees. Proc. of the 19th Symposium on Foundations of Computer Science (1983), pp. 8--21.
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