Pages that link to "Item:Q3525798"
From MaRDI portal
The following pages link to Mobile Agent Rendezvous in a Synchronous Torus (Q3525798):
Displaying 16 items.
- A unified approach for gathering and exclusive searching on rings under weak assumptions (Q518678) (← links)
- Partial gathering of mobile agents in asynchronous unidirectional rings (Q905844) (← links)
- Move-optimal partial gathering of mobile agents in asynchronous trees (Q1680543) (← links)
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
- Mapping simple polygons: how robots benefit from looking back (Q1939675) (← links)
- Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings (Q2182313) (← links)
- Optimal Gathering of Oblivious Robots in Anonymous Graphs (Q2868646) (← links)
- MinMax-Distance Gathering on Given Meeting Points (Q2947015) (← links)
- Rendezvous Problem (Q2961403) (← links)
- Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty (Q2961404) (← links)
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model (Q2961405) (← links)
- Ten Open Problems in Rendezvous Search (Q2961406) (← 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)
- Mobile Agent Rendezvous in a Ring Using Faulty Tokens (Q5445769) (← links)
- Gathering in dynamic rings (Q5919424) (← links)