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

We initiate a thorough study of distributed property testing—producing algorithms for the
approximation problems of property testing in the CONGEST model. In particular, for the so …

We introduce a novel lower bound technique for distributed graph algorithms under
bandwidth limitations. We define the notion of fooling views and exemplify its strength by …

We study property testing in the context of distributed computing, under the classical
CONGEST model. It is known that testing whether a graph is triangle-free can be done in a …

In this paper we present two graph algorithms in the Broadcast Congested Clique model. In
this model, there are n players, which communicate in synchronous rounds. Each player …

The broadcast congested clique model (BClique) is a message-passing model of distributed
computation where n nodes communicate with each other in synchronous rounds. First, in …

The class of graphs that do not contain a path on $ k $ nodes as an induced subgraph ($
P_k $-free graphs) has rich applications in the theory of graph algorithms. This paper …

The broadcast congested clique model is a message-passing model of distributed
computation where n nodes communicate with each other in synchronous rounds. The joint …

In this paper we study a quantum version of the multiparty simultaneous message-passing
(SMP) model, and we show that in some cases, quantum communication can replace public …

We present compact distributed interactive proofs for the recognition of two important graph
classes, well-studied in the context of centralized algorithms, namely complement reducible …