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

A wait-free implementation of a concurrent data object is one that guarantees that any
process can complete any operation in a finite number of steps, regardless of the execution …

We introduce the concept of unreliable failure detectors and study how they can be used to
solve Consensus in asynchronous systems with crash failures. We characterise unreliable …

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

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

Fault-Tolerant Message-Passing Distributed Systems Page 1 Michel Raynal Fault-Tolerant
Message-Passing Distributed Systems An Algorithmic Approach Page 2 Fault-Tolerant …

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 …

We define the k-SET CONSENSUS PROBLEM as an extension of the CONSENSUS
problem, where each processor decides on a single value such that the set of decided …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …