|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
19th Annual Symposium on Foundations of Computer Science (FOCS 1978)
A dichromatic framework for balanced trees
October 16-October 18
| ASCII Text | x | ||
| Leo J. Guibas, Robert Sedgewick, "A dichromatic framework for balanced trees," Foundations of Computer Science, IEEE Annual Symposium on, pp. 8-21, 19th Annual Symposium on Foundations of Computer Science (FOCS 1978), 1978. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1978.3, author = {Leo J. Guibas and Robert Sedgewick}, title = {A dichromatic framework for balanced trees}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1978}, issn = {0272-5428}, pages = {8-21}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1978.3}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - A dichromatic framework for balanced trees SN - 0272-5428 SP8 EP21 A1 - Leo J. Guibas, A1 - Robert Sedgewick, PY - 1978 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1978.3
In this paper we present a uniform framework for the implementation and study of balanced tree algorithms. We show how to imbed in this framework the best known balanced tree techniques and then use the framework to develop new algorithms which perform the update and rebalancing in one pass, on the way down towards a leaf. We conclude with a study of performance issues and concurrent updating.
Citation:
Leo J. Guibas, Robert Sedgewick, "A dichromatic framework for balanced trees," focs, pp.8-21, 19th Annual Symposium on Foundations of Computer Science (FOCS 1978), 1978
Usage of this product signifies your acceptance of the Terms of Use.