Weak Heaps and Friends: Recent Developments. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen; Armin Weiß (IWOCA, 2013)

QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average. - Stefan Edelkamp; Armin Weiß (CoRR, 2013)

Context-Free Groups and their Structure Trees. - Volker Diekert; Armin Weiß (Int. J. Algebra Comput., 2013)

QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average. - Stefan Edelkamp; Armin Weiß (CSR, 2014)

On the complexity of conjugacy in amalgamated products and HNN extensions. - Armin Weiß (2015)

A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups. - Armin Weiß (AMS-EMS-SPM Joint Meeting, 2016)

Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. - Volker Diekert; Alexei G. Myasnikov; Armin Weiß (Algorithmica, 2016)

BlockQuicksort: How Branch Mispredictions don't affect Quicksort. - Stefan Edelkamp; Armin Weiß (CoRR, 2016)

The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC$^0$. - Alexei Miasnikov; Svetla Vassileva; Armin Weiß (CoRR, 2016)

QuickHeapsort: Modifications and Improved Analysis. - Volker Diekert; Armin Weiß (Theory Comput. Syst., 2016)

The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{ mathsf {T}}}{{ mathsf {C}}}^0$$. - Alexei Miasnikov; Svetla Vassileva; Armin Weiß (CSR, 2017)

TC0 Circuits for Algorithmic Problems in Nilpotent Groups. - Alexei G. Myasnikov; Armin Weiß (MFCS, 2017)

TC^0 circuits for algorithmic problems in nilpotent groups. - Alexei G. Myasnikov; Armin Weiß (CoRR, 2017)

Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. - Volker Diekert; Alexei G. Myasnikov; Armin Weiß (J. Symb. Comput., 2017)

The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE. - Géraud Sénizergues; Armin Weiß (ICALP, 2018)

QuickMergesort: Practically Efficient Constant-Factor Optimal Sorting. - Stefan Edelkamp; Armin Weiß (CoRR, 2018)

Worst-Case Efficient Sorting with QuickMergesort. - Stefan Edelkamp; Armin Weiß (ALENEX, 2019)

The Power Word Problem. - Markus Lohrey; Armin Weiß (MFCS, 2019)

BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. - Stefan Edelkamp; Armin Weiß (ACM J. Exp. Algorithmics, 2019)

The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC 0. - Alexei Miasnikov; Svetla Vassileva; Armin Weiß (Theory Comput. Syst., 2019)

Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. - Laurent Bartholdi; Michael Figelius; Markus Lohrey; Armin Weiß (CCC, 2020)

Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis. - Armin Weiß (ICALP, 2020)

QuickXsort: A Fast Sorting Scheme in Theory and Practice. - Stefan Edelkamp; Armin Weiß; Sebastian Wild (Algorithmica, 2020)

On the Average Case of MergeInsertion. - Florian Stober; Armin Weiß (Theory Comput. Syst., 2020)

The isomorphism problem for plain groups is in Σ3P. - Heiko Dietrich; Murray Elder; Adam Piggott; Youming Qiao; Armin Weiß (CoRR, 2021)

The Power Word Problem in Graph Products. - Florian Stober; Armin Weiß (DLT, 2022)

Satisfiability Problems for Finite Groups. - Pawel M. Idziak; Piotr Kawalek; Jacek Krzaczkowski; Armin Weiß (ICALP, 2022)

Improved Parallel Algorithms for Generalized Baumslag Groups. - Caroline Mattes; Armin Weiß (LATIN, 2022)

The Isomorphism Problem for Plain Groups Is in Σ₃𝖯. - Heiko Dietrich; Murray Elder; Adam Piggott; Youming Qiao; Armin Weiß (STACS, 2022)

Parallel complexity for nilpotent groups. - Alexei G. Myasnikov; Armin Weiß (Int. J. Algebra Comput., 2022)

Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems. - Laurent Bartholdi; Michael Figelius; Markus Lohrey; Armin Weiß (ACM Trans. Comput. Theory, 2022)

Lower Bounds for Sorting 16, 17, and 18 Elements. - Florian Stober; Armin Weiß (ALENEX, 2023)

Geodetic Graphs: Experiments and New Constructions. - Florian Stober; Armin Weiß (CoRR, 2023)

An Automaton Group with PSPACE-Complete Word Problem. - Jan Philipp Wächter; Armin Weiß (Theory Comput. Syst., 2023)

Parallel algorithms for power circuits and the word problem of the Baumslag group. - Caroline Mattes; Armin Weiß (Comput. Complex., 2023)

Scalable Ultrafast Almost-optimal Euclidean Shortest Paths. - Stefan Funke; Daniel Koch; Claudius Proissl; Axel Schneewind; Armin Weiß; Felix Weitbrecht (IJCAI, 2024)

Constant Depth Circuit Complexity for Generating Quasigroups. - Nathaniel A. Collins; Joshua A. Grochow; Michael Levet; Armin Weiß (ISSAC, 2024)

Complexity of Spherical Equations in Finite Groups. - Caroline Mattes; Alexander Ushakov; Armin Weiß (SOFSEM, 2024)

Finite groups with geodetic Cayley graphs. - Murray Elder; Adam Piggott; Florian Stober; Alexander Thumm; Armin Weiß (CoRR, 2024)

The Power Word Problem in Graph Products. - Markus Lohrey; Florian Stober; Armin Weiß (Theory Comput. Syst., 2024)

Equation Satisfiability in Solvable Groups. - Pawel M. Idziak; Piotr Kawalek; Jacek Krzaczkowski; Armin Weiß (Theory Comput. Syst., 2024)

Membership and Conjugacy in Inverse Semigroups. - Lukas Fleischer; Florian Stober; Alexander Thumm; Armin Weiß (ICALP, 2025)

Violating Constant Degree Hypothesis Requires Breaking Symmetry. - Piotr Kawalek; Armin Weiß (STACS, 2025)

On the complexity of epimorphism testing with virtually abelian targets. - Murray Elder; Jerry Shen; Armin Weiß (CoRR, 2025)