| Titel der Lehrveranstaltungen |
Semester |
Wochenstunden |
im Auftrag von |
|---|
| System. Programming |
SoSe 1983 |
2+1 |
FB 10, Univ. des Saarl. |
| System. Programming |
SoSe 1984 |
2+1 |
FB 10, Univ. des Saarl. |
| Scheduling |
WS 1984/85 |
4+2 |
FB 10, Univ. des Saarl. |
| The complexity classes NC and RNC |
WS 1985/86 |
2+1 |
FB 10, Univ. des Saarl. |
| Cryptography |
SoSe 1986 |
2+1 |
FB 10, Univ. des Saarl. |
| Handling of NP-hard Problems on selected Examples |
WS 1986/87 |
2+1 |
FB 10, Univ. des Saarl., |
| Efficient Algorithms |
WS 1987/88 |
4+2 |
FB 20, TH Darmstadt |
| Computational Geometry (Seminar) |
WS 1987/88 |
2 |
FB 20, TH Darmstadt |
| The Complexity of Learning |
SoSe 1988 |
2+1 |
FB 10, Univ. des Saarl. |
| Cryptography |
WS 1988/89 |
2+1 |
FB 10, Univ. des Saarl. |
| Basics of theor. Computer Science |
SoSe 1989 |
4+2 |
FB 4, Univ. Dortmund |
| Computational Learning |
WS 1989/90 |
4+2 |
FB 10, Univ. des Saarl. |
| Programming |
WS 1990/91 |
4+2 |
FB 4, Univ. Dortmund |
| Computational Learning (Seminar) |
WS 1990/91 |
2 |
FB 4, Univ. Dortmund |
| Pattern Matching |
SoSe 1991 |
4 |
FB 4, Univ. Dortmund |
| Combinatorics (Seminar) |
SoSe 1991 |
2 |
FB 4, Univ. Dortmund |
| Complexity Theory |
WS 1991/92 |
4+2 |
FB 4, Univ. Dortmund |
| Recognition of Hand-Written Letters I |
WS 1991/92 |
4+2 |
FB 4, Univ. Dortmund |
| Recognition of Hand-Written Letters II |
SoSe 1992 |
4+2 |
FB 4, Univ. Dortmund |
| Efficient Algorithms |
SoSe 1992 |
4+2 |
FB 4, Univ. Dortmund |
| Pattern Matching (Seminar) |
WS 1992/93 |
2 |
IGI, Univ. Graz |
| Basics of Theoretical Computer Science |
SoSe 1993 |
4+2 |
FB 4, Univ. Dortmund |
| Approx. of NP-hard Optimization Problems (Seminar) |
SoSe 1993 |
2 |
FB 4, Univ. Dortmund |
| Complexity Theory |
WS 1993/94 |
4+2 |
FB 4, Univ. Dortmund |
| Theory of Neural Networks (Seminar) |
WS 1993/94 |
2 |
FB 4, Univ. Dortmund |
| Learning from Counterexamples |
SoSe 1994 |
4+2 |
FB 4, Univ. Dortmund |
| Function Learning (Seminar) |
SoSe 1994 |
2 |
FB 4, Univ. Dortmund |
| Operations Research |
WS 1994/95 |
4+2 |
FB 4, Univ. Dortmund |
| Comb. Problems in Molecular Biology (Seminar) |
WS 1994/95 |
2 |
FB 4, Univ. Dortmund |
| Theory of Logic Design |
SoSe 1995 |
4+2 |
FB 4, Univ. Dortmund |
| Approx. of Comb. Optimization Problems (Seminar) |
SoSe 1995 |
2 |
FB 4, Univ. Dortmund |
| Complexity Theory |
WS 1995/96 |
4+2 |
FB 4, Univ. Dortmund |
| Computational Learning Theory (Seminar) |
WS 1995/96 |
2 |
FB 4, Univ. Dortmund |
| Basics of Theor. Computer Science |
SoSe 1996 |
4+2 |
FB 4, Univ. Dortmund |
| Computational Lerning Theory and Comb. Optimization |
SoSe 1996 |
8 |
FB 4, Univ. Dortmund |
| Complexity Theory |
WS 1996/97 |
4+2 |
FB 4, Univ. Dortmund |
| Computational Learning Theory and Comb. Optimization |
WS 1996/97 |
8 |
FB 4, Univ. Dortmund |
| Introduction to Computer Science |
WS 1997/98 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| PCP-Theorem and Applications (Seminar) |
WS 1997/98 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Data Structures |
SoSe 1998 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Introduction to Computer Science |
WS 1998/99 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Public Key Crypto Systems (Seminar) |
WS 1998/99 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Efficient Algorithms |
SoSe 1999 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Algorithmic Biology (Seminar) |
SoSe 1999 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
WS 1999/00 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Efficient Approximation Alg. for NP-hard Optimization Problems (Seminar) |
WS 1999/00 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Data Structures |
SoSe 2000 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Perfect Hashing (Seminar) |
SoSe 2000 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Introduction to Computer Science |
WS 2000/01 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
WS 2000/01 |
4 |
Fak. 15, Ruhr-Uni-Bochum |
| Efficient Algorithms |
SoSe 2001 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Introduction to Cryptography (Seminar) |
SoSe 2001 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
SoSe 2002 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Cryptography and its compl. th. Basics (Seminar) |
SoSe 2002 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Discrete Mathematics |
WS 2002/03 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Introduction to Computer Science |
WS 2002/03 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Efficient Algorithms |
SoSe 2003 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Support Vector Machines (Seminar) |
SoSe 2003 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theoretical Computer Science |
WS 2003/04 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Discrete Mathematics |
WS 2003/04 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Efficient Algorithms |
SoSe 2004 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| The P-NP Problem (Seminar) |
SoSe 2004 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theoretical Computer Science |
WS 2004/05 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Discrete Mathematics |
WS 2004/05 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Efficient Algorithms |
SoSe 2005 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Convex Optimization (Seminar) |
SoSe 2005 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theoretical Computer Science |
WS 2005/06 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Algorithmic Learning |
WS 2005/06 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theoretical Computer Science |
WS 2006/07 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Discrete Mathematics |
WS 2006/07 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Efficient Algorithms |
SoSe 2007 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Algorithmic Learning |
SoSe 2007 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theoretical Computer Science |
WS 2007/08 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
SoSe 2008 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theoretical Computer Science |
WS 2008/09 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
SS 2009 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Discrete Mathematics |
WS 2009/10 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theoretical Computer Science |
WS 2009/10 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
SoSe 2010 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Communication Complexity (Seminar) |
SoSe 2010 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Discrete Mathematics |
WS 2010/11 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theoretical Computer Science |
WS 2010/11 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Discrete Mathematics |
WS 2011/12 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theoretical Computer Science |
WS 2011/12 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Data Structures |
SoSe 2012 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Computational Learning (Seminar) |
SoSe 2012 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theoretical Computer Science |
WS 2012/13 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
WS 2012/13 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theory of Machine Learning |
SoSe 2013 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Algorithmic Learning (Seminar) |
SoSe 2013 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Differential Privacy |
SoSe 2013 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Discrete Mathematics |
WS 2013/14 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
WS 2013/14 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theory of Machine Learning |
SoSe 2014 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Minimization of Submodular Functions (Proseminar) |
SoSe 2014 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Discrete Mathematics |
WS 2014/15 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Algorithmic Learning (Seminar) |
WS 2014/15 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Data Structures |
SoSe 2015 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
SoSe 2015 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theory of Machine Learning |
SoSe 2016 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Discrete Mathematics (Seminar) |
SoSe 2016 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
WS 2016/17 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Algorithmic Learning (Seminar) |
WS 2016/17 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theory of Machine Learning |
SoSe 2017 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Set Theory (Seminar) |
SoSe 2017 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
WS 2017/18 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theoretical Computer Science |
WS 2017/18 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theory of Machine Learning |
SoSe 2018 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Data Sructures |
SoSe 2018 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
WS 2018/19 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theoretical Computer Science |
WS 2018/19 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Data Structures |
SoSe 2019 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Graphs and Matrices (Seminar) |
SoSe 2019 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity Theory |
WS 2019/20 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Algebraic Graph Theory |
WS 2019/20 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Theory of Machine Learning |
SoSe 2020 |
4+2 |
Fak. 15, Ruhr-Uni-Bochum |
| Complexity of Boolean Functions (Seminar) |
SoSe 2020 |
2 |
Fak. 15, Ruhr-Uni-Bochum |
Lehrstuhl Mathematik & Informatik