Heiko Dietrich
, Murray Elder
, Adam Piggott
, Youming Qiao
and Armin Weiß
The Isomorphism Problem for Plain Groups Is in
39th International Symposium on Theoretical Aspects of
Computer Science, STACS 2022, March 15-18, 2022,
Marseille, France (Virtual Conference), volume 219 of LIPIcs, pages 26:1–26:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
Developments in Language Theory - 26th International
Conference, DLT 2022, Proceedings, volume 13257 of Lecture Notes in Computer Science, pages 286–298. Springer, 2022.
Improved Parallel Algorithms for Generalized Baumslag
Groups
LATIN 2022: Theoretical Informatics - 15th Latin
American Symposium, Guanajuato, Mexico, November 7-11,
2022, Proceedings, volume 13568 of Lecture Notes in Computer Science, pages 658–675. Springer, 2022.
Properties of Graphs Specified by a Regular Language
Developments in Language Theory - 25th International
Conference, DLT 2021, Porto, Portugal, August 16-20,
2021, Proceedings, volume 12811 of Lecture Notes in Computer Science, pages 117–129. Springer, 2021.
Parallel Algorithms for Power Circuits and the Word
Problem of the Baumslag Group
46th International Symposium on Mathematical Foundations
of Computer Science, MFCS 2021, August 23-27, 2021,
Tallinn, Estonia, volume 202 of LIPIcs, pages 74:1–74:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
An Automaton Group with PSPACE-Complete Word Problem
37th International Symposium on Theoretical Aspects of
Computer Science, STACS 2020, March 10-13, 2020,
Montpellier, France, pages 6:1–6:17. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020.
Hardness of Equations over Finite Solvable Groups Under
the Exponential Time Hypothesis
47th International Colloquium on Automata, Languages, and
Programming, ICALP 2020, July 8-11, 2020,
Saarbrücken, Germany (Virtual Conference), pages 102:1–102:19. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020.
Proceedings of the Twenty-First Workshop on Algorithm
Engineering and Experiments, ALENEX 2019, San Diego, CA,
USA, January 7-8, 2019, pages 1–14. SIAM, 2019.
44th International Symposium on Mathematical Foundations
of Computer Science, MFCS 2019, Proceedings, volume 138 of LIPIcs, pages 43:1–43:15. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019.
[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
“ which is joint work with Alexei Miasnikov
and Svetla Vassileva.
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), volume 219 of LIPIcs, pages 26:1–26:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.