CMPS 6610/4610 Algorithms
Fall 18
Resources
Demos:
Miscellaneous:
- Algorithms notes by Jeff Erickson
- Algorithms lecture slides by Kevin Wayne
- Randomized Algorithms notes by Sariel Har-Peled (Ch. 3 randomized min-cut, Ch. 7.2 high-probability bound for quicksort)
- The Stony Brook Algorithms Repository
- MIT Algorithms Courses
1 (by Leiserson and Demaine),
2 (by Demaine, Devadas, Lynch), 3 (graduate) (by Goemans)
These contain video lectures, assignments, practice problems, etc.
- Khan Academy Algorithms tutorial, with content by Cormen and Balkcom
- Union-Find O(n log* n) runtime:
CMU lecture notes, wikipedia
- Fibonacci numbers
- History of MST algorithms
- Transitive closure and matrix multiplication
- Optimization lecture notes, including max flow and linear programming
- Complexity classes:
- Gerhard Woeginger's P vs. NP page
- TSP: "Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey" by Bukard et al.
Last modified by Carola Wenk,
cwenk -at- tulane -dot- edu,