arXiv (All)
open access
Transposition achieves OPT$+O(1)$ in polynomial time for IID list update
In the classical list update problem, a set of items must be stored in a list-type structure, where accessing the $i$-th element costs $i$. Items will be queried in an IID manner according to some probability distribution $p$ on the items. We want to minimize the expected cost of each query. The opt
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
- Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction#799512
- Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction#798089
- Data-driven method to estimate contamination from light ion beam transmutation at colliders#153133
- Seq2Seq2Seq: Lossless Data Compression via Discrete Latent Transformers and Reinforcement Learning#1062842
- The two-sided power distribution for the treatment of the uncertainty in PERT#654538
Record · ID 1065000
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