Search papers, labs, and topics across Lattice.
3
0
2
17
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.
Forget slow distributed algorithms: a new approach slashes the time to compute balanced orientations and degree splits by leveraging hypergraph sinkless orientations.
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.
