I. Rapaport

In this paper we present distributed property-testing algorithms for graph properties in the CONGEST model, with emphasis on testing subgraph-freeness. Expand

We introduce necessary conditions for a cellular automaton to be ''universal'', according to a precise notion of simulation, related both to the dynamics of cellular automata and to their computational power. Expand

A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states into blocks and by letting interact neighbor blocks. Expand

In the standard CONGEST model for distributed network computing, it is known that "global" tasks such as minimum spanning tree, diameter, and all-pairs shortest paths, consume large bandwidth, for their running-time is $\Omega(\mbox{poly}(n))$ rounds in $n$-node networks with constant diameter. Expand

We find a non-trivial communication protocol describing the dynamics of an elementary CA, and we prove that there are no simpler descriptions (protocols) for such CA. Expand

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

In a distributed locally-checkable proof, we are interested in checking the legality of a given network configuration with respect to some Boolean predicate, and we require that at most one node be marked 1. Expand

In a previous work we began to study the question of “how to compare” cellular automata (CA). Expand