3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DM2013★ 3 cited
Logspace computations in graph products
Volker Diekert, Jonathan Kausch
We consider three important and well-studied algorithmic problems in group theory: the word, geodesic, and conjugacy problem. We show transfer results from individual groups to gra…
math.GR2012
Logspace Computations in Coxeter Groups and Graph Groups
Volker Diekert, Jonathan Kausch, Markus Lohrey
Computing normal forms in groups (or monoids) is in general harder than solving the word problem (equality testing). However, normal form computation has a much wider range of appl…