Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs

DOI10.1007/978-3-662-43951-7_16zbMath1409.68032OpenAlexW191324582MaRDI QIDQ5167837

Jochen Seidel, Roger Wattenhofer, Yuval Emek

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_16

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)

Related Items (4)

Node labels in local decision ⋮ Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms ⋮ A hierarchy of local decision ⋮ Topology recognition with advice

This page was built for publication: Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs