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

This book presents the most important fault-tolerant distributed programming abstractions
and their associated distributed algorithms, in particular in terms of reliable communication …

Exploring the power of shared memory communication objects and models, and the limits of
distributed computability are among the most exciting research areas of distributed …

In the renaming task n+ 1 processes start with unique input names taken from a large space
and must choose unique output names taken from a smaller name space, 0, 1,..., K. To rule …

In the renaming task, n+ 1 processes start with unique input names from a large space and
must choose unique output names taken from a smaller name space, 0, 1,…, K. To rule out …

We study the complexity of renaming, a fundamental problem in distributed computing in
which a set of processes need to pick distinct names from a given namespace. We prove an …

We give two new randomized algorithms for strong renaming, both of which work against an
adaptive adversary in asynchronous shared memory. The first uses repeated sampling over …

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 …

In the theory of distributed computing, the notion of a reduction is a common tool for proving
impossibility results. If task T reduces to task S, and T is impossible to solve, then so is S …

Processes in a concurrent system need to coordinate using an underlying shared memory or
a message-passing system in order to solve agreement tasks such as, for example …