Courses for 2005-2006, spring semester
required
- Λ4. Algorithms and complexity II (Kolliopoulos)
elective required
- Μ6. Set theory (Dimitracopoulos)
- Π6. Foundations of Databases and Knowledge (Koubarakis)
elective (logic)
- Λ14. Introduction to λ-calculus (Koletsos, Stavrinos)
elective (computer science logic)
- Π17. Mathematics and cryptography (Raptis)
Special Topics in Logic
- Λ05Γ. Descriptive complexity and algorithms (Thilikos)
- Λ97Α. Probabilistic algorithms (Koutsoupias)
special topics in computer science
- Π01Γ. Parallel algorithms and complexity (Zachos)
- Π01Π. Algorithms for data mining (Afrati)
- Π02Ξ. Network security and cryptography (Kranakis)
- Π03Β. Semantics of programming languages (Rondogiannis)
- Π03Δ. Geometric and Algebraic Algorithms in Molecular Biology (Emiris)
- Π03Ε. Network algorithms and complexity (Pagourtzis)
- Π05Β. Computation Models, Formal Languages, Automata Theory and Complexity (Zachos)
special topics in mathematics
- Λ05Δ. Graph Theory (Richerby)