Local Distributed Decision

DOI10.1109/FOCS.2011.17zbMath1292.68027arXiv1011.2152OpenAlexW2067202579MaRDI QIDQ5494995

Amos Korman, Pierre Fraigniaud, David Peleg

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (9)

Node labels in local decision ⋮ Can we locally compute sparse connected subgraphs? ⋮ Tight bounds for distributed minimum-weight spanning tree verification ⋮ Locality and checkability in wait-free computing ⋮ Toward more localized local algorithms: removing assumptions concerning global knowledge ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ Unnamed Item ⋮ Locality and Checkability in Wait-Free Computing ⋮ Proof labeling schemes for reachability-related problems in directed graphs

This page was built for publication: Local Distributed Decision