Ora Oxford University Research
metadata only
Randomized k-server in polynomial time
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
- Communication Efficient Byzantine Agreement with Predictions#180632
- KCensus: Synthesizing Latency-Optimal Consensus Fast Paths (Extended Version)#1105860
- Queues: Theory and Applications#66873
- Almost Optimal FPT Inapproximability for k-SetCover#1014273
- Faster Convergence of Multidimensional Approximate Agreement via Smallest Enclosing Balls#821526
Record · ID 236491
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