arXiv (All)
open access
Tight weighted paging with delay via mirror descent
We give an O(log k)-competitive randomized algorithm for weighted paging with delay. This improves upon the O(log k log n)-competitive algorithm of Gupta, Kumar, and Panigrahi (STOC 2020, SICOMP 2022) by removing the dependence on the number n of pages. Without delay, the optimal competitive ratio o
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
- Two Holes Make a Difference: Deterministic Paging with Delay and Deadlines#1344264
- A New Paging Method Based on Service Characteristics of Data and Voice in PCS#499245
- The Coverage Depth Problem in Distributed DNA Data Storage#1187609
- Solving a sequence of eigenvalue problems using snapshot and row subsampling#1345149
- Online algorithms for content caching: an economic perspective#641308
Record · ID 1389601
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