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

The Complexity of Knapsack Problems in Wreath Products. - Michael Figelius; Moses Ganardi; Markus Lohrey; Georg Zetzsche (ICALP, 2020)

Exponent Equations in HNN-extensions. - Michael Figelius; Markus Lohrey (ISSAC, 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)