Pages that link to "Item:Q2961405"

The following pages link to Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model (Q2961405):

Displaying 12 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 oblivious robots on infinite grids with minimum traveled distance (Q528200) (← 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)
• Gathering robots in graphs: the central role of synchronicity (Q2215970) (← links)
• Gathering on rings under the look-compute-move model (Q2256947) (← links)
• Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings (Q2407627) (← links)
• Gathering six oblivious robots on anonymous symmetric rings (Q2447532) (← links)
• Optimal Gathering of Oblivious Robots in Anonymous Graphs (Q2868646) (← links)
• MinMax-Distance Gathering on Given Meeting Points (Q2947015) (← links)
• Connected reconfiguration of lattice-based cellular structures by finite-memory robots (Q5918539) (← links)