arXiv (All)
open access
Faster Convergence of Multidimensional Approximate Agreement via Smallest Enclosing Balls
This work considers the multidimensional approximate agreement problem. In this problem, $n$ parties in a distributed system, up to $t$ of which may be corrupted by a Byzantine adversary, need to output vectors that are close to each other and that lie inside the convex hull of all non-corrupted inp
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
- A polynomial time algorithm for almost bounded denumerant#612421
- A polynomial time algorithm for almost bounded denumerant#610944
- Settling The Round Complexity of Byzantine Agreement Against a Full-Information, Adaptive Adversary#373364
- Reputation-Based Byzantine-Resilient Vector Consensus without Prespecified Fault Bounds#1014698
- Communication Efficient Byzantine Agreement with Predictions#180632
Record · ID 821526
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