htw saar
Back to Main Page

Choose Module Version:

flag

Theoretical Informatics Seminar

Module name (EN): Theoretical Informatics Seminar
Degree programme: Applied Informatics, Master, ASPO 01.10.2011
Module code: PIM-STI
Hours per semester week / Teaching method: 4V (4 hours per week)
ECTS credits: 6
Semester: 2
Mandatory course: yes
Language of instruction:
German
Assessment:
Practice talk, talk
Curricular relevance:
KI848 Computer Science and Communication Systems, Master, ASPO 01.04.2016, semester 2, optional course, informatics specific
KIM-STI Computer Science and Communication Systems, Master, ASPO 01.10.2017, semester 2, optional course, informatics specific
PIM-STI Applied Informatics, Master, ASPO 01.10.2011, semester 2, mandatory course
PIM-STI Applied Informatics, Master, ASPO 01.10.2017, semester 2, mandatory course
Workload:
60 class hours (= 45 clock hours) over a 15-week period.
The total student study time is 180 hours (equivalent to 6 ECTS credits).
There are therefore 135 hours available for class preparation and follow-up work and exam preparation.
Recommended prerequisites (modules):
PIM-BK Computability and Complexity Theory


[updated 18.08.2016]
Recommended as prerequisite for:
Module coordinator:
Prof. Dr. Thomas Kretschmer
Lecturer:
Prof. Dr. Thomas Kretschmer


[updated 08.07.2007]
Learning outcomes:
After successfully completing this module, students will be able to independently analyze, prepare and present the content of a challenging scientific topic pertaining to theoretical computer science in an understandable way within a given period of time. In addition, they will be able to participate actively in a technical discussion and concisely summarize the lectures they have heard.


[updated 24.02.2018]
Module content:
Advanced topics pertaining to the computability theory, complexity theory and algorithms, e. g. probabilistic algorithms, alternating automata, zero-knowledge proofs, approximation algorithms.

[updated 24.02.2018]
Teaching methods/Media:
Practice talk, talk by student, discussion, summary by listeners

[updated 24.02.2018]
Recommended or required reading:
Berstel, Boasson, Carton, Fagnot: Minimization of automata,  http://arxiv.org/abs/1010.5318
Berstel, Perrin, Reutenauer: Codes and Automata, Cambridge University Press 2010.
Cormen, Leiserson, Rivest: Introduction to Algorithms, The MIT Press 1997.
Hopcroft, Ullman: Ullman: Einführung in die Automatentheorie, Formale Sprachen und Komplexitätstheorie, Addison-Wesley, 1994.
Moore, Christopher; Mertens, Stefan: The Nature of Computation, Oxford University Press 2011.
Motwani, Rajeev; Raghavan, Prabhakar: Randomized Algorithms, Cambridge University Press 2007.
Sipser: Introduction to the Theory of Computation, Second Edition, Thomson 2006.
Vazirani, Vijay: Approximation Algorithms, Springer 2003.
and other articles


[updated 24.02.2018]
Module offered in:
SS 2017, SS 2016, SS 2015, SS 2014, SS 2013, ...
[Sun Jul  5 15:23:02 CEST 2020, CKEY=psti, BKEY=pim, CID=PIM-STI, LANGUAGE=en, DATE=05.07.2020]