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 …

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 …

In round-by-round models of distributed computing processes run in a sequence of
(synchronous or asynchronous) rounds. The advantage of the round-by-round approach is …

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 …

A message adversary is a daemon that suppresses messages in round-based message-
passing synchronous systems in which no process crashes. A property imposed on a …

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 …

The benefits of developing algorithms via recursion are well known. However, little use of
recursion has been done in distributed algorithms, in spite of the fact that recursive …

In centralized computing we can compute a function composing a sequence of elementary
functions, where the output of the i-th function in the sequence is the input to the i+ 1-st …

The wait-free read-write memory model has been characterized as an iterated\emph
{Immediate Snapshot}(IS) task. The IS task is\emph {affine}---it can be defined as a (sub) set …