arXiv (All)
open access
Polylogarithmic Collective Tree Exploration
We study asynchronous collective tree exploration, where $k$ agents with unrestricted communication start at the root of an unknown tree and discover edges online. At each step, an adversary chooses which agent moves. We give a deterministic algorithm that explores any tree with $n$ nodes and depth
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
- Distributed Statistical Zero-Knowledge Proofs via Sumcheck#187288
- Consensus Tree Estimation with False Discovery Control via Partially Ordered Sets#652139
- Consensus Tree Estimation with False Discovery Control via Partially Ordered Sets#650686
- A Framework for Reputation Aware Uninorm-driven Consensus Algorithms for Blockchain Networks#394374
- Strengthening Recursive Constructions for Zero-Error Shannon Capacity#799488
Record · ID 1062713
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