Decidability Classes for Mobile Agents Computing

DOI10.1007/978-3-642-29344-3_31zbMath1353.68090arXiv1011.2719OpenAlexW2138178581MaRDI QIDQ2894480

Pierre Fraigniaud, Andrzej Pelc

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.2719

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)

Related Items (6)

Randomized distributed decision ⋮ How to meet asynchronously at polynomial cost ⋮ Unnamed Item ⋮ Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? ⋮ Unnamed Item ⋮ Distinguishing views in symmetric networks: a tight lower bound

This page was built for publication: Decidability Classes for Mobile Agents Computing