arXiv (All)
open access
No Truly Sublogarithmic-Round Algorithm for Distributed MIS in the LOCAL Model
We prove that $o(\frac{\log n}{\log\log n})$-round randomized LOCAL algorithms find a maximal independent set (MIS) with subconstant probability on some input. This shows that the 40-year-old $O(\log n)$-round randomized CONGEST algorithm of Luby and Alon, Babai, and Itai is nearly optimal. Our lowe
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
- No Truly Sublogarithmic-Round Algorithm for Distributed MIS in the LOCAL Model#1318963
- Stochastic Caching via Subset Entropy / Ravi Kumar, Roie Levin, Joseph (Seffi) Naor, Debmalya Panigrahi#1188640
- Breaking the Infinite Barrier in the $\frac{1}{3}$--$\frac{2}{3}$ Conjecture#1105447
- A Simpler Proof of Kakutani's Conjecture on Random Subdivision and Its Generalizations#986790
- Randomized Algorithms#3284
Record · ID 1343731
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