Search papers, labs, and topics across Lattice.
1
0
3
A universal rendezvous algorithm exists for anonymous agents in connected graphs with footprints, solving a long-standing open problem.
