A local algorithm is a distributed algorithm that runs in constant time, independently of the
size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the …

In this paper, from a theoretical perspective, we study how powerful graph neural networks
(GNNs) can be for learning approximation algorithms for combinatorial problems. To this …

The question of what can be computed, and how efficiently, is at the core of computer
science. Not surprisingly, in distributed systems and networking research, an equally …

The maintenance of efficient and robust overlay networks is one of the most fundamental
and reoccurring themes in networking. This article presents a survey of state-of-the-art …

We consider graph coloring and related problems in the distributed message-passing
model. Locally-iterative algorithms are especially important in this setting. These are …

The current transition from passive to active electric distribution networks comes with
problems and challenges on bi-directional power flow in the network and the uncertainty in …

Finding a maximal independent set (MIS) in a graph is a cornerstone task in distributed
computing. The local nature of an MIS allows for fast solutions in a static distributed setting …

We present a distributed algorithm that finds a maximal edge packing in O (Δ+ log* W)
synchronous communication rounds in a weighted graph, independent of the number of …

This paper deals with the trade-off between time, workload, and versatility in self-
stabilization, a general and lightweight fault-tolerant concept in distributed computing. In this …

Peer-to-peer systems rely on a scalable overlay network that enables efficient routing
between its members. Hypercubic topologies facilitate such operations while each node …