43 citations · 96 across the 19 of their papers we have counts for
6 papers · 1 filter
Find Your Place: Simple Distributed Algorithms for Community Detection
Luca Becchetti, Andrea Clementi, Emanuele Natale +2
Given an underlying graph, we consider the following \emph{dynamics}: Initially, each node locally chooses a value in , uniformly at random and independently of other nod…
Stabilizing Consensus with Many Opinions
Luca Becchetti, Andrea Clementi, Emanuele Natale +2
We consider the following distributed consensus problem: Each node in a complete communication network of size initially holds an \emph{opinion}, which is chosen arbitrarily fr…
On the Voting Time of the Deterministic Majority Process
Dominik Kaaser, Frederik Mallmann-Trenn, Emanuele Natale
In the deterministic binary majority process we are given a simple graph where each node has one out of two initial opinions. In every round, every node adopts the majority opinion…
Probabilistic Self-Stabilization
Luca Becchetti, Andrea Clementi, Emanuele Natale +1
By using concrete scenarios, we present and discuss a new concept of probabilistic Self-Stabilization in Distributed Systems.
Noisy Rumor Spreading and Plurality Consensus
Pierre Fraigniaud, Emanuele Natale
Error-correcting codes are efficient methods for handling \emph{noisy} communication channels in the context of technological networks. However, such elaborate methods differ a lot…
Self-Stabilizing Repeated Balls-into-Bins
Luca Becchetti, Andrea Clementi, Emanuele Natale +2
We study the following synchronous process that we call "repeated balls-into-bins". The process is started by assigning balls to bins in an arbitrary way. In every subseque…