Distributed graph coloring is one of the most extensively studied proble...
We consider the classical contention resolution problem where nodes arri...
In this paper, we consider contention resolution on a multiple-access
co...
In this paper, we study gossip algorithms in communication models that
d...
Wireless networks are vulnerable to adversarial jamming due to the open
...
Consider a single-hop, multi-channel, synchronous radio network in which...
For many distributed algorithms, neighborhood size is an important param...
Given a graph, a maximal independent set (MIS) is a maximal subset of
pa...