This paper is centered on the complexity of graph problems in the well-studied LOCAL
model of distributed computing, introduced by Linial [FOCS'87]. It is widely known that for …

A central theme in distributed network algorithms concerns understanding and coping with
the issue of locality. Yet despite considerable progress, research efforts in this direction have …

We explore the power of interactive proofs with a distributed verifier. In this setting, the
verifier consists of n nodes and a graph G that defines their communication pattern. The …

Interactive proof systems allow a resource-bounded verifier to decide an intractable
language (or compute a hard function) by communicating with a powerful but untrusted …

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

We study a new model of verification of boolean predicates over distributed networks. Given
a network configuration, the proof-labeling scheme (PLS) model defines a distributed proof …

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 …

Proof-labeling schemes, introduced by Korman et al.(Distrib Comput 22 (4): 215–233, 2010.
https://doi. org/10.1007/s00446-010-0095-3), are a mechanism to certify that a network …

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 …

Limiting the knowledge of individual nodes is a major concern for the design of distributed
algorithms. With the LOCAL model, theoretical research already established a common …