Abstract
The model of node access operations taking place in binary search trees subject to rotations is extended to unordered binary trees, as motivated by consideration of certain self-adjusting priority queues. Rotations in this extended model can be preceded by sibling subtree swaps. Whereas the Wilber lower bound for off-line computation extends to this model of computation - a precondition for the possibility of dynamic optimality - the goal of dynamic optimality is nonetheless demonstrated to be unattainable in this model. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Fredman, M. L. (2011). On the matter of dynamic optimality in an extended model for tree access operations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 423–437). https://doi.org/10.1007/978-3-642-22300-6_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
