Searching for "A Dichromatic Framework for Balanced Trees" – sorted by Relevance.
-
The LEDA User Manual
- , Dictionary arrays are implemented by randomized search trees ([1]). Access operations A[x] take time O
- Cited by 3 (0 self) – Add To MetaCart
-
Vertical Decompositions for Triangles in 3-Space
- framework for balanced trees. In Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci., Lecture Notes
- Cited by 13 (6 self) – Add To MetaCart

