Courses for 2008-2009
required
- Λ1. Mathematical logic (Dimitracopoulos)
- Λ4. Algorithms and complexity II (Kolliopoulos)
elective required
- Μ6. Set theory (Moschovakis)
- Π6. Foundations of Databases and Knowledge (Koubarakis)
elective (logic)
- Λ14. Introduction to λ-calculus (Koletsos, Stavrinos)
Special Topics in Logic
- Λ00Δ. Approximation algorithms and complexity (Zachos)
- Λ08Α. Techniques of modern cryptography (Kiayias)
- Λ08Ν. Functional interpretation of arithmetic (Koletsos, Rigas)
special topics in computer science
- Λ07Ν. Parameterized complexity and algorithms (Thilikos)
- Π02Ε. Computational algebra (Raptis)
- Π03Β. Semantics of programming languages (Rondogiannis)
- Π03Ε. Network algorithms and complexity (Pagourtzis)
- Π05Β. Computation models and complexity (Zachos)
required
- Λ2. Computability (Thilikos)
- Λ3. Algorithms and complexity I (Koutsoupias)
special topics in computer science
- Π02Γ. Cryptography and complexity (Pagourtzis, Zachos)
- Π02Δ. Computational geometry (Emiris)
- Π03Γ. Type systems for programming languages (Papaspyrou)
- Π08Α. Algorithmic game theory (Koutsoupias)
special topics in mathematics
- Λ05Δ. Graph Theory (Thilikos)