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)

Zeit	Raum	Termine Vorlesung
Mo 14:00–15:30	0.108	wöchentlich (am 14.04. und 28.04. finden Übungen statt)
Di 11:30–13:00	0.108	vierzehntäglich mit den Übungen im Wechsel. Die genauen Termine finden sich bei den Übungsblättern

Klausur

Die Ergebnisse der Klausur vom 28.08.2014 hängen am silbernen Brett neben Raum 1.101 aus. Für einen Einsichtstermin melden Sie sich bis Ende September bei Frau Photien (Raum 1.117).

Übungen

Zeit	Raum	Termine Übungen
Mo 14:00–15:30, Di 11:30–13:00	0.108	vierzehntäglich mit der Vorlesung im Wechsel. Die genauen Termine finden sich bei den Übungsblättern

Scheinbedingungen

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

Übungsblätter

Blatt 1 (Besprechung am 14.04.)
Blatt 2 (Besprechung am 28. und 29.04.)
Blatt 3 (Besprechung am 20.05.)
Blatt 4 (Besprechung am 16.06.)
Blatt 5 (Besprechung am 01.07.)
Blatt 6 (Besprechung am 14. und 15.07.)

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

Die Folien zur Vorlesung (Stand 07.05.2014): (PDF)

Literatur

Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger:
Elemente der Diskreten Mathematik, Walter de Gruyter, 2013.
Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger:
Diskrete algebraische Methoden, Walter de Gruyter, 2013.
Ronald L. Graham, Donald E. Knuth, Oren Patashnik:
Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, 1994
Jiří Matoušek, Jaroslav Nešetřil:
Diskrete Mathematik - Eine Entdeckungsreise, Springer-Verlag, 2002

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.