4 papers
Using random spanning trees in survivable networks design
Blazej Wrobel, Dominik Bojko
We investigate a process of joining random spanning trees on a fixed clique . The joined trees may not be disjoint and multiple edges are replaced by one simple edge. This…
Taking snapshots from a stream
Dominik Bojko, Jacek Cichoń
This work is devoted to a certain class of probabilistic snapshots for elements of the observed data stream. We show you how one can control their probabilistic properties and we s…
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…
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…