10 citations · 34 across the 21 of their papers we have counts for
28 papers
Complexity of Spherical Equations in Finite Groups
Caroline Mattes, Alexander Ushakov, Armin Weiß
In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different v…
Geodetic Graphs: Experiments and New Constructions
Florian Stober, Armin Weiß
In 1962 Ore initiated the study of geodetic graphs. A graph is called geodetic if the shortest path between every pair of vertices is unique. In the subsequent years a wide range o…
Improved Parallel Algorithms for Baumslag Groups
Caroline Mattes, Armin Weiß
The Baumslag group had been a candidate for a group with an extremely difficult word problem until Myasnikov, Ushakov, and Won succeeded to show that its word problem can be solved…
Lower Bounds for Sorting 16, 17, and 18 Elements
Florian Stober, Armin Weiß
It is a long-standing open question to determine the minimum number of comparisons that suffice to sort an array of elements. Indeed, before this work has been kn…
The Power Word Problem in Graph Products
Markus Lohrey, Florian Stober, Armin Weiß
The power word problem for a group asks whether an expression , where the are words over a finite set of generators of and the binar…
The isomorphism problem for plain groups is in
Heiko Dietrich, Murray Elder, Adam Piggott +2
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{é}nizergues and the fifth author (ICALP2018) proved…