Distributed algorithms are explained intuitively and from different perspectives, through informal descriptions and illuminating examples and exercises. Proof sketches, arguing the correctness of an algorithm or explaining the idea behind fundamental results, and pseudocode descriptions are also provided.

The book can be used in courses for upper-level undergraduates or graduate students in computer science, or as a reference for researchers in the field.