48 citations · 92 across the 19 of their papers we have counts for
16 papers · 1 filter
Improved Communication Complexity of Fault-Tolerant Consensus
MohammadTaghi HajiAghayi, Dariusz R. Kowalski, Jan Olkowski
Consensus is one of the most thoroughly studied problems in distributed computing, yet there are still complexity gaps that have not been bridged for decades. In particular, in the…
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…
On the complexity of fault-tolerant consensus
Dariusz R. Kowalski, Jaroslaw Mirek
The paper studies the problem of reaching agreement in a distributed message-passing system prone to crash failures. Crashes are generated by \constrained\ adversaries - a \wadapt\…
Energy Efficient Adversarial Routing in Shared Channels
Bogdan S. Chlebus, Elijah Hradovich, Tomasz Jurdzinski +2
We investigate routing on networks modeled as multiple access channels, when packets are injected continually. There is an energy cap understood as a bound on the number of station…