Prof. Dr. Volker Diekert, Prof. Dr. Ulrich Hertrampf

Inhalte der Veranstaltung

Im Oberseminar werden aktuelle Arbeiten aus dem Bereich der Theoretischen Informatik vorgetragen, meist von Diplomand(inn)en und Mitarbeiter(innen), aber auch von auswärtigen Gästen. Theorie-Interessierte sind jederzeit willkommen.


Zeit Raum
Mittwoch 9:45 – 11:15 Uhr 0.124
Termin Vortragender Thema
11.04.18   Vorbesprechung
13.04.18 Jarkko Heidenwag Durchschnittsanalyse für Quicksort mit Links-Rechts-Partitionierung im Fall vieler Duplikate

Frühere Semester

Termin Vortragender Thema
18.10.17   Vorbesprechung
25.10.17 Lukas Fleischer The Complexity of the Intersection Problem for Finite Monoids
08.11.17 Lukas Fleischer The Complexity of the Intersection Problem for Finite Monoids, Teil 2
15.11.17 Armin Weiß Minimum cuts and structure trees of context free groups
22.11.17 Armin Weiß Minimum cuts and structure trees of context free groups, Teil 2

News

[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.