Courses for 2005-2006
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)
required
- Λ1. Mathematical logic (Dimitracopoulos)
- Λ2. Computability (Moschovakis)
- Λ3. Algorithms and complexity I (Koutsoupias)
elective required
- Π6. Databases (Afrati, Vassalos)
elective (mathematical logic)
- M11. Recursion theory (Moschovakis)
elective (logic)
- Λ15. Proof theory (Koletsos, Stavrinos)
Special Topics in Logic
- Λ03Α. Computational algebraic geometry (Raptis)
- Λ98Γ. Category theory and applications (Karazeris, Rigas)
- Λ99Α. Finite model theory (Richerby)
special topics in computer science
- Π00Γ. Combinatorial optimization (Zissimopoulos)
- Π02Γ. Cryptography and complexity (Zachos)
- Π02Δ. Computational geometry (Emiris)
- Π03Γ. Type systems for programming languages (Papaspyrou)
special topics in mathematics
- Μ05Ν. Constructive arithmetic and analysis (Moschovakis)