Search papers, labs, and topics across Lattice.
2
0
5
3
Distributed vertex coloring can now be solved in near-optimal $\tilde{O}(\log^4 \log n)$ rounds, closing the gap with the theoretical lower bound and exponentially improving performance for graphs with small maximum degree.
LLMs helped discover a new algorithm for 2-coloring cycles, achieving a tighter bound on monochromatic edges than previously known.
