## 2023

### Journal Articles

**Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Compressed Word Problems**ACM Trans. Comput. Theory.**14**(3–4) Association for Computing Machinery, Febuary 2023.

### Conference Articles

**Lower Bounds for Sorting 16, 17, and 18 Elements**ALENEX 2023, Proceedings, 2023.

### Technical Reports

**Complexity of Spherical Equations in Finite Groups**2023.**Geodetic Graphs: Experiments and New Constructions**2023.

## 2022

### Journal Articles

**Regular matching problems for infinite trees**Logical Methods in Computer Science.**Volume 18, Issue 1, 25:1–25:38**2022.**Parallel complexity for nilpotent groups**Internat. J. Algebra Comput..**32**(5):895–928. 2022.**Equation Satisfiability in Solvable Groups**Theory of Computing Systems. 2022.**An Automaton Group with PSPACE-Complete Word Problem**Theory of Computing Systems. 2022.

### Conference Articles

**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.**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.**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.**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.

### Miscellaneous

**Improved Parallel Algorithms for Generalized Baumslag Groups**

## 2021

### Conference Articles

**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.

## 2020

### Journal Articles

**QuickXsort: A Fast Sorting Scheme in Theory and Practice**Algorithmica.**82**(3):509–588. 2020.**Equation satisfiability in solvable groups**arXiv eprints.**abs/2010.11788**2020.**On the Average Case of MergeInsertion**Theory Comput. Syst..**64**(7):1197–1224. 2020.

### Conference Articles

**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.**Decidability of membership problems for flat rational subsets of GL(2,Z) and singular matrices**Proc. International Symposium on Symbolic and Algebraic Computation, ISSAC ’20, Kalamata, Greece, July 20-23, 2020, pages 122–129. ACM, 2020.**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.**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.

## 2019

### Journal Articles

**Orbits of Automaton Semigroups and Groups**ArXiv e-prints.**abs/1903.00222**2019.**An Automaton Group with PSPACE-Complete Word Problem**ArXiv e-prints.**abs/1906.03424**2019.**The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC**Theory Comput. Syst..**63**(4):809–832. 2019.**BlockQuicksort: Avoiding Branch Mispredictions in Quicksort**J. Exp. Algorithmics.**24**(1):1.4:1–1.4:22. ACM, 2019.**Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems**arXiv eprints.**abs/1909.13781**2019.**Decidability of membership problems for flat rational subsets of GL(2, ) and singular matrices**arXiv eprints.**abs/1910.02302**2019.

### Conference Articles

**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.**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.**On the Average Case of MergeInsertion**Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings, pages 417–429. 2019.