scientific article; zbMATH DE number 7561452
From MaRDI portal
Publication:5091102
DOI10.4230/LIPICS.OPODIS.2018.24MaRDI QIDQ5091102
Takashi Okumura, Koichi Wada, Xavier Défago
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1804.01368
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Self-stabilizing gathering with strong multiplicity detection
- Gathering of asynchronous robots with limited visibility
- Autonomous mobile robots with lights
- Rendezvous of two robots with visible bits
- Impossibility of gathering by a set of autonomous mobile robots
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
- Distributed Computing by Mobile Robots: Gathering
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Rendezvous with constant memory
This page was built for publication:
