48 citations · 66 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
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…
cs.DS2017★ 5 cited
Broadcasting Spanning Forests on a Multiple-Access Channel
Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski
The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spa…