Pages that link to "Item:Q2447532"
From MaRDI portal
The following pages link to Gathering six oblivious robots on anonymous symmetric rings (Q2447532):
Displaying 17 items.
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- A unified approach for gathering and exclusive searching on rings under weak assumptions (Q518678) (← links)
- Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558) (← links)
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966) (← links)
- Gathering robots in graphs: the central role of synchronicity (Q2215970) (← links)
- Gathering on rings under the look-compute-move model (Q2256947) (← links)
- Formal verification of mobile robot protocols (Q2359768) (← links)
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings (Q2407627) (← links)
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach (Q2422768) (← links)
- Universal Systems of Oblivious Mobile Robots (Q2835029) (← links)
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model (Q2961405) (← links)
- Gathering over Meeting Nodes in Infinite Grid* (Q5044391) (← links)
- Time optimal gathering of myopic robots on an infinite triangular grid (Q6155253) (← links)
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid (Q6169957) (← links)
- On gathering of semi-synchronous robots in graphs (Q6536329) (← links)
- Time optimal gathering of myopic robots on an infinite triangular grid (Q6652437) (← links)
