Contents

• Preface
• Lecture 2
  • Byzantine Agreement
    • Impossibility Proofs
  • Comments
• Lecture 3
  • An exponential protocol
• Lecture 4
  • A Polynomial Solution for Byzantine Agreement
    • Consistent broadcast
  • Implementation of Byzantine agreement
• Lecture 5
  • Consensus in Asynchronous Systems
• Lecture 6
  • The Triumph of Randomization
    • A Randomized Protocol for Consensus
• Lecture 7
  • Unreliable Failure Detectors for Reliable Distributed Systems^*
  • Properties of failure detectors
  • Solving consensus using S
    • The lower bound
• Lecture 8
  • Solving consensus using
• Lecture 9
  • Self-Stabilization
• Lecture 10
  • Locality and Graph Algorithms
    • The Model
    • Maximal Independent Set in the Ring
  • Lower bound for MIS in a ring
• Lecture 11
  • Maximal Independent Sets in General Graphs
  • Detour: Small stochastic spaces
    • How to generate pairwise independence
• Lecture 12
  • Network Decomposition
• Lecture 13
  • Introduction
  • Sperner's lemma
  • Sperner's lemma in action
• Lecture 14
  • Routing in Parallel Computers
• Homework 1
• Homework 2
• Homework 3
• Homework 4
• Homework 5
• Solutions to homework 1
• Solutions to homework 2
• Solutions to homework 3
• Solutions to homework 4
• Solutions to homework 5
• References
• About this document ...