Fault-Tolerant Rendezvous in Networks

DOI10.1007/978-3-662-43951-7_35zbMath1409.68030OpenAlexW1588915663MaRDI QIDQ5167856

Arnaud Labourel, Jérémie Chalopin, Andrzej Pelc, Yoann Dieudonné

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43951-7_35

zbMATH Keywords

rendezvousdeterministic algorithmmobile agentdelay fault

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Deterministic Meeting of Sniffing Agents in the Plane

This page was built for publication: Fault-Tolerant Rendezvous in Networks