48 citations · 92 across the 19 of their papers we have counts for
7 papers · 1 filter
Ultra-Resilient Superimposed Codes: Near-Optimal Construction and Applications
Gianluca De Marco, Dariusz R. Kowalski
A superimposed code is a collection of binary vectors (codewords) with the property that no vector is contained in the Boolean sum of any others, enabling unique identification…
Time and Energy Efficient Contention Resolution in Asynchronous Shared Channels
Gianluca De Marco, Dariusz R. Kowalski, Grzegorz Stachowiak
A number of stations, independently activated over time, is able to communicate by transmitting and listening to a shared channel in discrete time slots, and a message is successfu…
Efficient Algorithm for Deterministic Search of Hot Elements
Dariusz R. Kowalski, Dominik Pajak
When facing a very large stream of data, it is often desirable to extract most important statistics online in a short time and using small memory. For example, one may want to quic…
Deterministic coloring algorithms in the LOCAL model
Dariusz R. Kowalski, Piotr Krysta
We study the problem of bi-chromatic coloring of hypergraphs in the LOCAL distributed model of computation. This problem can easily be solved by a randomized local algorithm with n…
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…
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…