48 citations · 93 across the 24 of their papers we have counts for
7 papers · 1 filter
Deterministic non-adaptive contention resolution on a shared channel
Gianluca De Marco, Dariusz R. Kowalski, Grzegorz Stachowiak
In a multiple access channel, autonomous stations are able to transmit and listen to a shared device. A fundamental problem, called \textit{contention resolution}, is to allow any…
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…
Stable Scheduling in Transactional Memory
Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski +1
We study computer systems with transactions executed on a set of shared objects. Transactions arrive continually subjects to constrains that are framed as an adversarial model and…
Optimal Algorithms for Free Order Multiple-Choice Secretary
Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta +1
Suppose we are given integer and boxes labeled by an adversary, each containing a number chosen from an unknown distribution. We have to choose an orde…
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…
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…