Distributed Computing Through Combinatorial Topology describes techniques for analyzing
distributed algorithms based on award winning combinatorial topology research. The …

What can and cannot be computed in a distributed system is a complex function of the
system's communication model, timing model, and failure model. Considering a canonical …

This paper studies notions of locality that are inherent to the specification of distributed tasks
by identifying fundamental relationships between the various scales of computation, from the …

Consider a distributed system with $ n $ processors out of which $ f $ can be Byzantine
faulty. In the approximate agreement task, each processor $ i $ receives an input value $ x_i …

An elegant strategy for proving impossibility results in distributed computing was introduced
in the celebrated FLP consensus impossibility proof. This strategy is local in nature as at …

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 …

In this work, we extend the topology-based framework and method for the quantification and
classification of general resilient asynchronous complexity. We present the arbitrary resilient …

The class of robot convergence tasks has been shown to capture fundamental aspects of
fault-tolerant computability. A set of asynchronous robots that may fail by crashing, start from …

What can be computed in an anonymous network, where nodes are not equipped with
unique identifiers? It turns out that the answer to this question depends on the commitment …

In this paper, we establish the asynchronous computability theorem in d-solo system by
borrowing concepts from combinatorial topology, in which we state a necessary and …