A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A dichromatic framework for balanced trees
1978
19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
Preserved Fulltext
ABSTUACT I() this paper we present a uniform framework for the implementation and study of halanced tree algorithms. \Ve show how to imhcd in this framework the best known halanced tree tecilIliques and thell usc the framework to deVl'lop new al1~orithJlls which perform the update and rebalancing in one pass, Oil the way down towards a leaf. \Ve conclude with a study of performance issues and concurrent updating. Let us now rr:ake a few observations about these implementations. First, notc
doi:10.1109/sfcs.1978.3
dblp:conf/focs/GuibasS78
fatcat:afeazmj4svdslbzfgaykol3nnq