Courses

Full courses archive

By Semester


Courses offered in Fall Semester 2009 – 2010

  • Λ2. Computability
    A. Arvanitakis
  • Λ3. Algorithms and Complexity I
    E. Koutsoupias
  • Π98Π. Cryptography
    A. Kiayias
  • Π00Γ. Combinatorial Optimization
    V. Zissimopoulos
  • Π01A. Online Algorithms
    E. Koutsoupias
  • Π17. Mathematics and Cryptography
    E. Raptis
  • Π03Γ. Type systems and Programming Languages
    N. Papaspyrou
  • Π05A. Cryptography and Complexity
    E. Zachos & D. Fotakis
  • Λ06A. Graph Theory
    D. Thilikos
  • Λ15. Proof Theory
    G. Koletsos & G. Stavrinos

Courses offered in Spring Semester 2008 – 2009

  • Λ1. Mathematical Logic
    C. Dimitracopoulos
  • Λ4. Algorithms and Complexity II
    S. Kolliopoulos
  • M6. Set theory
    Y. Moschovakis
  • Π6. Foundations of Data Bases (and Knowledge)
    M. Koumparakis
  • Λ14 Introduction to Lambda Calculus
    G. Koletsos & G. Stavrinos
  • Π02E. Computational Algebra
    E. Raptis
  • Π03A. Network Algorithms and Complexity
    A. Pagourtzis
  • Π05B. Computation Models and Complexity
    E. Zachos
  • Λ00Δ. Approximation Algorithms and Complexity
    E. Zachos
  • Π03Δ. Semantics of Programming Languages
    P. Rondogiannis
  • Λ08A. Techniques of modern cryptography
    A. Kiayias
  • Λ07N. Parameteric Complexity and Algorithms
    D. Thilikos
  • Λ08N. Functional interpretation of arithmetic
    G. Koletsos & N. Rigas

Courses offered in Fall Semester 2008 – 2009

  • Λ2. Computability
    D. Thilikos
  • Λ3. Algorithms and Complexity I
    E. Koutsoupias
  • Π02Δ. Computational Geometry
    G. Emiris
  • Π03Γ. Type systems and Programming Languages
    N. Papaspyrou
  • Π05A. Cryptography and Complexity
    E. Zachos & A. Pagourtzis
  • Π08A. Algorithmic Game Theory
    E. Koutsoupias
  • Λ06A. Graph Theory
    D. Thilikos

Courses offered in Spring Semester 2007 – 2008

  • Λ2. Computability
    Y. Moschovakis
  • Λ4. Algorithms and Complexity II
    S. Kolliopoulos
  • M6. Set theory
    Y. Moschovakis
  • Π6. Foundations of Data Bases and Knowledge Bases
    M. Koumparakis
  • M12. Model Theory
    C. Dimitracopoulos
  • Λ14 Introduction to Lambda Calculus
    G. Koletsos
  • Π17. Mathematics and Cryptography
    E. Raptis
  • Π03A. Network Algorithms and Complexity
    A. Pagourtzis
  • Π03Δ. Semantics of Programming Languages
    P. Rondogiannis
  • Π03Z. Algorithms in Structural Bioinformatics
    I. Emiris
  • Π04N. Logic in Artificial Intelligence
    P. Peppas
  • Π05B. Computation Models and Complexity
    E. Zachos
  • Π06A. Descriptive Set Theory
    A. Tsarpalias
  • Π07A. Structural Complexity
    E. Zachos & A. Pagourtzis
  • Λ07N. Parameteric Complexity and Algorithms
    D. Thilikos
  • Π07Ξ. Wireless Networking and Mobile Computing
    E. Kranakis
  • Λ07O. Linear Logic
    G. Stavrinos

Courses offered in Fall Semester 2007 – 2008

  • Λ1. Mathematical Logic
    C. Dimitracopoulos
  • Λ3. Algorithms and Complexity I
    E. Koutsoupias
  • Λ15. Proof Theory
    G. Koletsos & G. Stavrinos
  • Π00Γ. Combinatorial Optimization
    V. Zissimopoulos
  • Π01A. Online Algorithms
    E. Koutsoupias
  • Π02Δ. Computational Geometry
    G. Emiris & Ch. Fragoudakis
  • Π02E. Computational Algebra
    G. Emiris & E. Raptis
  • Π03Γ. Type systems and Programming Languages
    N. Papaspyrou
  • Π05A. Cryptography and Complexity
    E. Zachos & A. Pagourtzis
  • Λ06A. Graph Theory
    D. Thilikos

Courses offered in Spring Semester 2006 – 2007

  • Λ4. Algorithms and Complexity ÉÉ
    S. Kolliopoulos
  • M6. Set Theory
    C. Dimitracopoulos
  • Π6. Foundations of Databases (and Knowledge)
    M. Koubarakis
  • Π17. Mathematics and Cryptography
    E. Raptis
  • Π02Z. Topics in Game Theory and Computation
    E. Koutsoupias
  • Π03A. Network Algorithms and Complexity
    A. Pagourtzis
  • Π03Δ. Semantics of Programming Languages
    P. Rondogiannis
  • Π05B. Computation Models, Formal Languages, Automata Theory and Complexity
    E. Zachos
  • Λ99Δ. Descriptive Set Theory
    A. Tsarpalias
  • Π07B. Advanced Databases: Algorithms and complexity
    E. Zachos, A. Pagourtzis, G. Kollias
  • Λ07Γ. Logic, Automata and Games
    D. Richerby
  • Λ07N. Parametric Complexity and Algorithms (seminar)
    D. Thilikos
  • Π07Ξ. Wireless Networking and Mobile Computing (seminar)
    E. Kranakis

Courses offered in Fall Semester 2006 – 2007

Courses offered in Spring Semester 2005 – 2006

  • Λ4. Algorithms and Complexity ÉÉ
    S. Kolliopoulos
  • M6. Set Theory
    C. Dimitracopoulos
  • Π6. Foundations of Databases (and Knowledge)
    M. Koubarakis
  • Λ14. Introduction to ë-Calculus
    G. Koletsos & G. Stavrinos
  • Π17. Mathematics and Cryptography
    E. Raptis
  • Π01Π. Algorithms for Data Mining
    F. Afrati
  • Π02Ξ. Network Security and Cryptography
    E. Kranakis
  • Π01Â. Parallel Algorithms and Complexity
    E. Zachos
  • Π01Ï. Probabilistic Algorithms
    E. Koutsoupias
  • Π03Á. Network Algorithms and Complexity
    A. Pagourtzis
  • Π03Δ. Semantics of Programming Languages
    P. Rondogiannis
  • Π03Æ. Geometrical and Algebraic Algorithms in Molecular Biology
    I. Emiris
  • Π05Â. Computation Models, Formal Languages, Automata Theory and Complexity
    E. Zachos
  • Λ05Γ. Descriptive Complexity and Algorithms
    D. Thilikos
  • Λ05Δ. Graph Theory
    D. Richerby

Courses offered in Fall Semester 2005 – 2006

  • Λ1. Mathematical Logic
    C. Dimitracopoulos
  • Λ2. Computability
    Y. Moschovakis
  • Λ3. Algorithms and Complexity É
    E. Koutsoupias
  • Π6. Databases
    F. Afrati & V. Vassalos
  • Ì11. Recursion Theory
    Y. Moschovakis
  • Λ15. Proof Theory
    G. Koletsos & G. Stavrinos
  • Λ98Γ. Category Theory and Applications
    P. Karazeris & N. Rigas
  • Λ99A. Finite Model Theory
    D. Richerby
  • Π00Γ. Combinatorial Optimization
    V. Zissimopoulos
  • Π02Δ. Computational Geometry
    I. Emiris
  • Λ03Á. Computational Algebraic Geometry
    E. Raptis
  • Π03Γ. Type Systems for Programming Languages
    N. Papaspyrou
  • Π05Á. Cryptography and Complexity
    E. Zachos
  • Ì05Í. Constructive Arithmetic and Analysis
    J. R. Moschovakis

Courses offered in Spring Semester 2004 – 2005

  • Λ1. Mathematical Logic
    C. Dimitracopoulos
  • Λ4. Algorithms and Complexity ÉÉ
    A. Potika
  • Λ14. Introduction to ë-Calculus
    G. Koletsos & G. Stavrinos
  • Π17. Mathematics and Cryptography
    E. Raptis
  • Π99Π. Data Networks
    E. Kranakis
  • Π00Δ. Approximation Algorithms and Computational Geometry
    E. Zachos
  • Π02Z. Topics in Game Theory and Computation
    E. Koutsoupias
  • Π03A. Network Algorithms and Complexity
    A. Pagourtzis
  • Π03Δ. Semantics of Programming Languages
    P. Rondogiannis
  • Π03Æ. Geometric and Algebraic Algorithms in Molecular Biology
    I. Emiris
  • Π04Í. Logic in Artificial Intelligence
    P. Peppas

Courses offered in Fall Semester 2004 – 2005

  • Λ2. Computability
    Y. Moschovakis
  • Λ3. Algorithms and Complexity É
    E. Koutsoupias
  • M6. Set Theory
    Y. Moschovakis
  • Π6. Databases
    F. Afrati
  • Ì12. Model Theory
    C. Dimitracopoulos
  • Λ02Á. Arithmetic Complexity
    Y. Moschovakis
  • Λ03Á. Computational Algebraic Geometry
    E. Raptis
  • Π00Γ. Combinatorial Optimization
    V. Zissimopoulos
  • Λ04Á. Proofs and Programs
    G. Koletsos & G. Stavrinos
  • ΠÁ04. Type Systems for Programming Languages
    N. Papaspyrou

Courses offered in Spring Semester 2003 – 2004

  • Λ1. Mathematical Logic
    C. Dimitracopoulos
  • Λ4. Algorithms and Complexity ÉÉ
    A. Pagourtzis
  • Π6. Databases
    T. Sellis
  • Λ15. Proof Theory
    G. Stavrinos
  • Π17. Mathematics and Cryptography
    E. Raptis
  • Π01Á. Online Algorithms
    E. Koutsoupias
  • Π03Á. Structural Complexity
    E. Zachos
  • Π03Â. Semantics of Programming Languages
    P. Rondogiannis
  • Π03Γ. Type Systems for Programming Languages
    N. Papaspyrou
  • Π03Δ. Algorithms in Molecular Biology
    I. Emiris
  • Π01Π. Algorithms for Data Mining
    F. Afrati

Courses offered in Fall Semester 2003 – 2004

  • Λ2. Computability
    Y. Moschovakis
  • Λ3. Algorithms and Complexity É
    E. Koutsoupias
  • Λ5. Set Theory
    Y. Moschovakis
  • Λ14. Introduction to ë-Calculus
    G. Stavrinos
  • Λ00Γ. Combinatorial Complexity
    V. Zissimopoulos
  • Λ03Á. Computational Alegbraic Geometry
    E. Raptis
  • Π03Â. Network Algorithms and Complexity
    A. Pagourtzis
  • Λ03N. Models of Peano Arithmetic
    C. Dimitracopoulos
  • Π03Ξ. Approximation Algorithms
    F. Afrati & T. Aslanidis

Courses offered in Spring Semester 2002 – 2003

  • Λ4. Algorithms and Complexity ÉÉ
    Th. Andronikos
  • Λ5. Set Theory
    A. Tsarpalias & C. Dimitracopoulos
  • Λ99Å. Databases
    M. Nikolaidou
  • Λ13. Proof Theory
    G. Stavrinos
  • Λ00Â. Mathematics and Cryptography
    E. Raptis
  • Λ02Â. Metamathematics of Peano Arithmetic
    C. Dimitracopoulos & Ch. Cornaros
  • Λ02Γ. Cryptography and Complexity
    E. Zachos
  • Λ02Δ. Computational Geometry
    I. Emiris
  • Λ02Å. Computational Algebra
    I. Emiris
  • Λ02Æ. Topics in Game Theory and Computation
    E. Koutsoupias
  • Λ02Ξ. Introduction to network security and cryptography
    E. Kranakis
  • Λ02Ï. Algebraic specifications and their applications in Computer Science
    R. Diaconescu & P. Stefaneas
  • Λ01Ï. Probabilistic Algorithms
    S. Nikoletseas
  • Λ02Π. Topics of Logic in Computer Science
    E. Foustoucos

Courses offered in Fall Semester 2002 – 2003

  • Λ1. Mathematical Logic
    C. Dimitracopoulos
  • Λ2. Computability
    Y. Moschovakis
  • Λ3. Algorithms and Complexity É
    E. Koutsoupias
  • Λ16. Logic Programming
    E. Foustoucos
  • Λ00Á. Metamathematics of Set Theory
    A. Arvanitakis
  • Λ02Á. Arithmetic Complexity
    Y. Moschovakis
  • Λ02N. Logic in Databases
    V. Ôannen

Courses offered in Spring Semester 2001 – 2002

  • Λ4. Algorithms and Complexity ÉÉ
    Th. Andronikos
  • Λ5. Set Theory
    A. Arvanitakis
  • Λ11. Introduction to ë - Calculus
    G. Koletsos & G. Stavrinos
  • Λ15. Model Theory
    C. Dimitracopoulos & Ch. Cornaros
  • Λ99Å. Databases
    I. Karali & M. Nikolaidou
  • Λ99Π. Data Networks
    E. Kranakis
  • Λ00Â. Mathematics and Cryptography
    E. Raptis
  • Λ00Γ. Combinatorial Optimization
    V. Zissimopoulos
  • Λ01Γ. Parallel Algorithms and Complexity
    E. Zachos
  • Λ01Π. Algorithms for Data Mining
    F. Afrati

Courses offered in Fall Semester 2001 – 2002

  • Λ1. Mathematical Logic
    C. Dimitracopoulos
  • Λ2. Computability
    Y. Moschovakis
  • Λ3. Algorithms and Complexity É
    Th. Andronikos
  • Λ19. Non-classical Logics
    C. Koutras
  • Λ00Á. Metamathematics of Set Theory
    A. Arvanitakis
  • Λ01Í. Introduction to Recursion in Higher Types
    Y. Moschovakis
  • Λ01Ξ. Mathematics and Robotics
    E. Raptis
  • Λ01Â. Online Algorithms
    E. Koutsoupias
  • Λ01Ï. Probabilistic Algorithms
    E. Koutsoupias

Courses offered in Spring Semester 2000 – 2001

  • Λ4. Algorithms and Complexity ÉÉ
    T. Dimitriou
  • Λ5. Set Theory
    A. Tsarpalias
  • Λ99Å. Databases
    I. Ioannidis & I. Karali
  • Λ00Â. Mathematics and Cryptography
    E. Raptis
  • Λ00Γ. Combinatorial Optimization
    V. Zissimopoulos & E. Koutsoupias
  • Λ00Δ. Approximation Algorithms and Computational Geometry
    E. Zachos

Courses offered in Fall Semester 2000 – 2001

  • Λ1. Mathematical Logic
    C. Dimitracopoulos
  • Λ2. Computability
    Y. Moschovakis
  • Λ3. Algorithms and Complexity É
    T. Dimitriou
  • Λ16. Logic Programming
    E. Foustoucos
  • Λ98Â. Introduction to Constructive Mathematics
    J. R. Moschovakis
  • Λ00Á. Metamathematics of Set Theory
    Y. Moschovakis

Courses offered in Spring Semester 1999 – 2000

  • Λ4. Algorithms and Complexity ÉÉ
    T. Dimitriou
  • Λ5. Set Theory
    A. Tsarpalias
  • Λ11. Introduction to ë-Calculus
    G. Koletsos
  • Λ18. Mathematical Theory of Programming Languages
    S. Cosmadakis
  • Λ99Å. Databases
    I. Ioannidis
  • Λ99Í. Topics in Set Theory
    Y. Moschovakis
  • Λ99Π. Data Networks
    E. Kranakis

Courses offered in Fall Semester 1999 – 2000

  • Λ1. Mathematical Logic
    C. Dimitracopoulos
  • Λ2. Computability
    Y. Moschovakis
  • Λ3. Algorithms and Complexity É
    T. Dimitriou
  • Λ99A. Introduction to Finite Model Theory
    S. Weinstein
  • Λ99Â. Automata and Applications
    I. Soskov
  • Λ99Γ. Modal Logic
    C. Koutras
  • Λ99Δ. Descriptive Set Theory
    Y. Moschovakis

Courses offered in Spring Semester 1998 – 1999

  • Λ4. Algorithms and Complexity ÉÉ
    Ch. Nomikos
  • Λ5. Set Theory
    A. Tsarpalias
  • Λ13. Proof Theory
    G. Koletsos
  • Λ19. Non-classical Logics
    C. Koutras
  • Λ98Γ. Category Theory and Applications
    P. Karazeris
  • Λ98Π. Cryptography
    E. Kranakis
  • Λ98Ï. Java
    D. Theotokis

Courses offered in Fall Semester 1998 – 1999

  • Λ1. Mathematical Logic
    C. Dimitracopoulos
  • Λ2. Computability
    Y. Moschovakis
  • Λ3. Algorithms and Complexity É
    Ch. Nomikos
  • Λ18. Mathematical Theory of Programming Languages
    K. Georgatos
  • Λ98Á. Logic Programming ÉÉ
    E. Foustoucos
  • Λ98Â. Principles of Constructive Mathematics
    J. R. Moschovakis
  • Λ98Í. Metamathematics of Set Theory
    Y. Moschovakis

Courses offered in Spring Semester 1997 – 1998

  • Λ4. Algorithms and Complexity ÉÉ
    F. Afrati
  • Λ5. Set Theory
    A. Tsarpalias
  • Λ15. Model Theory
    C. Dimitracopoulos
  • Λ16. Logic Programming
    E. Foustoucos
  • Λ97Á. Probabilistic Algorithms
    P. Spirakis

Courses offered in Fall Semester 1997 – 1998

  • Λ1. Mathematical Logic
    C. Dimitracopoulos
  • Λ2. Computability
    Y. Moschovakis & M. Mytilinaios
  • Λ3. Algorithms and Complexity É
    E. Zachos
  • Λ11. Recursion Theory
    Y. Moschovakis
  • Λ14. Introduction to ë-Calculus
    G. Koletsos

Courses offered in Spring Semester 1996 – 1997

  • Λ1. Mathematical Logic
    C. Dimitracopoulos
  • Λ2. Computability
    Y. Moschovakis
  • Λ3. Algorithms and Complexity É
    E. Kirousis
  • Λ5. Set Theory
    A. Tsarpalias

Last update: Tue, 08 May 2012 23:10:22 EEST

Powered by...

Powered by OpenBSD Powered by lighttpd Powered by PostgreSQL Powered by python
Valid XHTML 1.1! Valid CSS! Created with Vim! Graphics created with the Gimp!