Master recursion trees, merge sort, and the master theorem for solving recurrences efficiently.
✓ CompletedMemoization, tabulation, and optimal substructure. Knapsack, LCS, and edit distance problems.
✓ CompletedInterval scheduling, Huffman coding, Dijkstra's and Prim's algorithms with exchange arguments.
✓ CompletedBFS, DFS, shortest paths, minimum spanning trees, and strongly connected components.
✓ CompletedFord-Fulkerson, Edmonds-Karp, max-flow min-cut theorem and bipartite matching reductions.
→ In ProgressP vs NP, polynomial reductions, Cook-Levin theorem, and approximation algorithms.
— UpcomingAssociate Professor · Department of Computer Science
Dr. Marsh received her PhD from MIT in 2012, specializing in approximation algorithms and combinatorial optimization. Her current research focuses on algorithmic game theory and mechanism design. She has published over 40 papers in top venues including STOC, FOCS, and SODA, and received the NSF CAREER award in 2017.