On the matter of dynamic optimality in an extended model for tree access operations

Authors:
Michael L. Fredman
Affiliations:
Rutgers University, New Brunswick
Venue:
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Year:
2011

Citing 4
Cited 0

Self-adjusting binary search trees

Journal of the ACM (JACM)
The pairing heap: a new form of self-adjusting heap

Algorithmica
Lower bounds for accessing binary search trees with rotations

SIAM Journal on Computing
Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees

Algorithmica

Quantified Score

Hi-index	0.00

Visualization

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.