48 citations · 92 across the 20 of their papers we have counts for
7 papers · 1 filter
Broadcasting Spanning Forests on a Multiple-Access Channel
Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski
The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spa…
Maximum Throughput of Multiple Access Channels in Adversarial Environments
Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki
We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is con…
Deterministic Digital Clustering of Wireless Ad Hoc Networks
Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rozanski +1
We consider deterministic distributed communication in wireless ad hoc networks of identical weak devices under the SINR model without predefined infrastructure. Most algorithmic r…
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
Dariusz R. Kowalski, Miguel A. Mosteiro
Starting with Michail, Chatzigiannakis, and Spirakis work, the problem of Counting the number of nodes in Anonymous Dynamic Networks has attracted a lot of attention. The problem i…
Lightweight Robust Framework for Workload Scheduling in Clouds
Muhammed Abdulazeez, Pawel Garncarek, Dariusz R. Kowalski +1
Reliability, security and stability of cloud services without sacrificing too much resources have become a desired feature in the area of workload management in clouds. The paper p…
Ad-hoc Affectance-selective Families for Layer Dissemination
Dariusz R. Kowalski, Harshita Kudaravalli, Miguel A. Mosteiro
Information dissemination protocols for ad-hoc wireless networks frequently use a minimal subset of the available communication links, defining a rooted "broadcast" tree. In this w…