■
Team
■
Teaching
Oberseminar der Theorie
■
Winter 2023
■
Summer 2023
■
Winter 2022
■
Summer 2022
■
Winter 2021
■
Summer 2021
■
Winter 2020
■
Summer 2020
■
Winter 2019
■
Summer 2019
■
Winter 2018
■
Summer 2018
■
Winter 2017
■
Summer 2017
■
Winter 2016
■
Summer 2016
■
Winter 2015
■
Summer 2015
■
Winter 2014
Algorithmen und Berechenbarkeit / Formale Methoden
Algorithmische Gruppentheorie
Berechenbarkeit und Komplexität
Ergänzungen zu Mathematik I
Logik und Diskrete Strukturen
■
Summer 2014
■
Winter 2013
■
Summer 2013
■
Winter 2012
■
Summer 2012
■
Winter 2011
Former Semester
BSc, Master-, Student-, Diplomathesis
StuPro/ ProjektINF/ SoPra/ FaPra
Exam Archive
Standard Textbooks
Descriptive Theory
■
Research
■
Publications
 

Algorithmen und Berechenbarkeit / Formale Methoden

Dozent: Prof. Volker Diekert (Raum 1.125, Tel. 0711 / 685 88329)

Übungen: Armin Weiß (Raum 1.116, Tel. 0711 / 685 88405)

Zeit Raum Termine
Mo 11:30-13:00 V38.04 wöchentlich ab 13.10.14 außer am 03.11., 12.01.
Do 14:00-15:30 V38.04 wöchentlich ab 16.10.14 außer am 08.01., 15.01.

Am 8.1., 12.1. und 15.1. findet keine Vorlesung statt.

Termin der Scheinklausur (Multiple-Choice): 12.2. um 14:00 in V38.04

Die Ergebnisse und eine Musterlösung der Scheinklausur sowie die Liste der vergebenen Scheine hängen jetzt neben Raum 1.101 aus. Bitte vergewissern Sie sich dort möglichst zeitnah, ob Sie die Scheinbedingungen erfüllt haben.

Die Ergebnisse Modulprüfung hängen jetzt neben Raum 1.101 aus.

Ergänzungen

Daniel Bahrdt

Webseite der Ergänzungen

Übungen

Die Anmeldung zu den Übungen erfolgt über die Webseite https://uebungsgruppen.informatik.uni-stuttgart.de/.
Benutzername und Passwort siehe erstes Übungsblatt.

Gruppe Zeit Raum Tutor Besprechungstermin
Blatt 1 Blatt 2 Blatt 3 Blatt 4 Blatt 5 Blatt 6 Blatt 7
1 Mo 15:45-17:15 0.447 T. Mendel 20.10. 3.11. 17.11 1.12. 15.12 19.1. 2.2.
2 Mo 15:45-17:15 0.463 A. Weiß 20.10. 3.11. 17.11 1.12. 15.12 19.1. 2.2.
3 Di 9:45-11:15 0.363 A. Nusser 21.10. 4.11. 18.11 2.12. 16.12 20.1. 3.2.
4 Di 14:00-15:30 0.457 N. Schnelle 21.10. 4.11. 18.11 2.12. 16.12 20.1. 3.2.
5 Di 15:45-17:15 0.118 T. Mendel 21.10. 4.11. 18.11 2.12. 16.12 20.1. 3.2.
6 Mo 15:45-17:15 0.447 T. Mendel 27.10. 10.11. 24.11 8.12. 12.1. 26.1. 9.2.
7 Mo 15:45-17:15 0.463 A Weiß 27.10. 10.11. 24.11 8.12. 12.1. 26.1. 9.2.
8 Di 9:45-11:15 0.363 A. Nusser 28.10. 11.11. 25.11 9.12. 13.1. 27.1. 10.2.
9 Di 14:00-15:30 0.457 T. Mendel 28.10. 11.11. 25.11 9.12. 13.1. 27.1. 10.2.

Achtung: Raumänderung bei den Gruppen 1, 4, 6 und 9.

Übungsblätter

Scheinklausur

Scheinbedingungen

  • 50% der erreichbaren Punkte aus Hausübungen (d.h. 45 Punkte)
  • Bestehen der Scheinklausur

Materialien (nur für den internen Gebrauch, bitte nicht an Dritte weitergeben!)

Aktuelle Folien (PDF) (werden laufend aktualisiert)

Literatur

  • Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms (Second Edition), MIT Press, 2001
  • T. Ottmann, P. Widmayer: Algorithmen und Datenstrukturen, Spektrum Verlag, 1996
  • J. Kleinberg, É. Tardos: Algorithm Design, Addison-Wesley, 2006
  • Uwe Schöning: Theoretische Informatik – kurzgefasst, 5. Auflage, Spektrum, 2008. (Die ältere Auflage von 2000 tut’s auch!)

News

[Jun’23] The paper “Parallel algorithms for power circuits and the word problem of the Baumslag group” by Caroline Mattes and Armin Weiß has been accepted at Computational Complexity.

[Oct’22] The paper “Lower Bounds for Sorting 16, 17, and 18 Elements” by Florian Stober and Armin Weiß has been accepted at ALENEX 2023.

[Sep’22] The paper “Conelikes and Ranker Comparisons” by Viktor Henriksson and Manfred Kufleitner has been accepted at LATIN 2022.

[Sep’22] The paper “Improved Parallel Algorithms for Generalized Baumslag Groups” by Caroline Mattes and Armin Weiß has been accepted at LATIN 2022.

[Apr’22] The paper “Reachability Games and Parity Games” by Volker Diekert and Manfred Kufleitner has been accepted at ICTAC 2022.

[Apr’22] The paper “Satisfiability Problems for Finite Groups” by Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski and Armin Weiß has been accepted at ICALP 2022.

[Mar’22] The paper “The Power Word Problem in Graph Products” by Florian Stober and Armin Weiß was accepted at DLT 2022.

[Nov’20] Volker Diekert is Partner Investigator in the Australian ARC grant “Geodetic groups: foundational problems in algebra and computer science” at University of Technology Sydney.

[Apr’20] The paper “Groups with ALOGTIME-hard word problems and PSPACE-complete circuit value problems” by Laurent Bartholdi, Michael Figelius, Markus Lohrey and Armin Weiß has been accepted at CCC 2020.

[Apr’20] The paper “Hardness of equations over finite solvable groups under the exponential time hypothesis” by Armin Weiß has been accepted at ICALP 2020.

[Dec’19] The paper “An Automaton Group with PSPACE-Complete Word Problem” by Jan Philipp Wächter and Armin Weiß has been accepted at STACS 2020.

[Nov’19] Carlos Camino was awarded the stuvus Special Prize for exceptional commitment in teaching.

[Jun’19] The paper “The power word problem” by Markus Lohrey and Armin Weiß has been accepted at MFCS 2019.

[May’19] The paper “On the Average Case of MergeInsertion” by Florian Stober and Armin Weiß has been accepted at IWOCA 2019.

[Oct’18] The paper “Worst-Case Efficient Sorting with QuickMergesort” by Stefan Edelkamp and Armin Weiß has been accepted at ALENEX 2019.

[Jun’18] At CCC 2018, Lukas Fleischer received a Best Student Paper Award for his submission “On the Complexity of the Cayley Semigroup Membership Problem”.

[Jun’18] The paper “Testing Simon’s congruence” by Lukas Fleischer and Manfred Kufleitner was accepted at MFCS 2018.

[Jun’18] The paper “The Intersection Problem for Finite Semigroups” by Lukas Fleischer was accepted at DLT 2018.

[Apr’18] The paper “The isomorphism problem for finite extensions of free groups is in PSPACE” by Géraud Sénizergues and Armin Weiß was accepted at ICALP 2018.

[Apr’18] The paper “On the Complexity of the Cayley Semigroup Membership Problem” by Lukas Fleischer was accepted at CCC 2018.

[Jan’18] On March 24-29, 2019 Volker Diekert, Markus Lohrey, Olga Kharlampovich and Alexei Miasnikov will organize the Schloss Dagstuhl Seminar “Algorithmic Problems in Group Theory”.

[Dec’17] The paper “The Intersection Problem for Finite Monoids” by Lukas Fleischer and Manfred Kufleitner was accepted at STACS 2018.

[Jun’17] At the 12th International Computer Science Symposium in Russia (CSR), Lukas Fleischer and Manfred Kufleitner received a Best Paper Award for their publication “Green’s Relations in Finite Transformation Semigroups”, and Armin Weiss received a Best Paper Award for “The conjugacy problem in free solvable groups and wreath product of abelian groups is in $\text{TC}^0$ \text{TC}^0 “ which is joint work with Alexei Miasnikov and Svetla Vassileva.