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 …

Tasks and objects are two predominant ways of specifying distributed problems where
processes should compute outputs based on their inputs. Roughly speaking, a task …

Tasks and objects are two predominant ways of specifying distributed problems. A task
specifies for each set of processes (which may run concurrently) the valid outputs of the …

In an asynchronous distributed system where any number of processes may crash, a
process may have to run solo, computing its local output without receiving any information …

We consider the models of distributed computation defined as subsets of the runs of the
iterated immediate snapshot model. Given a task T and a model M, we provide topological …

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 …

Failure patterns in modern parallel and distributed system are not necessarily uniform. The
notion of an adversary scheduler is a natural way to extend the classical wait-free and t …

This paper proposes a simple topological characterization of a large class of fair adversarial
models via affine tasks: sub-complexes of the second iteration of the standard chromatic …

The paper compares two generic techniques for deriving lower bounds and impossibility
results in distributed computing. First, we prove a speedup theorem (a-la Brandt, 2019), for …