Advanced Distributed Algorithms (Spring 2019)

Lecture Time & Place: Thursday 10:00-12:00, Ziskind 155 
TA: Avi Cohen
Prerequisite: Sufficient comfort with both algorithm design & analysis, and basic knowledge in distributed algorithms (e.g.,  taking the Distributed Network Algorithms course of Prof. David Peleg).

New: Final assignment instructions

Course Schedule (tentative):

Useful Material:

  • Probabilities Inequalities: Handout by Avrim Blum and Anupam Gupta (15-859 Randomized Algorithms, CMU, Spring'11).
  • Distributed Computing -- A Locality-Sensitive Approach, David Peleg, SIAM.
  • Distributed Graph Coloring by Barenboim and Elkin, 2001