CECS 528 Lectures

1. Randomized Algorithms (Annotated Friday)
2. Randomized Algorithms (Annotated)
3. Randomized Algorithms
4. Approximation Algorithms (Annotated Friday)
5. Approximation Algorithms (Annotated Inapproximability of TSP and Christofides' Algorithm for Triangle-TSP)
6. Approximation Algorithms (Annotated)
7. Approximation Algorithms
8. NP Completeness (Annotated)
9. NP Completeness (Annotated Friday)
10. NP Completeness
11. Introduction to Complexity Theory (Annotated)
12. Introduction to Complexity Theory
13. Mapping Reducibility (Annotated Friday)
14. Mapping Reducibility (Annotated)
15. Mapping Reducibility
16. Logic Problems (Annotated)
17. Logic Problems (Annotated Friday)
18. Logic Problems
19. Dynamic Programming Algorithms (Annotated Friday)
20. Dynamic Programming Algorithms (Annotated)
21. Dynamic Programming Algorithms
22. Greedy Graph Algorithms (Annotated)
23. Greedy Graph Algorithms
24. Introduction to Greedy Algorithms (Annotated)
25. Introduction to Greedy Algorithms
26. Fast Fourier Transform (Annotated)
27. Fast Fourier Transform (Annotated Friday)
28. Divide and Conquer Algorithms (Annotated Friday )
29. Fast Fourier Transform
30. Divide and Conquer Algorithms (Annotated)
31. Divide and Conquer Algorithms
32. Recurrences (Annotated)
33. Recurrences
34. Review of Big-O Notation (Annotated)
35. Review of Big-O Notation (Annotated Friday)
36. Review of Big-O Notation