Courses for 2003-2004
required
- Λ1. Mathematical logic (Dimitracopoulos)
- Λ4. Algorithms and complexity II (Pagourtzis)
elective required
- Π6. Databases (Sellis)
elective (logic)
- Λ15. Proof theory (Stavrinos)
elective (computer science logic)
- Π17. Mathematics and cryptography (Raptis)
special topics in computer science
- Π01Α. Online algorithms (Koutsoupias)
- Π01Π. Algorithms for data mining (Afrati)
- Π03Α. Structural complexity (Zachos)
- Π03Β. Semantics of programming languages (Rondogiannis)
- Π03Γ. Type systems for programming languages (Papaspyrou)
- Π03Δ. Algorithms in molecular biology (Emiris)
required
- Λ2. Computability (Moschovakis)
- Λ3. Algorithms and complexity I (Koutsoupias)
elective required
- Μ6. Set theory (Moschovakis)
elective (logic)
- Λ14. Introduction to λ-calculus (Stavrinos)
Special Topics in Logic
- Λ00Γ. Combinatorial complexity (Zissimopoulos)
- Λ03Α. Computational algebraic geometry (Raptis)
- Λ03Ν. Models of peano arithmetic (Dimitracopoulos)
special topics in computer science
- Π03Ε. Network algorithms and complexity (Pagourtzis)
- Π03Ξ. Approximation algorithms (Afrati, Aslanidis)