2 citations · 3 across the 5 of their papers we have counts for
5 papers
Computing in Anonymous Dynamic Networks with One-Bit Communications
Thibaut Blanc, Giuseppe Antonio Di Luna, Giovanni Viglietta
We initiate the study of deterministic computation in anonymous dynamic networks where each agent broadcasts one bit per round and receives only the number of neighbors broadcastin…
Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks
Giuseppe A. Di Luna, Giovanni Viglietta
A communication network is said to be "anonymous" if its agents are indistinguishable from each other; it is "dynamic" if its communication links may appear or disappear unpredicta…
Black Hole Search by Scattered Agents in Dynamic Rings
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe +1
In this paper, we address the challenge of locating a black hole within a dynamic graph using a set of scattered agents, which start from arbitrary positions in the graph. A black…
Optimal Computation in Anonymous Dynamic Networks
Giuseppe A. Di Luna, Giovanni Viglietta
We give a simple characterization of the functions that can be computed deterministically by anonymous processes in dynamic networks, depending on the number of leaders in the netw…
Computing in Anonymous Dynamic Networks Is Linear
Giuseppe A. Di Luna, Giovanni Viglietta
We give the first linear-time counting algorithm for processes in anonymous 1-interval-connected dynamic networks with a leader. As a byproduct, we are able to compute in roun…