Survey of local algorithms
J Suomela - ACM Computing Surveys (CSUR), 2013 - dl.acm.org
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 …
size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the …
Approximation ratios of graph neural networks for combinatorial problems
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 …
(GNNs) can be for learning approximation algorithms for combinatorial problems. To this …
Local computation: Lower and upper bounds
F Kuhn, T Moscibroda, R Wattenhofer - Journal of the ACM (JACM), 2016 - dl.acm.org
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 …
science. Not surprisingly, in distributed systems and networking research, an equally …
Survey on algorithms for self-stabilizing overlay networks
M Feldmann, C Scheideler, S Schmid - ACM Computing Surveys (CSUR …, 2020 - dl.acm.org
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 …
and reoccurring themes in networking. This article presents a survey of state-of-the-art …
Locally-iterative distributed (Δ+ 1)-coloring and applications
L Barenboim, M Elkin, U Goldenberg - ACM Journal of the ACM (JACM), 2021 - dl.acm.org
We consider graph coloring and related problems in the distributed message-passing
model. Locally-iterative algorithms are especially important in this setting. These are …
model. Locally-iterative algorithms are especially important in this setting. These are …
Distributed routing algorithms to manage power flow in agent-based active distribution network
PH Nguyen, WL Kling, G Georgiadis… - 2010 IEEE PES …, 2010 - ieeexplore.ieee.org
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 …
problems and challenges on bi-directional power flow in the network and the uncertainty in …
Optimal dynamic distributed MIS
K Censor-Hillel, E Haramaty, Z Karnin - … of the 2016 ACM Symposium on …, 2016 - dl.acm.org
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 …
computing. The local nature of an MIS allows for fast solutions in a static distributed setting …
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
M Åstrand, J Suomela - Proceedings of the twenty-second annual ACM …, 2010 - dl.acm.org
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 …
synchronous communication rounds in a weighted graph, independent of the number of …
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments
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 …
stabilization, a general and lightweight fault-tolerant concept in distributed computing. In this …
SKIP+ A Self-Stabilizing Skip Graph
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 …
between its members. Hypercubic topologies facilitate such operations while each node …