• Pre CS-600

  Introduction

  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 impossibility results for problems, such as consensus, Byzantine agreement, clock synchronization, mutual exclusion, and secure multiparty computation.

Teacher

David Pfeffer
ADJUNCT PROFESSOR

Email: dpfeffer@stevens.edu

Education

Bachelors of Science in Computer Science
Stevens Institute of Technology
Hoboken, NJ
Honors; Minor in Law and Public Policy
Masters of Science in Computer Science
Stevens Institute of Technology
Hoboken, NJ
4.0 GPA; Graduate Certificates in Computer Systems, Databases & Service Oriented Architecture, Distributed Systems, Enterprise Computing, Quantitative Software Engineering, Service Oriented Computing
Professional Societies
Member of the IEEE Computer Society and ACM.
Courses
CS 521 TCP/IP Networking
CS 570 Introduction to Programming, Data Structures, and Algorithms
CS 465 Selected Topics in Computer Science
SSW 810 Selected Topics in Systems Centric Software Engineering