The following pages link to How to meet in anonymous network (Q930910):
Displaying 23 items.
- Anonymous meeting in networks (Q262278) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q831752) (← links)
- Rendezvous of heterogeneous mobile agents in edge-weighted networks (Q896142) (← links)
- Classifying rendezvous tasks of arbitrary dimension (Q1019731) (← links)
- On deterministic rendezvous at a node of agents with arbitrary velocities (Q1705703) (← 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)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
- Asynchronous approach in the plane: a deterministic polynomial algorithm (Q2318113) (← links)
- Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
- Deterministic rendezvous with different maps (Q2323344) (← links)
- Byzantine gathering in networks (Q2359766) (← links)
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences (Q2799477) (← links)
- Ten Open Problems in Rendezvous Search (Q2961406) (← links)
- Byzantine Gathering in Networks with Authenticated Whiteboards (Q2980903) (← links)
- Synchronous Rendezvous for Location-Aware Agents (Q3095348) (← links)
- (Q5002836) (← links)
- Almost universal anonymous rendezvous in the plane (Q6046947) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q6094723) (← links)
- Deterministic rendezvous in infinite trees (Q6140349) (← links)
