Pages that link to "Item:Q3587463"
From MaRDI portal
The following pages link to Tell Me Where I Am So I Can Meet You Sooner (Q3587463):
Displayed 20 items.
- Rendezvous of heterogeneous mobile agents in edge-weighted networks (Q896142) (← links)
- On asynchronous rendezvous in general graphs (Q1625604) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← 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)
- Deterministic polynomial approach in the plane (Q2353250) (← links)
- Byzantine gathering in networks (Q2359766) (← links)
- Searching on a line: a complete characterization of the optimal solution (Q2513671) (← links)
- Price of asynchrony in mobile agents computing (Q2637351) (← links)
- Synchronous Rendezvous for Location-Aware Agents (Q3095348) (← links)
- (Q5002836) (← links)
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults (Q5056052) (← links)
- Optimal rendezvous on a line by location-aware robots in the presence of spies* (Q5057736) (← links)
- Linear rendezvous with asymmetric clocks (Q5091103) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- Gathering in the plane of location-aware robots in the presence of spies (Q5918903) (← links)
- Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks (Q6042397) (← links)