Survey of distributed decision

MaRDI QIDQ4967211zbMATH OpenFDO

Authors Laurent Feuilloley, Pierre Fraigniaud

Publication date 3 July 2019

Full work available at URL https://arxiv.org/abs/1606.04434, http://bulletin.eatcs.org/index.php/beatcs/article/view/411/391

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Recommendations

• Deciding and verifying network properties locally with few output bits
• What Can be Computed Locally?
• Introduction to local certification
• scientific article; zbMATH DE number 1559574
• Towards a complexity theory for local distributed computing

Cited in

(21)

• Deciding and verifying network properties locally with few output bits
• Introduction to local certification
• A hierarchy of local decision
• Approximate proof-labeling schemes
• Distributed Testing of Distance-k Colorings
• Graph classes and forbidden patterns on three vertices
• On mobile agent verifiable problems
• Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings
• Redundancy in distributed proofs
• Redundancy in distributed proofs
• Full and Local Information in Distributed Decision Making
• Local verification of global proofs
• Compact distributed certification of planar graphs
• Distributed Decision-Making Over Adaptive Networks
• On the Value of Coordination in Distributed Decision Making
• What can be verified locally?
• Distributed decision making----a unified approach.
• A time hierarchy theorem for the LOCAL model
• Distributed maximum matching verification in CONGEST
• Twenty-two new approximate proof labeling schemes
• Proof labeling schemes for reachability-related problems in directed graphs

This page was built for publication: Survey of distributed decision

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967211)