<?xml version="1.0" encoding="ISO-8859-1" standalone="yes" ?>
<document>
<title>Theoretical Informatics Seminar</title>
<cid>KIM-STI</cid>
<sapsubmodule>P221-0058</sapsubmodule>
<bkey>kim2</bkey>
<ctypes>
<hours>4</hours>
<type>V</type>
</ctypes>
<cp>6</cp>
<semester>2</semester>
<mandatory>no</mandatory>
<language>German</language>
<exam>Practice talk, talk
</exam>
<curriculum>
<curriculum_entry>
<cid>DFI-STI</cid>
<branch>Computer Science</branch>
<semester>2</semester>
<mandatory_tag>mandatory course</mandatory_tag>
</curriculum_entry>
<curriculum_entry>
<cid>KI848</cid>
<branch>Computer Science and Communication Systems</branch>
<semester>2</semester>
<mandatory_tag>optional course</mandatory_tag>
</curriculum_entry>
<curriculum_entry>
<cid>KIM-STI</cid>
<branch>Computer Science and Communication Systems</branch>
<semester>2</semester>
<mandatory_tag>optional course</mandatory_tag>
</curriculum_entry>
<curriculum_entry>
<cid>PIM-STI</cid>
<branch>Applied Informatics</branch>
<semester>2</semester>
<mandatory_tag>mandatory course</mandatory_tag>
</curriculum_entry>
<curriculum_entry>
<cid>PIM-STI</cid>
<branch>Applied Informatics</branch>
<semester>2</semester>
<mandatory_tag>mandatory course</mandatory_tag>
</curriculum_entry>
<curriculum_entry>
<cid>TIM-STI</cid>
<branch>Technical Computer Science</branch>
<semester>2</semester>
<mandatory_tag>optional course</mandatory_tag>
</curriculum_entry>
</curriculum>
<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.</workload>
<prerequisites>
</prerequisites>
<knowledge>[?]</knowledge>
<prerequisitesfor>
</prerequisitesfor>
<convenor>Prof. Dr. Maximilian Altmeyer</convenor>
<convenor-person-key>mat</convenor-person-key>
<lecturers>
<lecturer>Prof. Dr. Maximilian Altmeyer</lecturer>
<lecturer-person-key>mat</lecturer-person-key>
</lecturers>
<objectives>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.
</objectives>
<content>Advanced topics pertaining to the computability theory, complexity theory and algorithms, e. g. probabilistic algorithms, alternating automata, zero-knowledge proofs, approximation algorithms.</content>
<media>Practice talk, talk by student, discussion, summary by listeners</media>
<literature>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
</literature>
<offered>
<semshort>SS 2025</semshort>
<semshort>SS 2024</semshort>
<semshort>SS 2023</semshort>
<semshort>SS 2022</semshort>
<semshort>SS 2021</semshort>
<semshort>SS 2020</semshort>
<semshort>SS 2019</semshort>
<semshort>SS 2018</semshort>
</offered>
<moduldb-query>Thu Mar 12 15:28:52 CET 2026, CKEY=psti, BKEY=kim2, CID=[?], LANGUAGE=en, DATE=12.03.2026</moduldb-query>
</document>
