48 citations · 158 across the 45 of their papers we have counts for
56 papers
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…
Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski
We develop deterministic algorithms for the problems of consensus, gossiping and checkpointing with nodes prone to failing. Distributed systems are modeled as synchronous complete…
Fault-Tolerant Consensus in Quantum Networks
MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski
Fault-tolerant consensus is about reaching agreement on some of the input values in a limited time by non-faulty autonomous processes, despite of failures of processes or communica…
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…