Courses for 2015-2016, fall semester
required
- Λ2. Computability ()
- Λ3. Algorithms and complexity I (Fotakis, Zachos)
- Λ4. Algorithms and complexity II (Pagourtzis, Zachos)
elective required
- Μ6. Set theory (Tsarpalias)
special topics in computer science
- Π00Γ. Combinatorial optimization (Zissimopoulos)
- Π02Γ. Cryptography and complexity (Pagourtzis, Zachos)
- Π02Ε. Computational algebra (Emiris, Konaxis)
- Π03Ξ. Approximation algorithms (Kolliopoulos)
- Π98Π. Cryptography (Kiayias)
half-course
- Π13. Advanced Geometric Algorithms (Emiris)