In the context of distributed certification, the recognition of graph cl...
In this paper we study the dynamic behavior of threshold networks on
und...
In majority voting dynamics, a group of n agents in a social network are...
A proof-labeling scheme (PLS) for a boolean predicate Π on labeled graph...
We study the design of energy-efficient algorithms for the LOCAL and CON...
During the last two decades, a small set of distributed computing models...
A graph G=(V,E) is a geometric intersection graph if every node v ∈ V
is...
Distributed certification, whether it be proof-labeling schemes, locally...
We study the dynamic and complexity of the generalized Q2R automaton. We...
We consider the problem of studying the simulation capabilities of the
d...
We present compact distributed interactive proofs for the recognition of...
Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for
aut...
In distributed interactive proofs, the nodes of a graph G interact with ...
An automata network is a network of entities, each holding a state from ...
Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the exist...
In this paper we study the family of two-state Totalistic Freezing Cellu...
In this paper we study the family of freezing cellular automata (FCA) in...
Diffusion-Limited Aggregation (DLA) is a cluster growth model that consi...
We introduce a restricted version of the Diffusion Limited Aggregation (...
Problems related to finding induced subgraphs satisfying given propertie...
The Naming Game has been studied to explore the role of self-organizatio...