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 10.2 10:00-12:00 V38 0.108 1. Semester
Di 11.2 10:00-12:00 V38 0.108 2. Semester
Mi 12.2 10:00-12:00 V38 0.108 alte Prüfung / Fragestunde

Materialien

  1. Blatt Semester 1
  2. Blatt Semester 2
  3. Klausur SS13

Vortragsübung

Jonathan Kausch

Diese Veranstaltung ergänzt die Vorlesung Mathematik I 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
Do 9:45–11:15 V47.01 wöchentlich ab 24.10.    außer am 26.12., 02.01.

Materialien

  1. Blatt 1 vom 24.10.13
  2. Blatt 2 vom 31.10.13
  3. Blatt 3 vom 07.11.13
  4. Blatt 4 vom 14.11.13
  5. Blatt 5 vom 21.11.13
  6. Blatt 6 vom 28.11.13
  7. Blatt 7 vom 05.12.13
  8. Blatt 8 vom 12.12.13
  9. Blatt 9 vom 19.12.13
  10. Blatt 10 vom 09.01.13
  11. Blatt 11 vom 16.01.13
  12. Blatt 12 vom 23.01.13
  13. Scheinklausur 1 vom WS 2011/2012
  14. Scheinklausur 2 vom WS 2011/2012

Zusatzübungen

Dies ist ein Angebot für Studierende, die noch keinen Schein aus den Gruppenübungen haben. Zusätzliche Aufgaben und ausführliche Beantwortung von Fragen sollen helfen, den Übungsschein in den Gruppenübungen zu erwerben.

Termine

Zeit Raum Termine
Di 15:45–17:15 V38 0.118 wöchentlich ab 23.10.    außer am 24.12., 31.12.

Materialien

  1. Blatt 1 vom 23.10.13
  2. Blatt 2 vom 30.10.13
  3. Blatt 3 vom 05.11.13
  4. Blatt 4 vom 12.11.13
  5. Blatt 5 vom 19.11.13
  6. Blatt 6 vom 26.11.13
  7. Blatt 7 vom 03.12.13
  8. Blatt 8 vom 10.12.13
  9. Blatt 9 vom 17.12.13
  10. Blatt 10 vom 07.1.13
  11. Blatt 11 vom 14.1.13
  12. Blatt 12 vom 21.1.13
  13. Scheinklausur 1 vom WS 2011/2012
  14. Scheinklausur 2 vom WS 2011/2012

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.