More than two decades ago, combinatorial topology was shown to be useful for analyzing
distributed fault-tolerant algorithms in shared memory systems and in message passing …

Approximate agreement is one of the few variants of consensus that can be solved in a wait-
free manner in asynchronous systems where processes communicate by reading and …

Agreeing on a common value among a set of agents is a fundamental problem in distributed
computing, which occurs in several variants: In contrast to exact consensus, approximate …

Convex Consensus (CC) allows a set of parties to agree on a value $ v $ inside the convex
hull of their inputs with respect to a predefined abstract convexity notion, even in the …

Approximate agreement is a variant of consensus in which processes receive input values
from a domain and must output values in that domain that are sufficiently close to one …

Abstract The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy and
Shavit characterized distributed tasks that are wait-free solvable and uncovered deep …

Approximate agreement is a weaker version of consensus where two or more processes
must agree on a real number within a distance ε of each other. Many variants of this task …

The extensive studies on computing by a team of identical mobile robots operating in the
plane in Look-Compute-Move cycles have been carried out mainly in the traditional OBLOT …

Ensuring consistency in distributed systems, especially in adversarial environments, is a
fundamental challenge in theoretical computing. Approximate Agreement (AA) is a key …

We show that the hybrid systems perspective of distributed multi-robot systems is compatible
with logical models of knowledge already used in distributed computing, and demonstrate its …