■
Team
■
Teaching
Oberseminar der Theorie
■
Winter 2023
■
Summer 2023
Ferienakademie
Algorithmische Gruppentheorie
Algorithmen für die Kryptographie
Konkrete Mathematik
Theoretische Informatik II
Ergänzung zu Theoretische Informatik II
Programmierprojekt: Mühlespiel mit Rust
■
Winter 2022
■
Summer 2022
■
Winter 2021
■
Summer 2021
■
Winter 2020
■
Summer 2020
■
Winter 2019
■
Summer 2019
■
Winter 2018
■
Summer 2018
■
Winter 2017
■
Summer 2017
■
Winter 2016
■
Summer 2016
■
Winter 2015
■
Summer 2015
■
Winter 2014
■
Summer 2014
■
Winter 2013
■
Summer 2013
■
Winter 2012
■
Summer 2012
■
Winter 2011
Former Semester
BSc, Master-, Student-, Diplomathesis
StuPro/ ProjektINF/ SoPra/ FaPra
Exam Archive
Standard Textbooks
Descriptive Theory
■
Research
■
Publications
 

Ferienakademie 2023: Moderne Algorithmik und Komplexität

Datum: 17. September bis 29. September

Ort: Sarntal, Südtirol, Italien

Dozenten:

Inhalt: Der Kurs ist als Seminar aufgebaut. Jeder Teilnehmer hält eine Präsentation über ein Thema aus dem Bereich Algorithmen und Komplexität. Es werden sowohl klassische Algorithmen aus Lehrbüchern, als auch Originalartikel behandelt.

Die Vortragszeiten werden ergänzt, sobald diese feststehen.

Themenliste München

Siehe auch https://www14.in.tum.de/lehre/2023SS/sarntal/index.html.de.

  1. Convex Hulls
    • Vortragender: Maximilian Böhmichen
    • M. de Berg, O. Cheong, M.J. van Kreveld, M.H. Overmars. Computational Geometry: Algorithms and Applications. 3rd Edition. Springer 2008. ISBN 9783540779735. https://doi.org/10.1007/978-3-540-77974-2. Chapters 1 and 11.
  2. Line Segment Intersection
    • Vortragende: Syrine Aidani
    • M. de Berg, O. Cheong, M.J. van Kreveld, M.H. Overmars. Computational Geometry: Algorithms and Applications. 3rd Edition. Springer 2008. ISBN 9783540779735. https://doi.org/10.1007/978-3-540-77974-2. Chapter 2.
  3. Voronoi Diagrams
    • Vortragender: Jingtian Zhao
    • M. de Berg, O. Cheong, M.J. van Kreveld, M.H. Overmars. Computational Geometry: Algorithms and Applications. 3rd Edition. Springer 2008. ISBN 9783540779735. https://doi.org/10.1007/978-3-540-77974-2. Chapter 7.
  4. Fibonacci Heaps
    • Vortragender: Umut Yildirir
    • T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein. Introduction to Algorithms. 3rd Edition. MIT Press 2009. ISBN 978-0-262-03384-8. https://dl.acm.org/doi/book/10.5555/1614191. Chapter 19.
  5. Min-Cut
    • Vortragende: Vivien Finley
    • M. Stoer, F. Wagner. A simple min-cut algorithm. Journal of the ACM. 44(4):585, 1997. doi:10.1145/263867.263872
    • D.R. Karger, C. Stein. A New approach to the minimum cut problem. J. ACM 43(4): 601-640, 1996. doi:10.1145/234533.234534 Material also in R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995, pages 7-9 and 289-295.
  6. Paging and Caching
    • Vortragender: Houssem Kotti
    • D.D. Sleator, R.E. Tarjan. Amortized efficiency of list update and paging rules. Commun. ACM, 28(2):202-208, 1985. doi:10.1145/2786.2793
    • A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator, N.E. Young. Competitive paging algorithms. J. Algorithms, 12(4): 685-699, 1991. doi:10.1016/0196-6774(91)90041-V
  7. Approximation Algorithms: Basic Results
    • Vortragender: Fabian Lehr
    • T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein. Introduction to Algorithms. 3rd Edition. MIT Press 2009. ISBN 978-0-262-03384-8. https://dl.acm.org/doi/book/10.5555/1614191. Chapter 35.

Themenliste Stuttgart

  1. Parity Games in Quasipolynomialzeit
    • Vortragender: Moritz Gösling
    • Lehtinen, Karoliina. “A modal μ perspective on solving parity games in quasi-polynomial time.” Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. 2018.
    • Diekert, Volker, and Manfred Kufleitner. “Reachability Games and Parity Games.” International Colloquium on Theoretical Aspects of Computing. Cham: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-17715-6/_3
  2. Fibonacci Heaps
    • Vortragender: Julius von Smercek
    • Kozen, Dexter. The design and analysis of algorithms. Kapitel 8 und 9. Springer Science & Business Media, 1992.
  3. Dünne NP-volständige Sprachen
    • Vortragender: Julius von Smercek
    • Mahaney, Stephen R. “Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis.” Journal of Computer and System Sciences 25.2 (1982): 130-143. https://doi.org/10.1016/0022-0000(82)90002-2
    • Hartmanis, Juris. “New developments in structural complexity theory.” International Colloquium on Automata, Languages, and Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. https://doi.org/10.1016/0304-3975(90)90191-J
  4. Splay Trees
    • Vortragender: Dominik Larche
    • Kozen, Dexter. The design and analysis of algorithms. Kapitel 12. Springer Science & Business Media, 1992.

Themenliste Erlangen

  1. Genetische/Evolutionäre Algorithmen und eine Analyse, wie sie sortieren
    • Vortragender: Ingo Sternberg
    • J. Scharnow, K. Tinnefeld, I. Wegener. The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms 3 (2005) 349-366. doi:10.1007/s10852-005-2584-0

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.