Courses for 2002-2003, spring semester
required
- Λ4. Algorithms and complexity II (Andronikos)
elective required
- Μ6. Set theory (Dimitracopoulos, Tsarpalias)
elective (logic)
- Λ15. Proof theory (Stavrinos)
elective (computer science logic)
- Π17. Mathematics and cryptography (Raptis)
Special Topics in Logic
- Λ02Β. Metamathematics of Peano arithmetic (Cornaros, Dimitracopoulos)
- Λ02Ο. Algebraic specifications and their applications in computer science (Diaconescu)
- Λ02Π. Topics of logic in computer science (Foustoucos)
- Λ97Α. Probabilistic algorithms (Nikoletseas)
- Λ99Ε. Topics in databases (Nikolaidou)
special topics in computer science
- Π02Γ. Cryptography and complexity (Zachos)
- Π02Δ. Computational geometry (Emiris)
- Π02Ε. Computational algebra (Emiris)
- Π02Ζ. Topics in game theory and computation (Koutsoupias)
- Π02Ξ. Network security and cryptography (Kranakis)