| Publication | Date of Publication | Type |
|---|
| Hardness of equations over finite solvable groups under the exponential time hypothesis | 2026-03-18 | Paper |
On the constant-depth circuit complexity of generating quasigroups
TheoretiCS | 2025-10-22 | Paper |
| The word problem for automaton groups | 2025-05-27 | Paper |
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems
ACM Transactions on Computation Theory | 2025-02-21 | Paper |
| Constant depth circuit complexity for generating quasigroups | 2025-02-03 | Paper |
Equation satisfiability in solvable groups
Theory of Computing Systems | 2024-10-07 | Paper |
| Log-space complexity of the conjugacy problem in wreath products | 2024-09-09 | Paper |
The power word problem in graph products
Theory of Computing Systems | 2024-07-29 | Paper |
| Satisfiability problems for finite groups | 2024-06-24 | Paper |
| Lower bounds for sorting 16, 17, and 18 elements | 2024-05-24 | Paper |
Parallel algorithms for power circuits and the word problem of the Baumslag group
Computational Complexity | 2023-10-31 | Paper |
| Complexity of Spherical Equations in Finite Groups | 2023-08-24 | Paper |
| Geodetic Graphs: Experiments and New Constructions | 2023-08-17 | Paper |
Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group.
(available as arXiv preprint) | 2023-08-08 | Paper |
Improved parallel algorithms for generalized Baumslag groups
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
An automaton group with \textsf{PSPACE}-complete word problem
Theory of Computing Systems | 2023-04-27 | Paper |
scientific article; zbMATH DE number 7650891 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
The power word problem in graph products
(available as arXiv preprint) | 2022-08-11 | Paper |
scientific article; zbMATH DE number 7561687 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561757 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Parallel complexity for nilpotent groups
International Journal of Algebra and Computation | 2022-06-24 | Paper |
The Power Word Problem in Graph Products
(available as arXiv preprint) | 2022-01-17 | Paper |
| The isomorphism problem for plain groups is in $\Sigma_3^{\mathsf{P}}$ | 2021-10-02 | Paper |
The isomorphism problem for finite extensions of free groups is in PSPACE
(available as arXiv preprint) | 2021-07-28 | Paper |
On the average case of MergeInsertion
Theory of Computing Systems | 2021-06-11 | Paper |
| Equation satisfiability in solvable groups | 2020-10-22 | Paper |
Context-Free Groups and Bass–Serre Theory
Advanced Courses in Mathematics - CRM Barcelona | 2020-07-13 | Paper |
\(\mathsf{TC}^0\) circuits for algorithmic problems in nilpotent groups
(available as arXiv preprint) | 2020-05-26 | Paper |
On the average case of MergeInsertion
Lecture Notes in Computer Science | 2020-02-25 | Paper |
| Hardness of equations over finite solvable groups under the exponential time hypothesis | 2020-02-24 | Paper |
QuickXsort: a fast sorting scheme in theory and practice
Algorithmica | 2020-02-06 | Paper |
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems
(available as arXiv preprint) | 2019-09-30 | Paper |
Worst-case efficient sorting with QuickMergesort
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\)
Theory of Computing Systems | 2019-07-04 | Paper |
An Automaton Group with PSPACE-Complete Word Problem
(available as arXiv preprint) | 2019-06-08 | Paper |
The power word problem
(available as arXiv preprint) | 2019-04-17 | Paper |
BlockQuicksort: avoiding branch mispredictions in Quicksort
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
BlockQuicksort: avoiding branch mispredictions in Quicksort
(available as arXiv preprint) | 2018-03-02 | Paper |
The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\)
(available as arXiv preprint) | 2017-08-22 | Paper |
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem
Journal of Symbolic Computation | 2017-06-01 | Paper |
A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
Algebra and Computer Science | 2017-04-11 | Paper |
On the dimension of matrix embeddings of torsion-free nilpotent groups
Journal of Algebra | 2017-03-16 | Paper |
QuickHeapsort: modifications and improved analysis
Theory of Computing Systems | 2017-01-18 | Paper |
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits
Algorithmica | 2016-12-21 | Paper |
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem.
Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
QuickXsort: efficient sorting with \(n \log n - 1.399n + o(n)\) comparisons on average
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits
Lecture Notes in Computer Science | 2014-03-31 | Paper |
Weak heaps and friends: recent developments
Lecture Notes in Computer Science | 2014-01-17 | Paper |
QuickHeapsort: modifications and improved analysis
Lecture Notes in Computer Science | 2013-06-14 | Paper |
Context-free groups and their structure trees.
International Journal of Algebra and Computation | 2013-06-05 | Paper |
On the Constant-Depth Circuit Complexity of Generating Quasigroups
(available as arXiv preprint) | N/A | Paper |
