Pages that link to "Item:Q3408171"
From MaRDI portal
The following pages link to Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots (Q3408171):
Displaying 8 items.
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- Uniform multi-agent deployment on a ring (Q627178) (← links)
- Synchronous robots vs asynchronous lights-enhanced robots on graphs (Q737100) (← links)
- Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966) (← links)
- Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model (Q2961405) (← links)
- Network Exploration by Silent and Oblivious Robots (Q3057626) (← links)