Vorlesung

Diese Veranstaltung ergänzt die Module “Berechenbarkeit und Komplexität” (inf), Algorithmen und Berechenbarkeit (swt) und Formale Methoden (winf). Die Veranstaltung gliedert sich in drei Bereiche:

Wiederholung der Inhalte aus den Vorlesungen und Übungen mit zusätzlichen oder ausführlicheren Erklärungen, sowie Wiederholung wichtiger Themen aus Mathematik und theoretischer Informatik des ersten Semesters
Ergänzung des Stoffes mit weiterführenden Ergebnissen, alternativen Beweisen, zusätzlichen Beispielen und Verknüpfung mit praktischen Anwendungen
Hilfe bei Schwierigkeiten mit den Hausübungen

Themenwünsche können per E-Mail an den Dozenten geäußert werden.

Termine und Materialien

Achtung: Die Termine können sich noch ändern!

	Informatik	Softwaretechnik	Wirtschaftsinformatik
KW 42
KW 43	Mo 22.10. 17:30–19:00 [Materialien]
KW 44	Mo 29.10. 17:30–19:00 [Materialien]
KW 45		Fr 09.11. 11:30–13:00 [Materialien]
KW 46	Mo 12.11. 17:30–19:00 [Materialien]	Fr 16.11. 11:30–13:00 [Materialien]
KW 47
KW 48	Mo 26.11. 17:30–19:00 [Materialien]	Fr 30.11. 11:30–13:00 [Materialien]
KW 49
KW 50
KW 51	Mo 17.12. 17:30–19:00 [Materialien] (Vorlesungsumfrage)	Fr 21.12. 11:30–13:00 [Materialien] (Vorlesungsumfrage)
KW 52	vorlesungsfrei
KW 1	vorlesungsfrei
KW 2	Mo 07.01. 17:30–19:00 [Materialien]	Fr 11.01. 11:30–13:00 [Materialien]
KW 3
KW 4	Mo 21.01. 17:30–19:00 [Materialien]	Fr 25.01. 11:30–13:00 [Materialien]
KW 5
KW 6	Mo 04.02. 17:30–19:00	Fr 08.02. 11:30–13:00 VERLEGT in 0.108

Beachten Sie, dass die Materialien kein eigenständiges Skript und keine Übungsblätter darstellen und nur im Zusammenhang mit der Vorlesung Sinn ergeben.

Links

Prüfungsklausuren aus früheren Jahrgängen - teilweise mit Lösungsvorschlägen - finden Sie hier
Die Prüfungstermine, beispielweise für die Modulprüfungen, finden Sie beim Prüfungsamt.

Literatur

Ein – teils kommentiertes – Literaturverzeichnis zu den jeweils behandelten Themen finden Sie in den Materialien zur Vorlesung.

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.