We study the dynamic optimality conjecture, which predicts that splay trees are a form of universally efficient binary search tree, for any access sequence. We reduce this claim to a regular access bound, which seems plausible and might be easier to prove. This approach may be useful to establish dynamic optimality.

中文翻译：

---

展开树的研究

我们研究了动态最优猜想，它预测对于任何访问序列，展开树是一种普遍有效的二叉搜索树形式。我们将此声明简化为常规访问限制，这似乎是合理的，并且可能更容易证明。这种方法可能有助于建立动态最优性。