Lectures

Note that the lecture topics are subject to change.

Introduction

Introduction

Lecture 1 Wednesday, September 3
Course Introduction
Classic Algorithms

Classic Algorithms

Lecture 2 Monday, September 8
Dynamic Programming
Slides (not annotated yet)
Lecture 3 Wednesday, September 10
Divide and Conquer and FFT
Lecture 4 Monday, September 15
Network Flows and Applications
Lecture 5 Wednesday, September 17
Hardness within P
Randomization

Randomization

Lecture 6 Monday, September 22
Probability Review
Lecture 7 Wednesday, September 24
TBD
Slides
Lecture 8 Monday, September 29
TBD
Slides
Lecture 9 Wednesday, October 1
TBD
Slides

Exam Monday, October 6
Midterm Examination
Optimization

Optimization

Lecture 10 Monday, October 20
TBD
Slides
Lecture 11 Wednesday, October 22
TBD
Slides
Lecture 12 Monday, October 27
TBD
Slides
Lecture 13 Wednesday, October 29
TBD
Slides
New Computational Models

New Computational Models

Lecture 14 Monday, November 3
TBD
Slides
Lecture 15 Wednesday, November 5
TBD
Slides
Lecture 16 Monday, November 10
TBD
Slides
Information and Codes

Information and Codes

Lecture 17 Wednesday, November 12
TBD
Slides
Lecture 18 Monday, November 17
TBD
Slides
Lecture 19 Wednesday, November 19
TBD
Slides
Lecture 20 Monday, December 1
TBD
Slides

Lecture 21 Wednesday, December 3
TBD
Slides

Exam Tuesday, December 16
Final Examination