# A Study on Splay Trees

@article{Russo2019ASO, title={A Study on Splay Trees}, author={Lu{\'i}s M. S. Russo}, journal={ArXiv}, year={2019}, volume={abs/1511.03148} }

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.

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Citations

##### Publications citing this paper.

## New Paths from Splay to Dynamic Optimality

VIEW 3 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 29 REFERENCES

## Self-adjusting binary search trees

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## The geometry of binary search trees

VIEW 15 EXCERPTS

HIGHLY INFLUENTIAL

## Sequential access in splay trees takes linear time

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Combining Binary Search Trees

VIEW 1 EXCERPT

## In pursuit of the dynamic optimality conjecture

VIEW 2 EXCERPTS

## The Fresh-Finger Property

VIEW 1 EXCERPT

## Upper Bounds for Maximally Greedy Binary Search Trees

VIEW 1 EXCERPT

## Chain-splay trees

VIEW 1 EXCERPT