Search papers, labs, and topics across Lattice.
Université Paris Cité
2
0
1
Energy-efficient distributed algorithms can now operate with nodes that selectively sleep, drastically cutting down energy consumption while maintaining performance.
Infinitely many locally checkable problems can achieve surprising round complexities in unbounded-degree graphs, challenging previous assumptions about complexity constraints.
