arXiv (All)
open access
Heterogeneous Demand-Private Coded Caching: Exact Characterization for Two Users and Two Files
We consider the demand-private coded caching problem with heterogeneous file sizes and cache capacities, where each user must recover its requested file without learning any information about the demands of the other users. We first extend the virtual-user reduction technique to accommodate heteroge
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
- CacheFit: The Rising Cost of Cache Replacement and Constraint-Driven Redesign of Last-Level Cache Replacement Policies#1247506
- Learning-Augmented Heuristics: Simple, yet Smart, Robust and Interpretable Cache Eviction#784750
- Learning-Augmented Heuristics: Simple, yet Smart, Robust and Interpretable Cache Eviction#783160
- PulseInfer: I/O-Centric Sparse KV Cache Offloading for Efficient Long-Context LLM Decoding#1128820
- The adsorption of gases and vapours#1347383
Record · ID 1298410
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