HEINZ NIXDORF INSTITUT
UNIDepartment of Mathematics and Computer ScienceUniversity of Paderborn

Theoretical Computer Science


Home
Research
Teaching
Institutions
Members
Links
Publications
Service

back to HNI:
Home
  Working Groups

Webmaster

Education



The different aspects of our research are reflected in our educational work. See for example this year's list of lectures held by our group.

We offer basic courses on Algorithms, on Complexity and Formal Languages, as well as specialized ones on topics that are very much influenced by our current research interests.

Thereby we enable students to specialize in such a way that they can write their diploma thesis in fields of high interest.

Dedicated one-year projects form the third component of our teaching. They offer the opportunity to deepen their knowledge and to practically apply it for actual implementations. This leads in many cases directly to working on a diploma thesis in the same area.

Finally, both students and postgraduates participate in our regular group seminars by giving talks on the most recent developments in their research.

For more information, please refer to

 

 

 

Veranstaltungen im Wintersemester 2003/2004

HEINZ NIXDORF INSTITUT
Universität Paderborn
Algorithmen und Komplexität
 

 

Wir bieten auch Diplom- und Studienarbeiten zu vielen interessanten Themen an!


Einführung in Berechenbarkeit und Formale Sprachen

Vorlesung (V2)
Di 11.15 - 12.45      C1             F. Meyer auf der Heide

Zentralübung (ZÜ1)
Fr 11.15 - 12.00      C1             F. Meyer auf der Heide
Übung (Ü1)
Di 16.15 - 17.45 g 1  D1.328         Kuntze
Di 16.15 - 17.45 u 2  D1.328         Kuntze
Di 14.15 - 15.45 g 3  E2.316         Fischer
Di 14.15 - 15.45 u 4  E2.316         Fischer
Do 14.15 - 15.45 g 5  E2.310         Sondag
Do 14.15 - 15.45 u 6  E2.310         Sondag
Do 16.15 - 17.45 g 7  C3.212         Sondag
Do 16.15 - 17.45 u 8  C3.212         Sondag
Fr  7.15 -  8.45 g 9  N3.206         Volbert
Fr  7.15 -  8.45 u 10 N3.206         Volbert
Fr  9.15 - 10.45 g 11 N3.206         Volbert
Fr  9.15 - 10.45 u 12 N3.206         Volbert


Communication in Networks II (in English)

Vorlesung (V2)
Fr  9.15 - 10.45      D2             F. Meyer auf der Heide

Übung (Ü1)
Fr 11.15 - 12.45      D1.303         M. Vodisek


Average effiziente Algorithmen und Average-Komplexitätstheorie

Vorlesung (V2)
Fr  9.15 - 10.45      F1.110         C. Schindelhauer

Übung (Ü1)
Fr  8.15 -  9.00      F1.110         C. Schindelhauer


Online Algorithmen

Vorlesung (V2)
Fr  9.15 - 10.45      F2.211         C. Sohler

Übung (Ü1)
Fr 11.00 - 11.45      F2.211         C. Sohler


Advanced Computability Theory (in English)

Vorlesung (V2)
Di 16.15 - 17.45      D1.303         M. Ziegler

Übung (Ü1)
Di 18.00 - 18.45      D1.303         M. Ziegler


Projektgruppe Mobile Ad Hoc Networks Based on Wireless LAN (Teil I, in English)

Vorlesung (V2)
Di  9.15 - 10.45      F0.530         S. Böttcher, F.-J. Rammig, C. Schindelhauer
Übung (Ü2)
Mi 18.00 - 19.30      F0.530         A. Türling, S. Oberthuer, G. Schomaker
Seminar (S2)
Fr 16.00 - 17.30      F1.110


Projektgruppe P2P-Netzwerke für dynamische 3D-Szenen

Vorlesung (V2)
Di 11.15 - 12.45      F2.211         F. Meyer auf der Heide
Übung (Ü2)
Do  9.15 - 10.45      F2.211         
Seminar (S2)
Mi 11.15 - 12.45      F0.530


Blockseminar Perlen der Theoretischen Informatik

Seminar (S2)
Vorbesprechung: Mittwoch 22.10.2003 um 16:15 im F1.310


Seminar Advanced Topics of Computational Complexity (in English)

Seminar (S2)
Termin wird noch bekannt gegeben; Vorbesprechung:
Do  16.10  11:15h     F2.211         C. Schindelhauer


Seminar Sublinear Algorithms

Seminar (S2)
Mi  9.15 - 10.45      FU.116         C. Sohler


Oberseminar Theoretische Informatik 2

Oberseminar (OS2)
Mi 14.00 - 16.00      F1.110         F. Meyer auf der Heide / J. Blömer


Martin Ziegler, Oktober 2003