2023

Conference Articles

  1. Florian Stober and Armin Weiß
    Lower Bounds for Sorting 16, 17, and 18 Elements
    ALENEX 2023, Proceedings, 2023.

Technical Reports

  1. Caroline Mattes , Alexander Ushakov and Armin Weiß
    Complexity of Spherical Equations in Finite Groups
    2023.
  2. Florian Stober and Armin Weiß
    Geodetic Graphs: Experiments and New Constructions
    2023.

2022

Journal Articles

  1. Alexei Myasnikov and Armin Weiß
    Parallel complexity for nilpotent groups
    Internat. J. Algebra Comput.. 32(5):895–928. 2022.
    DOI

Conference Articles

  1. Heiko Dietrich , Murray Elder , Adam Piggott , Youming Qiao and Armin Weiß
    The Isomorphism Problem for Plain Groups Is in \Sigma_3^P \Sigma_3^P
    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.
    DOI
  2. Pawel M. Idziak , Piotr Kawalek , Jacek Krzaczkowski and Armin Weiß
    Satisfiability problems for finite groups
    ICALP 2022, Proceedings, volume 229 of LIPIcs, pages 127:1–127:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
  3. Florian Stober and Armin Weiß
    The Power Word Problem in Graph Products
    Developments in Language Theory - 26th International Conference, DLT 2022, Proceedings, volume 13257 of Lecture Notes in Computer Science, pages 286–298. Springer, 2022.
    DOI
  4. Caroline Mattes and Armin Weiß
    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.
    DOI

2021

Conference Articles

  1. Caroline Mattes and Armin Weiß
    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.
    DOI

2020

Journal Articles

  1. Stefan Edelkamp , Armin Weiß and Sebastian Wild
    QuickXsort: A Fast Sorting Scheme in Theory and Practice
    Algorithmica. 82(3):509–588. 2020.
    DOI
  2. Paweł Idziak , Piotr Kawałek , Jacek Krzaczkowski and Armin Weiß
    Equation satisfiability in solvable groups
    arXiv eprints. abs/2010.11788 2020.
  3. Florian Stober and Armin Weiß
    On the Average Case of MergeInsertion
    Theory Comput. Syst.. 64(7):1197–1224. 2020.
    DOI

Conference Articles

  1. Jan Philipp Wächter and Armin Weiß
    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.
    DOI
  2. Laurent Bartholdi , Michael Figelius , Markus Lohrey and Armin Weiß
    Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems
    35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference), volume 169 of LIPIcs, pages 29:1–29:29. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020.
    DOI
  3. Armin Weiß
    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.
    PDF
    DOI

2019

Journal Articles

  1. Jan Philipp Wächter and Armin Weiß
    An Automaton Group with PSPACE-Complete Word Problem
    ArXiv e-prints. abs/1906.03424 2019.
    PDF
  2. Alexei Miasnikov , Svetla Vassileva and Armin Weiß
    The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC^0 ^0
    Theory Comput. Syst.. 63(4):809–832. 2019.
    DOI
  3. Stefan Edelkamp and Armin Weiß
    BlockQuicksort: Avoiding Branch Mispredictions in Quicksort
    J. Exp. Algorithmics. 24(1):1.4:1–1.4:22. ACM, 2019.
    DOI
  4. Laurent Bartholdi , Michael Figelius , Markus Lohrey and Armin Weiß
    Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems
    arXiv eprints. abs/1909.13781 2019.

Conference Articles

  1. Stefan Edelkamp and Armin Weiß
    Worst-Case Efficient Sorting with QuickMergesort
    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.
    DOI
  2. Markus Lohrey and Armin Weiß
    The Power Word Problem
    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.
  3. Florian Stober and Armin Weiß
    On the Average Case of MergeInsertion
    Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings, pages 417–429. 2019.
    DOI

2018

Journal Articles

  1. Stefan Edelkamp and Armin Weiß
    QuickMergesort: Practically Efficient Constant-Factor Optimal Sorting
    arXiv eprints. abs/1804.10062 2018.
  2. Géraud Sénizergues and Armin Weiß
    The isomorphism problem for finite extensions of free groups is in PSPACE
    ArXiv e-prints. 2018.
  3. Stefan Edelkamp , Armin Weiß and Sebastian Wild
    QuickXsort - A Fast Sorting Scheme in Theory and Practice
    arXiv eprints. abs/1811.01259 2018.

Conference Articles

  1. Géraud Sénizergues and Armin Weiß
    The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE
    45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, pages 139:1–139:14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018.
    DOI

Book Chapters

  1. Alexei Myasnikov , Svetla Vassileva and Armin Weiß
    Log-Space Complexity of the Conjugacy Problem in Wreath Products
    Infinite Group Theory, Chapter 12, pages 215-236. World Scientific, 2018.
    DOI

2017

Journal Articles

  1. Funda Gul and Armin Weiß
    On the dimension of matrix embeddings of torsion-free nilpotent groups
    J. Algebra. 477:516–539. 2017.
    DOI
  2. Alexei G. Myasnikov and Armin Weiß
    \text{TC}^0 \text{TC}^0 circuits for algorithmic problems in nilpotent groups
    ArXiv e-prints. abs/1702.06616 2017.
    PDF
  3. Volker Diekert , Alexei G. Myasnikov and Armin Weiß
    Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem
    J. Symb. Comput.. 83:147–165. 2017.
    DOI

Conference Articles

  1. Alexei Miasnikov , Svetla Vassileva and Armin Weiß
    The conjugacy problem in free solvable groups and wreath product of abelian groups is in \text{TC}^0 \text{TC}^0
    Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings, pages 217–231. 2017.
    PDF
    DOI
  2. Alexei G. Myasnikov and Armin Weiß
    TC^0 ^0 Circuits for Algorithmic Problems in Nilpotent Groups
    42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, Proceedings, volume 83 of LIPIcs, pages 23:1–23:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
    DOI

Book Chapters

  1. Volker Diekert and Armin Weiß
    Context-Free Groups and Bass-Serre Theory
    Algorithmic and Geometric Topics Around Free Groups and Automorphisms, Advanced Courses in Mathematics - CRM Barcelona, Birkhäuser, 2017.
    DOI

2016

Journal Articles

  1. Stefan Edelkamp and Armin Weiß
    BlockQuicksort: How Branch Mispredictions don’t affect Quicksort
    ArXiv e-prints. abs/1604.06697 2016.
    PDF
  2. Volker Diekert , Alexei G. Myasnikov and Armin Weiß
    Conjugacy in Baumslag’s group, generic case complexity, and division in power circuits
    Algorithmica. 74:961-988. 2016.
    PDF
    DOI
  3. Volker Diekert and Armin Weiß
    QuickHeapsort: Modifications and Improved Analysis
    Theory Comput. Syst.. 59(2):209–230. 2016.
    PDF
    DOI

Conference Articles

  1. Stefan Edelkamp and Armin Weiß
    BlockQuicksort: Avoiding Branch Mispredictions in Quicksort
    24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, volume 57 of LIPIcs, pages 38:1–38:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
    PDF
    DOI

Book Chapters

  1. Armin Weiß
    A Logspace Solution to the Word and Conjugacy problem of Generalized Baumslag-Solitar Groups
    Algebra and Computer Science, volume 677 of Contemporary Mathematics, pages 185–212. American Mathematical Society, 2016.
    PDF

2015

Conference Articles

  1. Volker Diekert , Alexei G. Myasnikov and Armin Weiß
    Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem
    Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2015, Bath, United Kingdom, July 06 - 09, 2015, pages 141–148. 2015.
    PDF
    DOI

Theses

  1. Armin Weiß
    On the Complexity of Conjugacy in Amalgamated Products and HNN Extensions
    Dissertation, Institut für Formale Methoden der Informatik, Universität Stuttgart, 2015.
    PDF

2014

Conference Articles

  1. Volker Diekert , Alexei G. Myasnikov and Armin Weiß
    Conjugacy in Baumslag’s Group, Generic Case Complexity, and Division in Power Circuits
    Latin American Theoretical Informatics Symposium, pages 1-12. 2014.
    DOI
  2. Stefan Edelkamp and Armin Weiß
    QuickXsort: Efficient Sorting with n \log n -
		  1.399n + o(n) n \log n - 1.399n + o(n) Comparisons on Average
    CSR, pages 139-152. 2014.
    DOI

2013

Journal Articles

  1. Stefan Edelkamp and Armin Weiß
    QuickXsort: Efficient Sorting with n \log n -
		  1.399n + o(n) n \log n - 1.399n + o(n) Comparisons on Average
    ArXiv e-prints. abs/1307.3033 2013.
    PDF
  2. Volker Diekert and Armin Weiß
    Context-Free Groups and Their Structure Trees
    International Journal of Algebra and Computation. 23:611–642. 2013.
    DOI
  3. Volker Diekert and Armin Weiß
    Context-Free Groups and Bass-Serre Theory
    ArXiv e-prints. 2013.
    PDF

Conference Articles

  1. Volker Diekert and Armin Weiß
    QuickHeapsort: Modifications and Improved Analysis
    Computer Science Symposium in Russia (CSR) 2013, Conference Proceedings, pages 24-35. 2013.
    PDF
    DOI
  2. Stefan Edelkamp , Amr Elmasry , Jyrki Katajainen and Armin Weiß
    Weak Heaps and Friends: Recent Developments
    Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, pages 1–6. 2013.
    DOI

2011

Theses

  1. Armin Weiß
    Eine kombinatorische Charakterisierung kontextfreier Gruppen
    Diplomarbeit Nr. 3075, Fakultät Informatik, 2011.

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.