Academic Year 2023-2024

Name Type Group Semester
Algorithms Required Fall
Approximation Algorithms Elective Required A Fall
Combinatorial Optimization Elective Required A Fall
Computational Complexity Elective Required A Fall
Cryptography Elective Fall
Game Theory Elective Fall
Graph Theory Elective Required C Fall
Randomized Algorithms Elective Fall
Recursion Theory Elective Required B Fall
Set Theory Elective Required B Fall
Special Topics in Discrete Mathematics: Statistics for Stochastic Processes Elective Fall
Special Topics in Logic: Type Theory Elective Fall
Stochastic Processes Elective Required C Fall
Structural Complexity Elective Fall
Algorithmic Game Theory Elective Spring
Computation Models, Formal Languages and Automata Elective Spring
Computational Geometry Elective Spring
Information Theory Elective Spring
Logic Elective Required B Spring
Network Algorithms and Complexity Elective Spring
Operational Research Elective Spring
Parameterized Complexity and Algorithms Elective Spring
Queueing Theory Elective Spring
Semantics of Programming Languages Elective Spring
Special Topics in Discrete Mathematics: Advanced Topics in Cryptography Elective Spring
Special Topics in Logic: Descriptive Set Theory Elective Spring
Special Topics in Logic: Descriptive Complexity Elective Spring
Special Topics on Algorithms: Convex Optimization with Applications in Machine Learning Elective Spring
Special Topics on Algorithms: Sublinear Algorithms Elective Spring
Special Topics on Algorithms: Algorithmic Data Science Elective Spring