| 2026 | ICALP | The Complexity of Finding Coset-Generating Polymorphisms and the Promise Metaproblem. | Manuel Bodirsky, Armin Wei |
| 2026 | MFCS | Satisfiability of Multivalued Circuits with Lists. | Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Wei |
| 2026 | STACS | Efficient Compression in Semigroups. | Alexander Thumm, Armin Wei |
| 2025 | ICALP | Membership and Conjugacy in Inverse Semigroups. | Lukas Fleischer, Florian Stober, Alexander Thumm, Armin Wei |
| 2025 | STACS | Violating Constant Degree Hypothesis Requires Breaking Symmetry. | Piotr Kawalek, Armin Wei |
| 2024 | IJCAI | Scalable Ultrafast Almost-optimal Euclidean Shortest Paths. | Stefan Funke, Daniel Koch, Claudius Proissl, Axel Schneewind, Armin Wei, Felix Weitbrecht |
| 2024 | ISSAC | Constant Depth Circuit Complexity for Generating Quasigroups. | Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Wei |
| 2024 | SOFSEM | Complexity of Spherical Equations in Finite Groups. | Caroline Mattes, Alexander Ushakov, Armin Wei |
| 2023 | ALENEX | Lower Bounds for Sorting 16, 17, and 18 Elements. | Florian Stober, Armin Wei |
| 2022 | DLT | The Power Word Problem in Graph Products. | Florian Stober, Armin Wei |
| 2022 | ICALP | Satisfiability Problems for Finite Groups. | Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Wei |
| 2022 | LATIN | Improved Parallel Algorithms for Generalized Baumslag Groups. | Caroline Mattes, Armin Wei |
| 2022 | STACS | The Isomorphism Problem for Plain Groups Is in Σ₃ | Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, Armin Wei |
| 2021 | MFCS | Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group. | Caroline Mattes, Armin Wei |
| 2020 | ICALP | Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis. | Armin Wei |
| 2020 | STACS | An Automaton Group with PSPACE-Complete Word Problem. | Jan Philipp Wchter, Armin Wei |
| 2019 | ALENEX | Worst-Case Efficient Sorting with QuickMergesort. | Stefan Edelkamp, Armin Wei |
| 2019 | IWOCA | On the Average Case of MergeInsertion. | Florian Stober, Armin Wei |
| 2019 | MFCS | The Power Word Problem. | Markus Lohrey, Armin Wei |
| 2018 | ICALP | The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE. | Graud Snizergues, Armin Wei |
| 2017 | CSR | 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 |
| 2017 | MFCS | TC | Alexei G. Myasnikov, Armin Wei |
| 2016 | ESA | BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. | Stefan Edelkamp, Armin Wei |
| 2015 | ISSAC | Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem. | Volker Diekert, Alexei G. Myasnikov, Armin Wei |
| 2014 | CSR | QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average. | Stefan Edelkamp, Armin Wei |
| 2014 | LATIN | Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. | Volker Diekert, Alexei G. Myasnikov, Armin Wei |
| 2013 | CSR | QuickHeapsort: Modifications and Improved Analysis. | Volker Diekert, Armin Wei |
| 2013 | IWOCA | Weak Heaps and Friends: Recent Developments. | Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Wei |