CS 765C Foundations of Distributed Computing

CS 765C Foundations of Distributed Computing

Prof. Rebecca Wright
Burchard 124
Tuesdays 6:15-8:45pm
Fall 2002

Course description

Design and analysis of distributed algorithms, and impossibility results showing when some problems are unsolvable. Models of synchronous and asynchronous distributed computing. Fault models including crash failures and malicious failures, and communication models including message passing and shared memory systems. Distributed algorithms and impossiblity results for problems such as consensus, Byzantine agreement, clock synchronization, mutual exclusion, and secure multiparty computation.


Nancy Lynch, Distributed Algorithms, 1st Edition, Morgan Kaufmann Publishers, 1996.


The syllabus for this course is available here.

Office Hours

Office hours are Thursdays 2-4pm, by appointment only.

Last updated 1/13/03 by
rwright (at) cs.stevens-tech.edu
Copyright © 2003 Rebecca N. Wright