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 …

An anonymous dynamic network is a network of indistinguishable processes whose
communication links may appear or disappear unpredictably over time. Previous research …

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 3n …

How to reach consensus on an average value in a dynamic crowd without revealing
identity? In this work, we study the problem of Average Network Consensus in Anonymous …

In this work we address the question of efficiency of distributed computing in anonymous,
congested and highly dynamic and not-always-connected networks/systems. More …

A 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 unpredictably over time …

We consider two simple asynchronous opinion dynamics on arbitrary graphs where every
node u of the graph has an initial value ξu (0). In the first process, which we call the …

How do we reach consensus on an average value in a dynamic crowd without revealing
identity? In this work, we study the problem of average network consensus in Anonymous …

An anonymous dynamic network is a network of indistinguishable processes whose
communication links may appear or disappear unpredictably over time. Previous research …

In the area of development of AI/ML applications in Vehicular Adhoc Networks (VANET), a
highly dynamic environment, efficient algebraic distributed computations are of utmost …