There will be short pre-recorded videos for some of the lecture material. For best results these are best watched before the lecture, so check here before the lectures. Slides will also be posted here.
DAG
SAT
asymptotics
backtracking
cs3383 lecture
divide and conquer
dynamic multithreaded
dynamic programming
fork-join
greedy
horn-clause
huffman
longest common subsequence
memoization
mst
opencourseware
shortest path
topological sort
Unit 0: Asymptotics
Mon 08 Jan 2024 12:00:00 AM
Unit 1: Divide and Conquer
Wed 10 Jan 2024 12:00:00 AM
Unit 2: Greedy Algorithms
Mon 05 Feb 2024 12:00:00 AM
Unit 3: Dynamic Programming
Mon 26 Feb 2024 12:00:00 AM
Unit 4: Multithreaded algorithms
Mon 18 Mar 2024 12:00:00 AM
Unit 5: Combinatorial Search
Wed 27 Mar 2024 12:00:00 AM