Andrei Bulatov: Teaching

In 2021/2022 I teach

MACM101 - Discrete Mathematics, an undergraduate course
CMPT789 - Applied Cryptography, a graduate course
CMPT981 - Special Topics in Theoretical Computer Science: Constraint Satisfaction Problem, a graduate course

In the past I also taught

CMPT-789 - Applied Cryptography (Fall 2020, 2021)
CMPT-706 - Algorithms for Big Data (Spring 2018, 2019)
CMPT-705 - Design and Analysis of Algorithms, a graduate course (Fall 2009, 2011, 2013, 2014, 2015, 2016)
CMPT-404 - Cryptography and protocols, an undergraduate course (Spring 2012, 2013, 2014, 2015, 2017, 2018, 2019, 2021)
CMPT-405 - Design and Analysis of Computing Algorithms, an undergraduate course (Fall 2009, Summer 2016, Spring 2017)
CMPT-307 - Data Structures and Algorithms, an undergraduate course (Fall 2009)
CMPT-881 - Special topics in theoretical computer science: Theory of the CSP (Spring 2008)
MACM-101 - Discrete Mathematics (Spring 2007, 2008, 2009, 2010, 2021 Fall 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2021)
CMPT-308 - Computability and Complexity, an upper level undegraduate course (Fall 2004, Fall 2005)
CMPT-710/407 - Computational Complexity, a crosslisted (under)graduate course (Spring 2005, Summer 2006, Spring 2007)
CMPT-881 - Special topics in theoretical computer science: Quantum Computing, a graduate course (Summer 2006, Spring 2009)
CMPT-409 - Cryptography, an undergraduate course (Summer 2007, Fall 2008)