Search papers, labs, and topics across Lattice.
2
0
1
6
Even with just one-bit communications, agents can perform complex global computations in dynamic networks, challenging assumptions about communication limits.
Content-oblivious networks can count and simulate message passing far more efficiently than previously thought, shrinking the pulse complexity from $O(n^3)$ to $O(n \log^2 n)$ for counting and $O(b)$ per process for message simulation.
