13 citations · 13 across the 9 of their papers we have counts for
9 papers
Stable Blockchain Sharding under Adversarial Transaction Generation
Ramesh Adhikari, Costas Busch, Dariusz R. Kowalski
Sharding is used to improve the scalability and performance of blockchain systems. We investigate the stability of blockchain sharding, where transactions are continuously generate…
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…
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…
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…
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…
Information Gathering in Ad-Hoc Radio Networks with Tree Topology
Marek Chrobak, Kevin Costello, Leszek Gasieniec +1
We study the problem of information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree, with edges directed towards…