Courses for 2015-2016

required

• Λ1. Mathematical logic (Koutras)

elective (computer science logic)

• Π17. Mathematics and cryptography (Raptis)

Special Topics in Logic

• Λ07Γ. Logic, automata and games (Achilleos, Zachos)

special topics in computer science

• Λ07Ν. Parameterized complexity and algorithms (Giannopoulou)
• Π02Δ. Computational geometry (Chamodrakas, Emiris)
• Π03Β. Semantics of programming languages (Rondogiannis)
• Π03Ε. Network algorithms and complexity (Varvarigos)
• Π03Ζ. Algorithms in structural bioinformatics (Chrysina, Emiris)
• Π05Β. Computation models and complexity (Zachos)
• Π08Α. Algorithmic game theory (Fotakis)

special topics in mathematics

• Μ06Μ. Algebraic Combinatorics (Athanasiadis)
• Μ07Μ. Stochastic Processes (Cheliotis)

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)