Courses for 2001-2002, spring semester
required
- Λ4. Algorithms and complexity II (Andronikos)
elective required
- Μ6. Set theory (Arvanitakis)
elective (mathematical logic)
- M12. Model theory (Cornaros, Dimitracopoulos)
elective (logic)
- Λ14. Introduction to λ-calculus (Koletsos, Stavrinos)
elective (computer science logic)
- Π17. Mathematics and cryptography (Raptis)
Special Topics in Logic
- Λ99Ε. Topics in databases (Karali, Nikolaidou)
special topics in computer science
- Π00Γ. Combinatorial optimization (Zissimopoulos)
- Π01Γ. Parallel algorithms and complexity (Zachos)
- Π01Π. Algorithms for data mining (Afrati)
- Π99Π. Data networks (Kranakis)