• 1 Introduction
  • 2 Background
    • 2.1 Trees in the Pointer Machine Model, and Fingers
    • 2.2 Dynamic Optimality in Binary Search Trees
    • 2.3 Unordered Binary Trees
    • 2.4 Stable heaps
    • 2.5 Further Related Work
  • 3 Online and Offline Separations
    • 3.1 Information-Theoretic Wilber Bound
    • 3.2 Few Fingers
    • 3.3 Many Fingers
    • 3.4 Putting Things Together
  • 4 Bucketed Order by Next Request
  • 5 Conclusion
  • References
  • A Offline Algorithms Are Boring With Random Access
  • B From Keys in Internal Nodes to Keys in Leaves – And Back