2 citations · 2 across the 2 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…
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…
Efficient Lifting of Discrete Logarithms Modulo Prime Powers
Giovanni Viglietta, Yasuyuki Kachi
We present a deterministic algorithm that, given a prime and a solution to the discrete logarithm problem with , efficiently…
Efficient Computation in Congested Anonymous Dynamic Networks
Giuseppe A. Di Luna, Giovanni Viglietta
An anonymous dynamic network is a network of indistinguishable processes whose communication links may appear or disappear unpredictably over time. Previous research has shown that…
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
Giuseppe A. Di Luna, Ryuhei Uehara, Giovanni Viglietta +1
A swarm of anonymous oblivious mobile robots, operating in deterministic Look-Compute-Move cycles, is confined within a circular track. All robots agree on the clockwise direction…