Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
1
0
1
Achieving a \(O(\log \log n)\) round complexity for computing 2-ruling sets in low-arboricity graphs could redefine efficiency benchmarks in distributed computing.