Courses for 2016-2017

required

• Λ1. Mathematical logic (Kirousis)

Special Topics in Logic

• Λ09Γ. Advanced Topics in Logic (Zachos)
• Π09Γ. Advanced topics in algorithms and complexity (Pagourtzis, Zachos)

special topics in computer science

• Π02Δ. Computational geometry (Konaxis)
• Π03Β. Semantics of programming languages (Rondogiannis)
• Π03Ε. Network algorithms and complexity (Pagourtzis)
• Π03Ζ. Algorithms in structural bioinformatics (Chrysina)
• Π05Β. Computation models and complexity (Zachos)

required

• Λ2. Computability ()
• Λ3. Algorithms and complexity I (Fotakis, Zachos)
• Λ4. Algorithms and complexity II (Pagourtzis, Zachos)

elective required

• Μ6. Set theory (Tsarpalias)

elective (computer science logic)

• Π14Α. Theory of linear programming (Kolliopoulos)

special topics in computer science

• Λ06Δ. Graph drawing (Symvonis)
• Π00Γ. Combinatorial optimization (Zissimopoulos)
• Π02Γ. Cryptography and complexity (Pagourtzis, Zachos)
• Π02Ε. Computational algebra (Emiris, Konaxis)
• Π03Γ. Type systems for programming languages (Papaspyrou)
• Π98Π. Cryptography (Leonardos)

special topics in mathematics

• Λ05Δ. Graph Theory (Kolliopoulos)
• Μ07Μ. Stochastic Processes (Loulakis)
• Μ08Μ. Stochastic models (Economou)