activity
20142022
most citedDistinguishing Views in Symmetric Networks: A Tight Lower Bound

5 citations · 5 across the 8 of their papers we have counts for

collaborators

11 papers

cs.DS2022

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…

cs.DC2021

Tree exploration in dual-memory model

Dominik Bojko, Karol Gotfryd, Dariusz R. Kowalski +1

We study the problem of online tree exploration by a deterministic mobile agent. Our main objective is to establish what features of the model of the mobile agent and the environme…

cs.DS2021

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…

cs.DS2021

Efficient Deterministic Quantitative Group Testing for Precise Information Retrieval

Dariusz R. Kowalski, Dominik Pajak

The Quantitative Group Testing (QGT) is about learning a (hidden) subset of some large domain using a sequence of queries, where a result of a query provides information ab…

cs.DC2019

Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol

Frederik Mallmann-Trenn, Yannic Maus, Dominik Pajak

We study a process of \emph{averaging} in a distributed system with \emph{noisy communication}. Each of the agents in the system starts with some value and the goal of each agent i…

cs.MA2018

Self-Stabilizing Task Allocation In Spite of Noise

Anna Dornhaus, Nancy Lynch, Frederik Mallmann-Trenn +2

We study the problem of distributed task allocation inspired by the behavior of social insects, which perform task allocation in a setting of limited capabilities and noisy environ…

cs.DC2018

On Simple Back-Off in Unreliable Radio Networks

Seth Gilbert, Nancy Lynch, Calvin Newport +1

In this paper, we study local and global broadcast in the dual graph model, which describes communication in a radio network with both reliable and unreliable links. Existing work…

cs.DC2017

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…

cs.MA2016

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…

cs.DS2015

Time and space optimality of rotor-router graph exploration

Artur Menc, Dominik Pająk, Przemysław Uznański

We consider the problem of exploration of an anonymous, port-labeled, undirected graph with nodes and edges and diameter , by a single mobile agent. Initially the agent…

cs.DM2014★ 5 cited

Distinguishing Views in Symmetric Networks: A Tight Lower Bound

Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak

The view of a node in a port-labeled network is an infinite tree encoding all walks in the network originating from this node. We prove that for any integers , there…