CS 860: Topics in Algorithms and Complexity
Latest term
(Fall '16):
The state of P vs. NP
(Jonathan Buss)
Previous terms
:
Online algorithms with applications to paging, buffering, and text compression (Spring 2014—Alex López Ortiz)
Online algorithms: Competitive analysis and beyond (Winter '11—Alex López Ortiz)
Search Engines: From Design to Implementation (Fall'09—Alex López Ortiz)
Randomness and Complexity (Fall '08—Buss)
Patterns in Strings (Fall '08—Shallit)
Adaptive Analysis (Spring '07—López Ortiz and Barbay)
Five Open Problems (Spring '06—López Ortiz)