13 citations · 30 across the 18 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DC2021★ 1 cited
Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader
Dariusz R. Kowalski, Miguel A. Mosteiro
Counting the number of nodes in Anonymous Dynamic Networks is enticing from an algorithmic perspective: an important computation in a restricted platform with promising application…
cs.DC2021
Time and Communication Complexity of Leader Election in Anonymous Networks
Dariusz R. Kowalski, Miguel A. Mosteiro
We study the problem of randomized Leader Election in synchronous distributed networks with indistinguishable nodes. We consider algorithms that work on networks of arbitrary topol…