6 citations · 6 across the 3 of their papers we have counts for
6 papers
Short Graph Sketches Suffice for Error-resilient Leader Verification in CONGEST
Pawel Garncarek, Tomasz Jurdziński, Dariusz Kowalski +1
Locally Checkable Proofs (LCPs) enable the verification of global graph properties using locally checkable certificates assigned by a prover. Recently, this framework was extended…
Distributed Local Verification using Proofs with(out) Errors
Paweł Garncarek, Tomasz Jurdzinski, Dariusz Kowalski +1
We study local verification of graph properties in distributed networks under the framework of \emph{locally checkable proofs} (LCPs). In an LCP, a prover assigns proof labels to n…
Beeping Deterministic CONGEST Algorithms in Graphs
Pawel Garncarek, Dariusz R. Kowalski, Shay Kutten +1
The Beeping Network (BN) model captures important properties of biological processes. Paradoxically, the extremely limited communication capabilities of such nodes has helped BN be…
Optimal Packet-oblivious Stable Routing in Multi-hop Wireless Networks
Vicent Cholvi, Paweł Garncarek, Tomasz Jurdzinski +1
Stability is an important issue in order to characterize the performance of a network, and it has become a major topic of study in the last decade. Roughly speaking, a communicatio…
Routing in Wireless Networks with Interferences
Bogdan S. Chlebus, Vicent Cholvi, Pawel Garncarek +2
We consider dynamic routing in multi-hop wireless networks with adversarial traffic. The model of wireless communication incorporates interferences caused by packets' arrivals into…
Lightweight Robust Framework for Workload Scheduling in Clouds
Muhammed Abdulazeez, Pawel Garncarek, Dariusz R. Kowalski +1
Reliability, security and stability of cloud services without sacrificing too much resources have become a desired feature in the area of workload management in clouds. The paper p…