Prüfungsvorbereitungskurs (zur Wiederholungsprüfung der Modulprüfung)

Jonathan Kausch

Im Prüfungsvorbereitungskurs wird der Stoff der beiden Semester wiederholt. Außerdem besteht die Möglichkeit Fragen zu stellen. Wünsche zu Aufgaben bitte per E-Mail an mich.

Termine

Termin Raum Thema
Mo 04.08 10:00-12:00 V38.4 1. Semester
Mi 06.08 10:00-12:00 V38.4 2. Semester
Fr 08.08 10:00-12:00 V38.4 alte Prüfung / Fragestunde

Materialien

Vortragsübung

Jonathan Kausch

Diese Veranstaltung ergänzt die Vorlesung Mathematik II für Informatiker und Softwaretechniker. Es werden ähnliche Aufgaben wie in den Gruppenübungen vorgerechnet und Fragen zum Vorlesungsstoff beantwortet.

Wünsche zu Aufgaben können gerne per E-Mail an mich geäußert werden.

Termine

Zeit Raum Termine
Mi 9:45–11:15 V7.02 wöchentlich ab 9.04.    außer am 11.6.

Materialien

  1. Blatt 01 vom 09.4.14
  2. Blatt 02 vom 16.4.14
  3. Blatt 03 vom 23.4.14
  4. Blatt 04 vom 30.4.14
  5. Blatt 05 vom 07.5.14
  6. Blatt 06 vom 14.5.14
  7. Blatt 07 vom 21.5.14
  8. Blatt 08 vom 28.5.14
  9. Blatt 09 vom 04.6.14
  10. Blatt 10 vom 18.6.14
  11. Blatt 11 vom 25.6.14
  12. Blatt 12 vom 02.7.14
  13. Blatt 13 vom 09.7.14
  14. Scheinklausur SS13

Zusatzübungen

Die Zusatzübung ist ein Angebot für Studierende höheren Semesters und Studenten, denen die Übungen schwer fallen. Die Übung ist eine Präsenzübung als Vorbereitung für das nächste Übungsblatt. Zusätzliche Aufgaben mit Unterstützung beim Lösen und ausführliche Beantwortung von Fragen sollen helfen, den Übungsschein in den Gruppenübungen zu erwerben.

Termine

Zeit Raum Termine
Do 15:45–17:15 V38 0.118 wöchentlich ab 10.4    außer am 12.6., 19.6.

Hinweis: Für die Donnerstag-Feiertage (den 1.5, 29.5 und 19.6) wird versucht einen Ausweichtermin zu finden.

Materialien

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.

[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$ \text{TC}^0 “ which is joint work with Alexei Miasnikov and Svetla Vassileva.