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

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

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 …

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 …

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 …

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

The usual S 5 n epistemic model for a multi-agent system is based on a Kripke frame, which
is a graph whose edges are labeled with agents that do not distinguish between two states …

We prove tight bounds on the time needed to solve k-set agreement. In this problem, each
processor starts with an arbitrary input value taken from a fixed set, and halts after choosing …