Valentine Kabanets: Teaching

Current courses (Fall 2020)

• CMPT 308 - Computability and Complexity, an upper-level undergraduate course.

Past courses

• CMPT 307 - Data Structures and Algorithms, an upper-level undergraduate course (Fall'08, Spring'12-14, Fall'16, Summer'17, Fall'17, Spring'18, Spring'19, Summer'19).
• CMPT 308 - Computability and Complexity, an upper-level undergraduate course (Spring'04-07, Spring'09, Fall'12-14, Summer'19).
• CMPT 405/705 - Design and Analysis of Algorithms , an advanced undergraduate/intro-level graduate course (Spring'13-14, Summer'17, Fall'17, Spring'19).
• CMPT 710/407 - Complexity Theory, an upper-level undergraduate/intro-graduate course (Fall'03, Fall'05-07, Fall'10, Spring'15, Summer'17, Fall'19).
• CMPT 881 - Average-Case Complexity, an advanced graduate course (Spring'11).
• CMPT 881 - Error-correcting codes, Pseudorandomness, and Complexity Theory, an advanced graduate course (Spring'07).
• CMPT 881 - Pseudorandomness, an advanced graduate course (Fall'04).

---

Back to home page