48 citations · 93 across the 26 of their papers we have counts for
6 papers · 2 filters
Tree exploration in dual-memory model
Dominik Bojko, Karol Gotfryd, Dariusz R. Kowalski +1
We study the problem of online tree exploration by a deterministic mobile agent. Our main objective is to establish what features of the model of the mobile agent and the environme…
Broadcasting on Adversarial Multiple Access Channels
Bader A. Aldawsari, Bogdan S. Chlebus, Dariusz R. Kowalski
We study deterministic distributed algorithms for broadcasting on multiple-access channels. Packet injection is modeled by leaky-bucket adversaries. There is a fixed set of station…
Byzantine-Resilient Population Protocols
Costas Busch, Dariusz R. Kowalski
Population protocols model information spreading and computation in network systems where pairwise node exchanges are determined by an external random scheduler and nodes have smal…
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…
Disconnected Agreement in Networks Prone to Link Failures
Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski +1
We consider deterministic distributed algorithms for reaching agreement in synchronous networks of arbitrary topologies. Links are bi-directional and prone to failures while nodes…
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…