Courses for 2011-2012
required
- Λ1. Mathematical logic (Kirousis)
elective required
- Μ6. Set theory (Tsarpalias)
elective (logic)
- Λ14. Introduction to λ-calculus (Koletsos)
elective (computer science logic)
- Π17. Mathematics and cryptography (Raptis)
special topics in computer science
- Π02Δ. Computational geometry (Emiris)
- Π03Α. Structural complexity (Pagourtzis, Zachos)
- Π03Β. Semantics of programming languages (Rondogiannis)
- Π03Ζ. Algorithms in structural bioinformatics (Chrysina, Emiris)
- Π05Β. Computation models and complexity (Zachos)
- Π11Β. Network algorithms: distributed, probabilistic, approximation (Fotakis, Pagourtzis)
reading course
- ΜΝ11β. Nonmonotonic Logic (Koutras)
- ΜΠ11. Modal logic (Koutras)
- ΠΑ11. Tamper-resilient circuits (Kiayias)
required
- Λ2. Computability (Arvanitakis)
- Λ3. Algorithms and complexity I (Koutsoupias)
- Λ4. Algorithms and complexity II (Zachos)