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