scientific article; zbMATH DE number 7053297
From MaRDI portal
Publication:5743418
zbMath1421.68119MaRDI QIDQ5743418
Yoann Dieudonné, Andrzej Pelc, David Peleg
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095161
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Agent technology and artificial intelligence (68T42)
Related Items (5)
Price of asynchrony in mobile agents computing ⋮ Move-optimal partial gathering of mobile agents in asynchronous trees ⋮ Rendezvous Problem ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ Deterministic polynomial approach in the plane
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Operations research/management science at work.
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Decidability Classes for Mobile Agents Computing
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- Deterministic Rendezvous in Trees with Little Memory
- Rendezvous of Mobile Agents without Agreement on Local Orientation
- Undirected connectivity in log-space
- How to Meet in Anonymous Network
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Two Dimensional Rendezvous Search
- Reaching Agreement in the Presence of Faults
- The Byzantine generals strike again
- Finding Your Kids When They Are Lost
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Rendezvous search on a graph
- Rendezvous search when marks are left at the starting points
- Rendezvous search on labeled networks
- Rendezvous Search on the Line
- Minimax Rendezvous on the Line
- The Rendezvous Search Problem
- How to meet when you forget
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Randomized Rendez-Vous with Limited Memory
- Probability and Computing
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- The rendezvous problem on discrete locations
- LATIN 2004: Theoretical Informatics
This page was built for publication:
