Check course web page homework section for more information, especially regarding paper reviews and cover sheet.

Problems: The numbered exercises are from the textbook. Do your best to give rigorous proofs of all the results.

• Exercise 2.7.
• Exercise 2.8.
• Exercise 2.15.
• Exercise 3.3.
• Exercise 3.5.
• Exercise 3.9.
• Exercise 3.10, parts (1) and (2).

Paper Reviews:

1. "A distributed spanning tree algorithm for topology-aware networks," Arjan Mooij, Nicolae Goga and Wieger Wesselink. Proceedings of the 2nd conference on Design, Analysis, and Simulation of Distributed Systems (DASD 2004), pages 169--178, 2004.
2. "Simplifying Itai-Rodeh Leader Election for Anonymous Rings," Wan Fokkink, Jun Pang. Electronic Notes in Theoretical Computer Science, vol. 128, no. 6, pp. 53-68, 2005.