Course curriculum
required
These basic courses are required for the M.Sc. and are offered each year.
- Λ1. Mathematical logic
- Λ2. Computability
- Λ3. Algorithms and complexity I
- Λ4. Algorithms and complexity II
- Λ5. Research methodology
elective required
elective (computer science logic)
The Program offers a selection of these computer-science-related courses every semester.
- Π17. Mathematics and cryptography
- Π18. Logic programming
- Π19. Mathematical theory of programming languages
- Π14Α. Theory of linear programming
elective (logic)
The Program offers a selection of these logic-related courses every semester.
- Λ14. Introduction to λ-calculus
- Λ15. Proof theory
- Λ16. Non-classical logics
- Λ13Α. Applied Proof Theory
- Λ13Β. Formal Methods and Software
- Λ13Ο. Approximation algorithms and mechanisms design
elective (mathematical logic)
The Program offers a selection of these mathematical logic-related courses every semester.
- M10. Metamathematics of set theory
- M11. Recursion theory
- M12. Model theory
- M13. Introduction to constructive mathematics
Special Topics in Logic
- Λ00Γ. Combinatorial complexity
- Λ00Δ. Approximation algorithms and complexity
- Λ01Ν. Introduction to recursion in higher types
- Λ01Ξ. Mathematics and robotics
- Λ02Α. Arithmetic complexity
- Λ02Β. Metamathematics of Peano arithmetic
- Λ02Ν. Logic in databases
- Λ02Ο. Algebraic specifications and their applications in computer science
- Λ02Π. Topics of logic in computer science
- Λ03Α. Computational algebraic geometry
- Λ03Ν. Models of peano arithmetic
- Λ04Α. Proofs and programs
- Λ05Γ. Descriptive complexity and algorithms
- Λ07Γ. Logic, automata and games
- Λ07Ο. Linear logic
- Λ08Α. Techniques of modern cryptography
- Λ08Ν. Functional interpretation of arithmetic
- Λ09Γ. Advanced Topics in Logic
- Λ13Ξ. Intuitionistic logic and constructive mathematics
- Λ97Α. Probabilistic algorithms
- Λ98Α. Logic programming II
- Λ98Β. Java
- Λ98Γ. Category theory and applications
- Λ98Ν. Metamathematics of set theory
- Λ98Ο. Constructive mathematics
- Λ99Α. Finite model theory
- Λ99Β. Automata and applications
- Λ99Γ. Modal logic
- Λ99Ε. Topics in databases
- Λ99Ν. Topics in set theory
- Π09Γ. Advanced topics in algorithms and complexity
special topics in computer science
- Λ06Δ. Graph drawing
- Λ07Ν. Parameterized complexity and algorithms
- Π00Γ. Combinatorial optimization
- Π00Δ. Approximation algorithms and computational geometry
- Π01Α. Online algorithms
- Π01Γ. Parallel algorithms and complexity
- Π01Π. Algorithms for data mining
- Π02Γ. Cryptography and complexity
- Π02Δ. Computational geometry
- Π02Ε. Computational algebra
- Π02Ζ. Topics in game theory and computation
- Π02Ξ. Network security and cryptography
- Π03Α. Structural complexity
- Π03Β. Semantics of programming languages
- Π03Γ. Type systems for programming languages
- Π03Δ. Algorithms in molecular biology
- Π03Ε. Network algorithms and complexity
- Π03Ζ. Algorithms in structural bioinformatics
- Π03Ν. Logic in artificial intelligence
- Π03Ξ. Approximation algorithms
- Π05Β. Computation models and complexity
- Π07Β. Advanced databases: algorithms and complexity
- Π07Ξ. Wireless networking and mobile computing
- Π08Α. Algorithmic game theory
- Π10Α. Knowledge technologies
- Π10Β. Computational game theory
- Π11Β. Network algorithms: distributed, probabilistic, approximation
- Π12. Algorithmic Issues of Social Networks
- Π98Π. Cryptography
- Π99Π. Data networks
special topics in mathematics
- Λ05Δ. Graph Theory
- Μ05Β. Ergodic Ramsey theory
- Μ05Ν. Constructive arithmetic and analysis
- Μ06Μ. Algebraic Combinatorics
- Μ07Μ. Stochastic Processes
- Μ08Μ. Stochastic models
- Μ99Δ. Descriptive set theory
half-course
The Program occasionally offers half courses in specific subjects. These are taught (usually) by visiting faculty members and are offered specifically to enable students to take advantage of short visits by distinguished scientists.
- Λ10Ν. Recurscion and complexity
- Λ12Β. Advanced topics in graph theory
- Λ13Γ. Advanced topics in graph algorithms
- Λ13Ν. Matroid theory
- Λ14Ν. Algebraic specifications
- Π11Α. Advanced approximation algorithms
- Π13. Advanced Geometric Algorithms
reading half-course
With the approval of his or her Advisor and on the basis of a written study proposal, a student may enroll in a reading half-course under the supervision of a regular or visiting MPLA faculty member.
reading course
With the approval of his or her Advisor and on the basis of a written study proposal, a student may enroll in a reading (full) course under the supervision of a regular or visiting MPLA faculty member.
- MB09. Model theory
- MP11. Προστασία και ασφάλεια υπολογιστικών συστημάτων
- ΜA09. Lattices and order theory
- ΜΒ10. Proofs of spatial complexity
- ΜΒ11. Collection vs inference
- ΜΓ09. Universal algebra
- ΜΝ08. Nonmonotonic logics
- ΜΝ11β. Nonmonotonic Logic
- ΜΝ13. First-order Modal Logic
- ΜΞ11. Non-approximability of NP-hard problems
- ΜΞ12. Model Theory
- ΜΟ10. Finding parameters in cryptosystems based on lattices
- ΜΠ10. Subsystems of Peano arithmetic
- ΜΠ11. Modal logic
- ΜΡ10. Discrete mathematics and cryptography
- ΠΑ11. Tamper-resilient circuits
- ΠΒ09. Classes theory and model theory in informatics
external course
- 220. Information systems security
- 445. Graph representation
- ΘΜ28. Representation theory
- ΘΜ31. Algebric Combinatorial Theory
- Χ11Α. Security
MSc thesis
This pseudo-course represents a student's MSc thesis.
PhD thesis
This pseudo-course represents a student's PhD thesis.