Wilber's Alternation bound is subadditive and the Funnel bound is superadditive under sequence composition, yielding optimality of Tango trees among Alternation-charging BST algorithms for all Alternation values.
Optimization with pattern-avoiding input
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Hardness Amplification for Dynamic Binary Search Trees
Wilber's Alternation bound is subadditive and the Funnel bound is superadditive under sequence composition, yielding optimality of Tango trees among Alternation-charging BST algorithms for all Alternation values.