Pages that link to "Item:Q2256947"
From MaRDI portal
The following pages link to Gathering on rings under the look-compute-move model (Q2256947):
Displayed 24 items.
- Anonymous meeting in networks (Q262278) (← links)
- A unified approach for gathering and exclusive searching on rings under weak assumptions (Q518678) (← links)
- Gathering of oblivious robots on infinite grids with minimum traveled distance (Q528200) (← links)
- Synchronous robots vs asynchronous lights-enhanced robots on graphs (Q737100) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q831752) (← links)
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966) (← links)
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
- The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056) (← links)
- Ring exploration with myopic luminous robots (Q2139099) (← links)
- Gathering robots in graphs: the central role of synchronicity (Q2215970) (← links)
- Fault-induced dynamics of oblivious robots on a line (Q2304522) (← links)
- Embedded pattern formation by asynchronous robots without chirality (Q2318112) (← links)
- Asynchronous approach in the plane: a deterministic polynomial algorithm (Q2318113) (← links)
- Deterministic rendezvous with different maps (Q2323344) (← 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)
- On the self-stabilization of mobile oblivious robots in uniform rings (Q2513610) (← links)
- Universal Systems of Oblivious Mobile Robots (Q2835029) (← links)
- MinMax-Distance Gathering on Given Meeting Points (Q2947015) (← links)
- Model Checking of Robot Gathering (Q3300809) (← links)
- Gathering over Meeting Nodes in Infinite Grid* (Q5044391) (← links)
- A structured methodology for designing distributed algorithms for mobile entities (Q6065957) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q6094723) (← links)
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid (Q6169957) (← links)