Pages that link to "Item:Q1627966"
From MaRDI portal
The following pages link to Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966):
Displaying 8 items.
- Bamboo garden trimming problem: priority schedulings (Q2003325) (← links)
- Arbitrary pattern formation on infinite regular tessellation graphs (Q2110359) (← links)
- Ring exploration with myopic luminous robots (Q2139099) (← links)
- Gathering robots in graphs: the central role of synchronicity (Q2215970) (← links)
- Gathering problems for autonomous mobile robots with lights (Q2680865) (← links)
- Distributed transformations of Hamiltonian shapes based on line moves (Q5918588) (← links)
- A structured methodology for designing distributed algorithms for mobile entities (Q6065957) (← links)
- On gathering of semi-synchronous robots in graphs (Q6536329) (← links)
