Program Overview

Institute for Theoretical Computer Science

The Institute for Theoretical Computer Science offers a variety of courses and research opportunities in the field of theoretical computer science.

##Courses

• Algorithms and Data Structures
• Introduction to Bioinformatics
• Foundations of Theoretical Computer Science and Formal Foundations of Computer Science
• Algorithms for Sequence Analysis
• Algorithmic Game Theory
• Cryptology
• SAT Solving
• Randomized Methods in Computer Science

Archives

The institute maintains an archive of past courses, including:

• Events in SS 2025 (Courses in Summer Semester 2025)
• Events in SS 2024 (Courses in Summer Semester 2024)
• Events in WS 2024/2025 (Courses in Winter Semester 2024/2025)
• Events in WS 2023/24 (Courses in Winter Semester 2023/2024)
• Events in SS 2023 (Courses in Summer Semester 2023)
• Events in WS 2022/2023 (Courses in Winter Semester 2022/2023)
• Events in SS 2022 (Courses in Summer Semester 2022)
• Events in SS 2021 (Courses in Summer Semester 2021)
• WS 2020/2021 (winter semester 2020/2021)
• SS 2020 (Summer Semester 2020)
• WS 2019/2020 (winter semester 2019/2020)
• SS 2019 (Summer Semester 2019)
• WS 2018/2019 (winter semester 2018/2019)
• SS 2018 (Summer Semester 2018)
• WS 2017/2018 (winter semester 2017/2018)
• SS 2017 (Summer Semester 2017)
• WS 2016/2017 (winter semester 2016/2017)
• SS 2016 (Summer Semester 2016)
• WS 2015/2016 (winter semester 2015/2016)
• SS 2015 (Summer Semester 2015)
• WS 2014/2015 (winter semester 2014/2015)
• SS 2014 (Summer Semester 2014)
• WS 2013/2014 (winter semester 2013/2014)
• SS 2013 (Summer Semester 2013)
• WS 2012/2013 (winter semester 2012/2013)
• SS 2012 (Summer Semester 2012)
• WS 2011/2012 (winter semester 2011/2012)
• SS 2011 (Summer Semester 2011)
• WS 2010/2011 (winter semester 2010/2011)
• SoSe 2010 (Summer Semester 2010)
• WS 2009/2010 (winter semester 2009/2010)
• SoSe 2009 (Summer Semester 2009)
• WS 2008/2009 (winter semester 2008/2009)
• SoSe 2008 (Summer Semester 2008)
• WS 2007/2008 (winter semester 2007/2008)

##Staff The institute is composed of the following staff members:

• Prof. Dr. Jacobo TorŠn
• Prof. Dr. Enno Ohlebusch
• Prof. Dr. Uwe SchŲning
• Christiane Halder-Schnell
• M.Sc. Lisa Marie Jaser
• M.Sc. Jannik Olbrich
• Former employees and doctoral students, including Dr. Thomas BŁchler, Dr. Florian WŲrz, and Dr. Julian Nickerl

##Research The institute conducts research in the following areas:

• EDACC
• Sequence analysis
• SAT Solving
• Dense Packing of Yarn Rolls on Pallets

Miscellaneous

Additional information about the institute, including its address, imprint, and data protection policy, can be found on its website.

Complexity Theory

Information (Information)

• Table of Contents: Topics
• script (script)
• Further Links: Complexity Zoo

Literature

• S. Arora and B. Barak, Computational Complexity: A Modern Approach. Cambridge U. Press 2009
• L. Hemaspaandra and M. Ogihara, The Complexity Theory Companion. Springer 2002.
• J. KŲbler, U. SchŲning and J. TorŠn, The Graph Isomorphism Problem. Birkhauser 1993.
• B. Moret, The Theory of Computation. Addison Wesley 1998.
• C. Papadimitriou, Computational Complexity. Addison Wesley 1994.
• U. SchŲning, Pearls of Theoretical Computer Science. Scientific publishing house, 1995.
• M. Sipser, Introduction to the Theory of Computation. PWS Publishing Company, 1997.
• G. Wechsung, lectures on complexity theory. Teubner 2000.
• I. Wegener, complexity theory. Springer 2003.

Lecturer

Prof. Dr. Jacobo TorŠn

Lecture Times

Tuesday 12:00 - 2:00 p.m. in O27/123
Wednesday 10:00 a.m. - 12:00 p.m. in O27/121

Exercise Leader

Prof. Dr. Jacobo TorŠn

Further Information

LSF Entry