Pages that link to "Item:Q986558"

The following pages link to Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558):

Displaying 31 items.

• Anonymous meeting in networks (Q262278) (← links)
• Optimal probabilistic ring exploration by semi-synchronous oblivious robots (Q391193) (← links)
• Gathering asynchronous oblivious agents with local vision in regular bipartite graphs (Q392198) (← links)
• 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)
• Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
• Memory optimal dispersion by anonymous mobile robots (Q831752) (← links)
• Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
• On asynchronous rendezvous in general graphs (Q1625604) (← 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)
• How many oblivious robots can explore a line (Q1944194) (← links)
• Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
• Ring exploration with myopic luminous robots (Q2139099) (← links)
• Gathering robots in graphs: the central role of synchronicity (Q2215970) (← links)
• Optimal torus exploration by oblivious robots (Q2218466) (← links)
• Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
• Gathering on rings under the look-compute-move model (Q2256947) (← links)
• Embedded pattern formation by asynchronous robots without chirality (Q2318112) (← links)
• Deterministic polynomial approach in the plane (Q2353250) (← links)
• Distributed graph searching with a sense of direction (Q2355324) (← links)
• Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← 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)
• On the self-stabilization of mobile oblivious robots in uniform rings (Q2513610) (← links)
• Universal Systems of Oblivious Mobile Robots (Q2835029) (← 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)
• Ring exploration of myopic luminous robots with visibility more than one (Q6044461) (← links)
• Memory optimal dispersion by anonymous mobile robots (Q6094723) (← links)