Search papers, labs, and topics across Lattice.
Université Paris Cité, CNRS, IRIF, Paris, France. E-mail: lelia.blin@irif.fr
1
0
3
Electing a leader in a network can now be done with just $O(\log \log n)$ bits of memory per node, even in arbitrary anonymous networks.