Pages that link to "Item:Q4909421"
From MaRDI portal
The following pages link to How to Gather Asynchronous Oblivious Robots on Anonymous Rings (Q4909421):
Displaying 11 items.
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
- On asynchronous rendezvous in general graphs (Q1625604) (← links)
- Parameterized verification of algorithms for oblivious robots on a ring (Q2225474) (← links)
- Gathering on rings under the look-compute-move model (Q2256947) (← links)
- Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
- Gathering six oblivious robots on anonymous symmetric rings (Q2447532) (← links)
- Gathering asynchronous oblivious mobile robots in a ring (Q2474070) (← links)
- Price of asynchrony in mobile agents computing (Q2637351) (← links)
- Optimal Gathering of Oblivious Robots in Anonymous Graphs (Q2868646) (← links)
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model (Q2961405) (← links)