cs.DS · 2026-10-14 · No. 143
Data Structures and Algorithms, 2026-10-14.
1 new papers in cs.DS. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
1 entries-
01
No Truly Sublogarithmic-Round Algorithm for Distributed MIS in the LOCAL Model
Seri Khoury, Aaron Schild
cs.DS · cs.DC
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 lower bound improves upon the $Ω(\sqrt{\log n})$-round lower bound of Khoury and Schild and nearly closes the 20+ year-old gap between the $O(\log...
This edition is part of The Daily Abstract — cs.DS archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.