Week 1 (July 28th to August 1st)
Lower Bound for 2-coloring paths
Cole Vishkin Algorithm for 3-coloring directed paths (section 1.4)
Week 2 (August 4th to August 8th)
Cole Vishkin on rooted trees (section 6.3.1) and general graphs (section 6.3.2)
Introduction to randomized distributed algorithms
Week 3 (August 11th to August 15th)
(Δ+1)-coloring in O(log n) rounds (section 6.2) continued. Did a more detailed round complexity analysis after lemma 6.12
Week 4 (August 18th to August 22nd)
Week 5 (August 25th to August 29th)
Week 6 (September 1st to September 5th)
Week 7 (September 8th to September 12th)
Analysis of randomized controlled GHS (similar to analysis of coloring algorithm, notes not available for this)
Week 8 (September 15th to September 19th)
Week 9 (September 22nd to September 26th)
Week 10 (September 29th to October 3rd)
Week 11 (October 6th to October 10th)
Singular Optimality in KT-0 CONGEST
Elkin's Singularly Optimal MST Algorithm
Week 12 (October 13th to October 17th)
Elkin's Algorithm Continued
Message efficient algorithms in KT-1 CONGEST