Courses for 2009-2010, fall semester
required
- Λ2. Computability (Arvanitakis)
- Λ3. Algorithms and complexity I (Koutsoupias)
elective (logic)
- Λ15. Proof theory (Koletsos, Stavrinos)
elective (computer science logic)
- Π17. Mathematics and cryptography (Raptis)
special topics in computer science
- Π00Γ. Combinatorial optimization (Zissimopoulos)
- Π01Α. Online algorithms (Koutsoupias)
- Π02Γ. Cryptography and complexity (Fotakis, Zachos)
- Π03Γ. Type systems for programming languages (Papaspyrou)
- Π98Π. Cryptography (Kiayias)
special topics in mathematics
- Λ05Δ. Graph Theory (Thilikos)
reading course
- ΜA09. Lattices and order theory (Koutras)