Dr. Paul Benjamin Weeks 1-3, NYC
Dr. Chuck Tappert Weeks 4-6, Goldstein Academic Center, Room 315, Pleasantville
Dr. Richard Nemes Weeks 7-9, NYC
Dr. Christelle Scharff Weeks 10-12, NYC
Textbooks and Additional Information:
Introduction to Algorithms, Cormen, Leiserson, Rivest, and Stein, Third Edition, MIT Press.
Additional technical material will be provided (journal articles, conference papers, book sections).
Course Description: Advanced topics in data structures and computational complexity, including randomized algorithms, dynamic programming, recurrence relations, amortized analysis, network flow algorithms, approximation algorithms and NP-completeness, will be discussed. This course covers both fundamental techniques and applications.
Learning Outcomes and Major Topics: After taking this course, the students should be able to:
University Policies: Please read Seidenberg School disability statement and academic integrity policy.