Chris Umans Teaching

Teaching

Currently teaching: Complexity Theory (CS151). The course homepage is here.

Winter 2013: Decidability and Tractability (CS21). The course homepage is here.

Fall 2012: Introduction to Computer Science Research (CS9) (organizer). The course homepage is here.

Spring 2012: Current Topics in Theoretical Computer Science (CS153). The course homepage is here.

Winter 2012: Decidability and Tractability (CS21).

Fall 2011: Introduction to Computer Science Research (CS9) (organizer).

Spring 2011: Complexity Theory (CS151).

Winter 2011: Decidability and Tractability (CS21).

Fall 2010: Introduction to Computer Science Research (CS9) (organizer).

Spring 2010: Current Topics in Theoretical Computer Science (CS153). The course homepage is here.

Winter 2010: Decidability and Tractability (CS21).

Fall 2009: Introduction to Computer Science Research (CS9) (organizer).

Spring 2009: Complexity Theory (CS151).

Winter 2009: Decidability and Tractability (CS21).

Fall 2008: Mathematical methods in theoretical computer science (CS286a). The course homepage is here.

Winter 2008: Decidability and Tractability (CS21).

Spring 2007: Complexity Theory (CS151).

Winter 2007: Decidability and Tractability (CS21).

Spring 2006: Pseudorandomness and combinatorial constructions (CS286c). The course homepage is here.

Winter 2006: Decidability and Tractability (CS21).

Spring 2005: Complexity Theory (CS151).

Winter 2005: Decidability and Tractability (CS21).

Spring 2004: Complexity Theory (CS151).

Winter 2004: Decidability and Tractability (CS21).

Spring 2003: Complexity Theory (CS151).

Co-taught Coding Theory (CSE522/Math581EB). University of Washington. Fall 2001. The course homepage is here.
Graduate Student Instructor for Efficient Algorithms and Intractable Problems (CS170). U.C. Berkeley. Spring 2000. Notes (54 pages) from my sections can be found here.
Graduate Student Instructor for Combinatorial Algorithms and Data Structures (CS270). U.C. Berkeley. Spring 1999.