Courses for 2007-2008
required
- Λ2. Computability (Moschovakis)
- Λ4. Algorithms and complexity II (Kolliopoulos)
elective required
- Μ6. Set theory (Moschovakis)
- Π6. Foundations of Databases and Knowledge (Koubarakis)
elective (mathematical logic)
- M12. Model theory (Dimitracopoulos)
elective (logic)
- Λ14. Introduction to λ-calculus (Koletsos)
elective (computer science logic)
- Π17. Mathematics and cryptography (Raptis)
Special Topics in Logic
- Λ07Ο. Linear logic (Stavrinos)
special topics in computer science
- Λ07Ν. Parameterized complexity and algorithms (Thilikos)
- Π03Α. Structural complexity (Pagourtzis, Zachos)
- Π03Β. Semantics of programming languages (Rondogiannis)
- Π03Ε. Network algorithms and complexity (Pagourtzis)
- Π03Ζ. Algorithms in structural bioinformatics (Emiris)
- Π03Ν. Logic in artificial intelligence (Peppas)
- Π05Β. Computation models and complexity (Zachos)
- Π07Ξ. Wireless networking and mobile computing (Kranakis)
special topics in mathematics
- Μ99Δ. Descriptive set theory (Tsarpalias)
required
- Λ1. Mathematical logic (Dimitracopoulos)
- Λ3. Algorithms and complexity I (Koutsoupias)
elective (logic)
- Λ15. Proof theory (Koletsos, Stavrinos)
special topics in computer science
- Π00Γ. Combinatorial optimization (Zissimopoulos)
- Π01Α. Online algorithms (Koutsoupias)
- Π02Γ. Cryptography and complexity (Pagourtzis, Zachos)
- Π02Δ. Computational geometry (Emiris, Fragoudakis)
- Π02Ε. Computational algebra (Emiris, Raptis)
- Π03Γ. Type systems for programming languages (Papaspyrou)
special topics in mathematics
- Λ05Δ. Graph Theory (Thilikos)