Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
2
0
1
0
Achieving a \(O(\log \log n)\) round complexity for computing 2-ruling sets in low-arboricity graphs could redefine efficiency benchmarks in distributed computing.
Even approximately fair gift-giving is surprisingly hard in distributed systems: achieving any approximation for the Santa Claus problem requires $\Omega(\sqrt{n} + D)$ rounds.