6 citations · 25 across the 14 of their papers we have counts for
4 papers · 1 filter
Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits
Huda Chuangpishit, Jurek Czyzowicz, Leszek Gasieniec +3
Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection.…
Deterministic Digital Clustering of Wireless Ad Hoc Networks
Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rozanski +1
We consider deterministic distributed communication in wireless ad hoc networks of identical weak devices under the SINR model without predefined infrastructure. Most algorithmic r…
MST in O(1) Rounds of the Congested Clique
Tomasz Jurdzinski, Krzysztof Nowicki
We present a distributed randomized algorithm finding Minimum Spanning Tree (MST) of a given graph in O(1) rounds, with high probability, in the Congested Clique model. The input g…
MSF and Connectivity in Limited Variants of the Congested Clique
Tomasz Jurdzinski, Krzysztof Nowicki
The congested clique is a synchronous, message-passing model of distributed computing in which each computational unit (node) in each round can send message of O(log n) bits to eac…