Filter by topic
Beyond the Boundary: Optimal Grid Dispersion by Spread, Reverse, and Collect
ICDCN
Asynchronous Dispersion with Optimal Time Complexity
ICPP
▸ 2 earlier versions
-
BA: Asynchronous Dispersion with Optimal Time Complexity
Brief announcement · SPAA · 2026 · arXiv
-
BA: Optimal Dispersion under Asynchrony
Brief announcement · DISC · 2025 · arXiv
Universal Dancing by Luminous Robots Under Sequential Schedulers
SIROCCO
▸ 1 earlier version
-
BA: Universal Dancing by Luminous Robots Under Sequential Schedulers
Brief announcement · DISC · 2025 · arXiv
Faster Leader Election via Mobile Agents and its Applications
Theor. Comput. Sci.
Universal pattern formation by oblivious robots under sequential schedulers
Distributed Computing
▸ 1 earlier version
-
Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation
Conference version · SIROCCO · 2025 · arXiv
Optimal Luminous UCF under Asynchrony
J. Parallel Distrib. Comput.
▸ 1 earlier version
-
BA: Optimal Uniform Circle Formation by Asynchronous Luminous Robots.
Brief announcement · DISC · 2024 · arXiv
Dispersion of Mobile Robots on Directed Anonymous Graphs.
J. Parallel Distrib. Comput.
▸ 1 earlier version
-
Dispersion of Mobile Robots on Directed Anonymous Graphs.
Conference version · SIROCCO · 2022
Dispersion is (Almost) Optimal under (A)synchrony
SPAA
Exploring Dangerous Graphs with Byzantine Companions
ICDCS
Asynchronous Separation of Unconscious Colored Robots
Intern. J. Netw. Comput.
▸ 1 earlier version
-
Asynchronous Separation of Unconscious Colored Robots
Conference version · CANDARW:PDAA · 2024
Deterministic Treasure Hunt and Rendezvous in Arbitrary Connected Graphs.
Inf. Process. Lett.
Graph Exploration by a Deterministic Memoryless Automaton with Pebbles.
Discrete Appl. Math.
Maximal Independent Set via Mobile Robots.
ICDCN
Time-Color Tradeoff on Uniform Circle Formation by Asynchronous Robots.
IPDPS
The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots.
IWOCA
Distributed Algorithms for Filling MIS Vertices of an Arbitrary Graph by Myopic Luminous Robots.
Theor. Comput. Sci.
▸ 1 earlier version
-
Filling MIS Vertices by Myopic Luminous Robots.
Conference version · ICDCIT · 2023 · arXiv
Dispersion of Mobile Robots in Spite of Faults.
SSS
Computing Functions by Teams of Deterministic Finite Automata
arXiv
Area Convergence of Weaker Robots with Additional Capabilities.
Comput. J.
▸ 1 earlier version
-
Convergence of even simpler robots without position information.
Conference version · NETYS · 2017 · arXiv
Randomized Gathering of Asynchronous Mobile Robots.
Theor. Comput. Sci.
Dispersion of Mobile Robots Tolerating Faults.
WDALFR
ICDCIT
Fort Formation by an Automaton.
COMSNETS
Surveillance of Uneven Surface with Self-organizing Unmanned Aerial Vehicles.
IEEE Trans. Mobile Comput.
▸ 1 earlier version
-
Surveillance of uneven surface with unmanned aerial vehicles.
Conference version · ICDCN · 2020
Conic Formation in Presence of Faulty Robots.
ALGOSENSORS
Collaborative Evacuation of Mobile Robots.
ICDCN
Gathering of mobile robots with weak multiplicity detection in presence of crash-faults.
J. Parallel Distrib. Comput.
▸ 1 earlier version
-
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection.
Conference version · ICDCN · 2017 · arXiv
Chauffeuring a crashed robot from a disk.
ALGOSENSORS
Evacuating two robots from two unknown exits on the perimeter of a disk with wireless communication.
ICDCN