Search papers, labs, and topics across Lattice.
2
0
1
Counting agents in anonymous population protocols can be achieved efficiently without a unique leader, challenging previous assumptions about the necessity of identifiers.
The expected convergence time of discrete incremental voting is tightly bound by graph properties, revealing critical insights into opinion dynamics in networks.
