The following pages link to How to meet in anonymous network (Q930910):
Displayed 7 items.
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Classifying rendezvous tasks of arbitrary dimension (Q1019731) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
- Synchronous Rendezvous for Location-Aware Agents (Q3095348) (← links)