We consider an extension to the geometric amoebot model that allows amoebots to form so-
called circuits. Given a connected amoebot structure, a circuit is a subgraph formed by the …

LCLs or locally checkable labelling problems (eg maximal independent set, maximal
matching, and vertex colouring) in the LOCAL model of computation are very well …

Fault-tolerant distributed algorithms are notoriously hard to get right. In this paper we
introduce an automated method that helps in that process: the designer provides …

Consider a computer network that consists of a path with n nodes. The nodes are labeled
with inputs from a constant-sized set, and the task is to find output labels from a constant …

A set of mutually distrusting participants that want to agree on a common opinion must solve
an instance of a Byzantine agreement problem. These problems have been extensively …

This paper considers the basic PULL model of communication, in which in each round, each
agent extracts information from few randomly chosen agents. We seek to identify the …

Fault-tolerant distributed algorithms play an increasingly important role in many applications,
and their correct and efficient implementation is notoriously difficult. We present an …

We give fault-tolerant algorithms for establishing synchrony in distributed systems in which
each of the n nodes has its own clock. Our algorithms operate in a very strong fault model …

This paper investigates the problem of synthesizing parameterized rings that are “self-
stabilizing by construction”. While it is known that the verification of self-stabilization for …

Synchronizing clocks in distributed systems is well-understood, both in terms of fault-
tolerance in fully connected systems, and the optimal achievable local skew in general fault …