Series: Synthesis Lectures on Distributed Computing Theory

The Theory of Timed I/O Automata, Second Edition

Link Reversal Algorithms

Concurrent Crash-Prone Shared Memory Systems

Secure Multi-Party Computation Against Passive Adversaries

Distributed Graph Coloring

Network Topology and Fault-Tolerant Consensus

The Mobile Agent Rendezvous Problem in the Ring

Impossibility Results for Distributed Computing

Distributed Computing by Oblivious Mobile Robots

Distributed Computing Pearls

Quorum Systems

New Models for Population Protocols

Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems

Recoverable Mutual Exclusion

Fault-tolerant Agreement in Synchronous Message-passing Systems

Consistent Distributed Storage

Principles of Transactional Memory

Recoverable Mutual Exclusion

Decidability of Parameterized Verification

Cooperative Task-Oriented Computing

Introduction to Distributed Self-Stabilizing Algorithms