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 …

From the winner of the Turing Award and the Abel Prize, an introduction to computational
complexity theory, its connections and interactions with mathematics, and its central role in …

Perspectives on the CAP Theorem Page 1 Perspectives on the CAP Theorem Seth Gilbert
National University of Singapore Nancy A. Lynch Massachusetts Institute of Technology …

In theclassical consensus problem, each of n processors receives a private input value and
produces a decision value which is one of the original input values, with the requirement that …

A failure detector is a fundamental abstraction in distributed computing. This article surveys
this abstraction through two dimensions. First we study failure detectors as building blocks to …

Fascinating links between the semantics of concurrent programs and algebraic topology
have been discovered and developed since the 1990s, motivated by the hope that each field …

We survey results from distributed computing that show tasks to be impossible, either
outright or within given resource bounds, in various models. The parameters of the models …

This paper introduces two new novel tools for the study of distributed computing and shows
their utility by using them to exhibit a simple derivation of the Herlihy and Shavit …