Organisatorisches

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

Übungen: Tobias Walter

Zeit	Raum	Termine
Mo 11:30-13:00	V38.04	wöchentlich ab 14.10.13
Di 15:45-17:15	V38.04	wöchentlich ab 15.10.13

Am Montag, 25.11. findet keine Vorlesung statt!

Ergänzungen

Daniel Bahrdt
Webseite der Ergänzungen

Übungen

Gruppe	Zeit	Raum	Tutor	Besprechungstermin
Gruppe	Zeit	Raum	Tutor	Blatt 1	Blatt 2	Blatt 3	Blatt 4	Blatt 5	Blatt 6	Blatt 7
1	Di 14:00-15:30	0.124	T. Walter	22.10.	5.11.	19.11	3.12.	17.12	14.01.	28.1.
2	Di 14:00-15:30	0.447	A. Bühler	22.10.	05.11.	19.11	03.12.	17.12	14.01.	28.01.
3	Di 17:30-19:00	0.447	M. Schneider	22.10.	05.11.	19.11	03.12.	17.12	14.01.	28.01.
4	Di 14:00-15:30	0.447	A. Bühler	29.10.	12.11.	26.11	10.12	07.01.	21.01.	04.02.
5	Di 17:30-19:00	0.447	M. Schneider	29.10.	12.11.	26.11	10.12	07.01.	21.01.	04.02.

Scheinbedingungen

Pro Übungsblatt müssen Aufgaben schriftlich bearbeitet werden.

Am ~~Ende der Veranstaltung~~

Dienstag, 21.1. in der Vorlesung
wird eine Scheinklausur geschrieben.

Es müssen 50% der Summe der erreichbaren Punkte aus Hausübungen und Scheinklausur erreicht werden.

Übungsblätter

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

Die aktuellen Folien der Vorlesung (Stand 14.1.2014): (PDF)

Kapitel “diskrete Wahrscheinlichkeitsrechnung” aus Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger: Elemente der Diskreten Mathematik, Walter de Gruyter, 2013: (PDF)

Auf der Seite der Vorlesung EAA (Sommersemester 09) finden Sie unter Anderem ein Skript, das viele Themen dieser Vorlesung tiefergehend behandelt.

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

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.