A dichromatic framework for balanced trees

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1978-October, Issue , 1978, Pages 8-21

  Guibas, Leo J ^a   Sedgewick, Robert ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BALANCED TREES; ONE-PASS; PERFORMANCE ISSUES; REBALANCING; UNIFORM FRAMEWORK;

FORESTRY;

EID: 85039153497     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1978.3     Document Type: Conference Paper

References (12)

1. Aho A., Hopcroft J., and Ullman J., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. Adelson-Velskii G., Landis E., On an information organization algorithm, Doklady Akademica Nauk SSSR, 146 (1962), 263-266
3. Bayer R., Syrmnetric binary B-trees: data structure and Maintenance algorithms, Acta Informatica. 1 (1972), 290-306
4. Bayer R., and McCreight E., Organization and maintenance of large ordered indices, Acta Informatica, 1 (1972), 173-179
5. Brown M., A partial analysis of height-balanced trees, SIAM J. Camp., (to appear)
6. Brown M., A storage scheme for height-balanced trees, IPL, (to appear)
7. Karlton P.. Fuller S., Scroggs R., and Kaehler T., Performance of height-balanced trees, CACM 19 (1976), 23-28
8. Knuth D., The Art of Computer Programming, Vol. III, Sorting and Searching, Addison-Wesley, 1973
9. Kung, H.T. and Lehman, P.L., A concurrent data-base manipulation problem: binary search trees, to appear in the proceedings of the 1978 Large Data-Base Conference, Berlin
10. Reingold E., Nievergelt L., Dca N., Combinatorial Algorithms: Theory and Practice, Prentice-Hall, 1977
11. Rosenberg A., and Snyder L., Minimal-comparison 2,3-trees, SIAM J. Comp., (to appear)
12. Yao A.. On random 2-3 trees, Acta Infonnatica, 9 (1978), p. 159-170