scientific article; zbMATH DE number 2102782
From MaRDI portal
Publication:4818870
zbMath1046.68535MaRDI QIDQ4818870
Mordechai M. Yung, Xiang-Dong Yu
Publication date: 24 September 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence (68T99) Distributed systems (68M14)
Related Items (30)
Asynchronous deterministic rendezvous in graphs ⋮ Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults ⋮ Optimal rendezvous on a line by location-aware robots in the presence of spies* ⋮ Price of asynchrony in mobile agents computing ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Almost universal anonymous rendezvous in the plane ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ How to meet in anonymous network ⋮ Gathering of robots in a ring with mobile faults ⋮ Map construction of unknown graphs by multiple agents ⋮ Sliding encryption: A cryptographic tool for mobile agents ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Time versus space trade-offs for rendezvous in trees ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Deterministic symmetric rendezvous with tokens in a synchronous torus ⋮ How to meet asynchronously at polynomial cost ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Mobile Agent Rendezvous in a Ring Using Faulty Tokens ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Gathering in dynamic rings ⋮ Black hole search in common interconnection networks ⋮ Linear rendezvous with asymmetric clocks ⋮ Unnamed Item ⋮ Deterministic polynomial approach in the plane ⋮ Anonymous meeting in networks ⋮ Fast rendezvous on a cycle by agents with different speeds
This page was built for publication:
