Courses for 2012-2013
required
- Λ1. Mathematical logic (Kirousis)
elective required
- Μ6. Set theory (Tsarpalias)
elective (logic)
- Λ14. Introduction to λ-calculus (Koletsos, Stavrinos)
- Λ13Ο. Approximation algorithms and mechanisms design (Fotakis, Zachos)
Special Topics in Logic
special topics in computer science
- Λ07Ν. Parameterized complexity and algorithms ()
- Π02Δ. Computational geometry (Emiris)
- Π03Β. Semantics of programming languages (Rondogiannis)
- Π03Δ. Algorithms in molecular biology (Chrysina, Emiris)
- Π03Ε. Network algorithms and complexity (Pagourtzis)
- Π05Β. Computation models and complexity (Zachos)
half-course
- Λ13Ν. Matroid theory (Pitsoulis)
reading course
- ΜΝ13. First-order Modal Logic (Koutras)
- ΜΞ12. Model Theory (Dimitracopoulos)
required
- Λ2. Computability (Arvanitakis)
- Λ3. Algorithms and complexity I (Fotakis, Zachos)
- Λ4. Algorithms and complexity II (Pagourtzis, Zachos)
elective (logic)
- Λ15. Proof theory (Koletsos, Stavrinos)
Special Topics in Logic
- Λ99Γ. Modal logic (Koutras)
special topics in computer science
- Π00Γ. Combinatorial optimization (Zissimopoulos)
- Π02Γ. Cryptography and complexity (Pagourtzis, Zachos)
- Π02Ε. Computational algebra (Raptis)
- Π03Γ. Type systems for programming languages (Papaspyrou)
- Π10Α. Knowledge technologies (Koubarakis)
- Π98Π. Cryptography (Kiayias)
special topics in mathematics
half-course
- Λ12Β. Advanced topics in graph theory (Thilikos)