| Algorithmic Game Theory |
Elective |
|
Spring |
| Algorithms |
Required |
|
Fall |
| Approximation Algorithms |
Elective Required |
A |
Fall |
| Computation Models, Formal Languages and Automata |
Elective |
|
Spring |
| Computational Complexity |
Elective Required |
A |
Fall |
| Computational Cryptography |
Elective |
|
Fall |
| Computational Geometry |
Elective |
|
Spring |
| Computational Αlgebra |
Elective |
|
Fall |
| Cryptography |
Elective |
|
Spring |
| Geometric Data Analysis |
Elective |
|
Fall |
| Graph Theory |
Elective Required |
C |
Fall |
| Logic |
Elective Required |
B |
Fall |
| Network Algorithms and Complexity |
Elective |
|
Spring |
| Operational Research |
Elective |
|
Fall |
| Parameterized Complexity and Algorithms |
Elective |
|
Spring |
| Probabilistic Methods |
Elective |
|
Spring |
| Recursion Theory |
Elective Required |
B |
Fall |
| Semantics of Programming Languages |
Elective |
|
Spring |
| Set Theory |
Elective Required |
B |
Spring |
| Special Topics in Logic: Descriptive Complexity |
Elective |
|
Spring |
| Special Topics on Algorithms |
Elective |
|
Spring |
| Special Topics on Algorithms: Nonlinear Programming |
Elective |
|
Fall |
| Special Topics on Algorithms: Sublinear Algorithms |
Elective |
|
Fall |
| Stochastic Processes |
Elective Required |
C |
Spring |
| Stochastic Processes |
Elective Required |
C |
Fall |
| Type Systems for Programming Languages |
Elective |
|
Fall |
