Organisatorisches

Dozenten:
Volker Diekert (Raum 1.125, Tel. 0711 / 685 88329)
Manfred Kufleitner (Raum 1.160, Tel. 0711 / 685 88231)
Alexander Lauser (Raum 1.156, Tel. 0711 / 685 88292)

Zielgruppe:
Master-Studiengang Informatik (Theoretische und Methodische Grundlagen),
Master-Studiengang Informatik (Vertiefungslinien),
Diplom-Studiengang Informatik (Hauptstudium),
Master-Studiengang Softwaretechnik (Vertiefungslinien),
Diplom-Studiengang Softwaretechnik (Hauptstudium)

Zeit	Raum	Termine Vorlesung
Mo 14:00–15:30	0.108	April: 08., 15., 22., 29. Mai: 06., 13. Juni: 03., 10., 17. Juli: 01., 15.
Di 12:15–13:30 (ab dem 14.05.) ~~Di 11:30–13:00 (bis zum 07.05.)~~	0.108	April: 09., 16., 23., 30. Mai: 07., 14. Juni: 04., 11. Juli: 02., 09., ~~16.~~

Übungen

Zeit	Raum	Termine Übungen
Fr 14:00–15:30	0.363	19.04., 17.05., 21.06.
Mo 14:00–15:30	0.108	27.05., 24.06., 08.07.
Di 12:15–13:30 ~~Di 11:30–13:00~~	0.108	28.05.

Scheinbedingungen

Scheinbedingung ist eine aktive Teilnahme an den Übungen, insbesondere muss mindestens ein Mal vorgerechnet werden.

Beachten Sie, dass der Schein als Studienleistung eine notwendige Voraussetzung ist, um zur Prüfung zugelassen zu werden.

Übungsblätter

Blatt 1 (PDF, Besprechung am 19.04.)
Blatt 2 (PDF, Besprechung am 17. und 27.04.)
Blatt 3 (PDF, Besprechung am 27.05. und am 28.05.)
Blatt 4 (PDF, Besprechung am 21.06.)
Blatt 5 (PDF, Besprechung am 24.06. Ein Programmgerüst zu Aufgabe 3 gibt es hier.)
Blatt 6 (PDF, Besprechung am 08.07.)

Das Programmgerüst für Aufgabe 2 auf Blatt 2. Die Abgabe des Programms ist bis zum 26.05. verlängert.

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

Die Folien des ersten Teils der Vorlesung (Stand 18.04.2013): (PDF)
Die Folien zum Satz von Razborov über monotone Schaltkreise (Stand 17.06.2013): (PDF)
Die Arbeit von Razborov und Rudich über natürliche Beweise: (PDF)
Eine Kurzfassung desselben auf deutsch (Stand 16.07.2013): (PDF)

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.

All news

[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$ “ which is joint work with Alexei Miasnikov and Svetla Vassileva.