arXiv (All)
open access
A Refined Analysis of the Sequential Access Theorem for Splay Trees
A splay tree is a self-adjusting binary search tree that allows access, insertion, and deletion to be performed in amortized $O(\log n)$ time, where $n$ is the number of stored elements. The sequential access theorem states that, when the elements of a splay tree are accessed in increasing order, th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Random Algebraic Geometry Codes Approach the Half-Singleton Bound for Insertions and Deletions#974018
- Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size#971974
- The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting#329020
- The Condition for the Possibility of Denial: A Transcendental Argument from Exclusion#98810
- The Condition for the Possibility of Denial: A Transcendental Argument from Exclusion#72220
Record · ID 1035644
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive