Pages that link to "Item:Q2799477"
From MaRDI portal
The following pages link to Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences (Q2799477):
Displaying 28 items.
- Anonymous meeting in networks (Q262278) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q831752) (← links)
- On deterministic rendezvous at a node of agents with arbitrary velocities (Q1705703) (← links)
- Reaching a target in the plane with no information (Q1799599) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Pebble guided near optimal treasure hunt in anonymous graphs (Q2117728) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Deterministic treasure hunt in the plane with angular hints (Q2205634) (← links)
- Asynchronous approach in the plane: a deterministic polynomial algorithm (Q2318113) (← links)
- Byzantine gathering in networks (Q2359766) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q2672445) (← links)
- Pebble guided optimal treasure hunt in anonymous graphs (Q2672573) (← links)
- Deterministic Meeting of Sniffing Agents in the Plane (Q2835027) (← links)
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (Q2971126) (← links)
- Byzantine Gathering in Networks with Authenticated Whiteboards (Q2980903) (← links)
- (Q3300812) (← links)
- Treasure Hunt with Advice (Q3460725) (← links)
- (Q5002836) (← links)
- (Q5091040) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots (Q5918539) (← links)
- Gathering in dynamic rings (Q5919424) (← links)
- Time versus cost tradeoffs for deterministic rendezvous in networks (Q5964898) (← links)
- Almost universal anonymous rendezvous in the plane (Q6046947) (← links)
- Impact of knowledge on the cost of treasure hunt in trees (Q6087562) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q6094723) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185) (← links)
- Deterministic rendezvous in infinite trees (Q6140349) (← links)
