Armin Weiß

From MaRDI portal
Person:504990

Available identifiers

zbMath Open weiss.arminMaRDI QIDQ504990

List of research outcomes





PublicationDate of PublicationType
Equation satisfiability in solvable groups2024-10-07Paper
Log-space complexity of the conjugacy problem in wreath products2024-09-09Paper
The power word problem in graph products2024-07-29Paper
Satisfiability problems for finite groups2024-06-24Paper
Lower bounds for sorting 16, 17, and 18 elements2024-05-24Paper
Parallel algorithms for power circuits and the word problem of the Baumslag group2023-10-31Paper
Complexity of Spherical Equations in Finite Groups2023-08-24Paper
Geodetic Graphs: Experiments and New Constructions2023-08-17Paper
Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group.2023-08-08Paper
Improved parallel algorithms for generalized Baumslag groups2023-07-26Paper
An automaton group with \textsf{PSPACE}-complete word problem2023-04-27Paper
https://portal.mardi4nfdi.de/entity/Q58742762023-02-07Paper
The power word problem in graph products2022-08-11Paper
https://portal.mardi4nfdi.de/entity/Q50924052022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50924802022-07-21Paper
Parallel complexity for nilpotent groups2022-06-24Paper
The Power Word Problem in Graph Products2022-01-17Paper
The isomorphism problem for plain groups is in $\Sigma_3^{\mathsf{P}}$2021-10-02Paper
The isomorphism problem for finite extensions of free groups is in PSPACE2021-07-28Paper
On the average case of MergeInsertion2021-06-11Paper
Equation satisfiability in solvable groups2020-10-22Paper
Context-Free Groups and Bass–Serre Theory2020-07-13Paper
TC^0 circuits for algorithmic problems in nilpotent groups2020-05-26Paper
On the average case of MergeInsertion2020-02-25Paper
Hardness of equations over finite solvable groups under the exponential time hypothesis2020-02-24Paper
QuickXsort: a fast sorting scheme in theory and practice2020-02-06Paper
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems2019-09-30Paper
Worst-Case Efficient Sorting with QuickMergesort2019-09-13Paper
The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\)2019-07-04Paper
An Automaton Group with PSPACE-Complete Word Problem2019-06-08Paper
The power word problem2019-04-17Paper
BlockQuicksort2019-03-27Paper
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort2018-03-02Paper
The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\)2017-08-22Paper
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem.2017-06-01Paper
A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups2017-04-11Paper
On the dimension of matrix embeddings of torsion-free nilpotent groups2017-03-16Paper
QuickHeapsort: modifications and improved analysis2017-01-18Paper
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits2016-12-21Paper
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem.2016-09-29Paper
QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average2014-06-24Paper
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits2014-03-31Paper
Weak Heaps and Friends: Recent Developments2014-01-17Paper
QuickHeapsort: modifications and improved analysis2013-06-14Paper
CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES2013-06-05Paper
On the Constant-Depth Circuit Complexity of Generating QuasigroupsN/APaper

Research outcomes over time

This page was built for person: Armin Weiß