13 citations · 30 across the 18 of their papers we have counts for
22 papers
Beeping Deterministic CONGEST Algorithms in Graphs
Pawel Garncarek, Dariusz R. Kowalski, Shay Kutten +1
The Beeping Network (BN) model captures important properties of biological processes. Paradoxically, the extremely limited communication capabilities of such nodes has helped BN be…
Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity
Dariusz R. Kowalski, Miguel A. Mosteiro
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 precisely, th…
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…
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…
Station Assignment with Reallocation
Austin Halper, Miguel A. Mosteiro, Yulia Rossikova +1
We study a dynamic allocation problem that arises in various scenarios where mobile clients joining and leaving the system have to communicate with static stations via radio transm…
Graph Ranking and the Cost of Sybil Defense
Gwendolyn Farach-Colton, Martin Farach-Colton, Leslie Ann Goldberg +5
Ranking functions such as PageRank assign numeric values (ranks) to nodes of graphs, most notably the web graph. Node rankings are an integral part of Internet search algorithms, s…