We survey the recent distributed computing literature on checking whether a given
distributed system configuration satisfies a given boolean predicate, ie, whether the …

A proof-labeling scheme (PLS) for a boolean predicate $\Pi $ on labeled graphs is a
mechanism used for certifying the legality with respect to $\Pi $ of global network states in a …

Abstract Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for
automatically translating standard centralized interactive protocols to distributed interactive …

The study of interactive proofs in the context of distributed network computing is a novel
topic, recently introduced by Kol, Oshman, and Saxena [PODC 2018]. In the spirit of …

A distributed graph algorithm is basically an algorithm where every node of a graph can look
at its neighborhood at some distance in the graph and chose its output. As distributed …

Distributed certification, whether it be proof-labeling schemes, locally checkable proofs, etc.,
deals with the issue of certifying the legality of a distributed system with respect to a given …

We extend the notion of distributed decision in the framework of distributed network
computing, inspired by both the polynomial hierarchy for Turing machines and recent results …

In the context of distributed certification, the recognition of graph classes has started to be
intensively studied. For instance, different results related to the recognition of planar …

In majority voting dynamics, a group of n agents in a social network are asked for their
preferred candidate in a future election between two possible choices. At each time step, a …

The paper tackles the issue of $\textit {checking} $ that all copies of a large data set
replicated at several nodes of a network are identical. The fact that the replicas may be …