research
∙
07/29/2022
Locally-iterative (Δ+1)-Coloring in Sublinear (in Δ) Rounds
Distributed graph coloring is one of the most extensively studied proble...
share
research
∙
11/12/2021
Robust and Optimal Contention Resolution without Collision Detection
We consider the classical contention resolution problem where nodes arri...
research
∙
02/19/2021
Tight Trade-off in Contention Resolution without Collision Detection
In this paper, we consider contention resolution on a multiple-access co...
research
∙
02/12/2021
Asynchronous Gossip in Smartphone Peer-to-Peer Networks
In this paper, we study gossip algorithms in communication models that d...
research
∙
01/12/2020
Competitive Broadcast against Adaptive Adversary in Multi-channel Radio Networks
Wireless networks are vulnerable to adversarial jamming due to the open ...
research
∙
04/12/2019
Fast and Resource Competitive Broadcast in Multi-channel Radio Networks
Consider a single-hop, multi-channel, synchronous radio network in which...
research
∙
11/08/2018
Approximate Neighbor Counting in Radio Networks
For many distributed algorithms, neighborhood size is an important param...
research
∙
05/09/2018
