Interleave lower bound

In the theory of Optimal binary search trees, the interleave lower bound is a lower bound on the number of operations required by a binary search… (More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (within a constant competitive factor) among the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?