13 citations · 13 across the 10 of their papers we have counts for
14 papers
Generalized Framework for Group Testing: Queries, Feedbacks and Adversaries
Marek Klonowski, Dariusz R. Kowalski, Dominik Pajak
In the Group Testing problem, the objective is to learn a subset K of some much larger domain N, using the shortest-possible sequence of queries Q. A feedback to a query provides s…
What Do Our Choices Say About Our Preferences?
Krzysztof Grining, Marek Klonowski, Małgorzata Sulkowska
Taking online decisions is a part of everyday life. Think of buying a house, parking a car or taking part in an auction. We often take those decisions publicly, which may breach ou…
Probabilistic Counters for Privacy Preserving Data Aggregation
Dominik Bojko, Krzysztof Grining, Marek Klonowski
Probabilistic counters are well-known tools often used for space-efficient set cardinality estimation. In this paper, we investigate probabilistic counters from the perspective of…
Energy Efficient Adversarial Routing in Shared Channels
Bogdan S. Chlebus, Elijah Hradovich, Tomasz Jurdzinski +2
We investigate routing on networks modeled as multiple access channels, when packets are injected continually. There is an energy cap understood as a bound on the number of station…
Contention resolution on a restrained channel
Elijah Hradovich, Marek Klonowski, Dariusz R. Kowalski
We examine deterministic broadcasting on multiple-access channels for a scenario when packets are injected continuously by an adversary to the buffers of the devices at rate pa…
Broadcast in radio networks: time vs. energy tradeoffs
Marek Klonowski, Dominik Pająk
In wireless networks, consisting of battery-powered devices, energy is a costly resource and most of it is spent on transmitting and receiving messages. Broadcast is a problem wher…
Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel
Marek Klonowski, Dariusz R. Kowalski, Jarosław Mirek +1
We study the problem of scheduling jobs on fault-prone machines communicating via a shared channel, also known as multiple-access channel. We have arbitrary length jobs to be s…
Ordered and Delayed Adversaries and How to Work against Them on a Shared Channel
Marek Klonowski, Dariusz R. Kowalski, Jaroslaw Mirek
In this work we define a class of ordered adversaries causing distractions according to some partial order fixed by the adversary before the execution, and study how they affect pe…
How to Cooperate Locally to Improve Global Privacy in Social Networks? On Amplification of Privacy Preserving Data Aggregation
Krzysztof Grining, Marek Klonowski, Małgorzata Sulkowska
In many systems privacy of users depends on the number of participants applying collectively some method to protect their security. Indeed, there are numerous already classic resul…
On spreading rumor in heterogeneous systems
Jacek Cichoń, Zbigniew Goł\eobbiewski, Marcin Kardas +2
In this paper we consider a model of spreading information in heterogeneous systems wherein we have two kinds of objects. Some of them are active and others are passive. Active obj…
On Location Hiding in Distributed Systems
Karol Gotfryd, Marek Klonowski, Dominik Pająk
We consider the following problem - a group of mobile agents perform some task on a terrain modeled as a graph. In a given moment of time an adversary gets an access to the graph a…
Towards Extending Noiseless Privacy -- Dependent Data and More Practical Approach
Krzysztof Grining, Marek Klonowski
In 2011 Bhaskar et al. pointed out that in many cases one can ensure sufficient level of privacy without adding noise by utilizing adversarial uncertainty. Informally speaking, thi…
Practical Fault-Tolerant Data Aggregation
Krzysztof Grining, Marek Klonowski, Piotr Syga
During Financial Cryptography 2012 Chan et al. presented a novel privacy-protection fault-tolerant data aggregation protocol. Comparing to previous work, their scheme guaranteed pr…
Dynamic sharing of a multiple access channel
Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski +1
In this paper we consider the mutual exclusion problem on a multiple access channel. Mutual exclusion is one of the fundamental problems in distributed computing. In the classic ve…