Theoretical aspects of distributed algorithms, with an emphasis on formal proofs of correctness and theoretical performance analysis. Algorithms for consensus, clock synchronization, mutual exclusion, debugging of parallel programs, peer-to-peer networks, and distributed function computation; fault-tolerant distributed algorithms; distributed algorithms for wireless networks. Course Information: Same as CS 539. 4 graduate hours. No professional credit. Prerequisite: One of CS 473, ECE 428, ECE 438.