Distributed Algorithms
An MIT OpenCourseWare graduate course on algorithms built for systems with multiple processors and no central controller. Drawing on Nancy Lynch's textbook Distributed Algorithms, the course covers foundational models and impossibility results for consensus, synchronization, and fault tolerance, then extends into self-stabilization, wait-free computability, failure detectors, and scalable shared-memory concurrent programming. Materials include lecture notes, problem sets, and readings tied to Lynch's book, aimed at students who already have a background in algorithms and want to understand why coordinating independent processors is fundamentally harder than sequential computation. As with other MIT OCW offerings, all course materials are free to use and there is no certificate.