Automata, Computation, and Complexity (Spring 2025), jointly with Parinya Chalersmook.
Programming and Data Structures (theory and laboratory) for first year UG students.
Switching Circuits and Logic Design (theory and laboratory) for second year UG students.
Algorithm Design and Analysis for first year masters students.
Computational Complexity (PG elective)
Randomised Algorithm Design (PG elective)
Approximation and Online Algorithms (PG elective)
Parallel Algorithms (PG elective)
Statistical Learning Theory (PG elective)
Parameterized Algorithms (PG elective)