In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing,
and analyzing distributed algorithms. She directs her book at a wide audience, including …

* Comprehensive introduction to the fundamental results in the mathematical foundations of
distributed computing* Accompanied by supporting material, such as lecture notes and …

Emulators that translate algorithms from the shared-memory model to two different message-
passing models are presented. Both are achieved by implementing a wait-free, atomic …

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 …

We give necessary and sufficient combinatorial conditions characterizing the class of
decision tasks that can be solved in a wait-free manner by asynchronous processes that …

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 …

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 show in this article that some concepts from homotopy theory, in algebraic topology, are
relevant for studying concurrent programs. We exhibit a natural semantics of semaphore …

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 …