We present an intimate connection among the following fields:(a) distributed local
algorithms: coming from the area of computer science,(b) finitary factors of iid processes …

We present randomized distributed algorithms for the maximal independent set problem
(MIS) that, while keeping the time complexity nearly matching the best known, reduce the …

We consider a model of energy complexity in Radio Networks in which transmitting or
listening on the channel costs one unit of energy and computation is free. This simplified …

We present a low-energy deterministic distributed algorithm that computes exact Single-
Source Shortest Paths (SSSP) in near-optimal time: it runs in Õ (n) rounds and each node is …

Energy is often the most constrained resource in networks of batterypowered devices, and
as devices become smaller, they spend a larger fraction of their energy on communication …

Recent work has shown that it is sometimes feasible to significantly reduce the energy
usage of some radio-network algorithms by adaptively powering down the radio receiver …

We continue the recently started line of work on the distributed node-averaged complexity of
distributed graph algorithms. The node-averaged complexity of a distributed algorithm …

This paper focuses on the contention resolution problem on a shared communication
channel that does not support collision detection. A shared communication channel is a …

Maximal Independent Set (MIS) is one of the fundamental and most well-studied problems in
distributed graph algorithms. Even after four decades of intensive research, the best known …

We consider networks of small, autonomous devices that communicate with each other
wirelessly. Minimizing energy usage is an important consideration in designing algorithms …