-
>
>
>
> Notes
Date
Description
2020-01-14
Prereqs/Overview
2020-01-16
Loop Invariants; Sorting Examples
More Loop Invariants (sum and insertion sort)
2020-01-21
Interval Scheduling
2020-01-23
Gale-Shapley
2020-01-28
Gale-Shapley correctness
2020-01-30
Gale-Shapley machinist optimality
2020-02-04
Minimizing Maximum Lateness; Duke Has Taken the Bridge
2020-02-06
Dijkstra's Algorithm
2020-02-11
Heaps
2020-02-13
Dijkstra's Invariant; Minimum Spanning Tree
2020-02-18
Light Edge Theorem
2020-02-20
Union/Find Data Structure
2020-02-25
Divide-and-Conquer: Mergesort, Counting Inversions, Analysis of Recursion Trees
2020-02-27
Master Theorem, Integer Multiplication, Dynamic Programming
2020-03-05
Seam Carving, Bellman-Ford
2020-03-24
0-1 Knapsack
2020-03-26
Vendor Scheduling, All Pairs Shortest Paths
2020-03-31
Maxmimum Flow
Bipartite Matching
2020-04-02
Applications of Maximum Flow
2020-04-07
Lower Bounds
Reductions
NP
NP-complete
Hamiltonian Path
Vertex Cover
2020-04-09
NP and NP-complete
2020-04-14
Cook-Levin
Self-Reducibility
co-NP
2020-04-16
3-Coloring, HP variations
2020-04-21
PSPACE
Geography
Approximation Algorithms
Randomized Algorithms
PSPACE, BPP, ZPP