Search papers, labs, and topics across Lattice.
2
0
1
5
Energy savings in distributed graph algorithms may be fundamentally limited, as shown by new lower bounds that match existing round complexities across multiple problems.
Quantum algorithms can solve fundamental distributed computing problems like leader election with quadratically less communication than classical methods, thanks to new techniques based on quantum walks on electric networks.
