Courses for 2006-2007, fall semester
required
- Λ1. Mathematical logic (Dimitracopoulos)
- Λ2. Computability (Moschovakis)
- Λ3. Algorithms and complexity I (Koutsoupias)
Special Topics in Logic
- Λ02Α. Arithmetic complexity (Moschovakis)
- Λ98Γ. Category theory and applications (Koletsos, Stavrinos)
- Λ99Α. Finite model theory (Richerby)
special topics in computer science
- Π00Γ. Combinatorial optimization (Zissimopoulos)
- Π02Γ. Cryptography and complexity (Pagourtzis, Zachos)
- Π02Δ. Computational geometry (Emiris)
- Π02Ε. Computational algebra (Emiris, Raptis)
- Π03Γ. Type systems for programming languages (Papaspyrou)
special topics in mathematics
- Λ05Δ. Graph Theory (Thilikos)
- Μ05Β. Ergodic Ramsey Theory (Farmaki)