1 citations · 1 across the 3 of their papers we have counts for
Showing math.GRShow all
3 papers · 1 filter
math.GR2012
Efficient algorithms for highly compressed data: The Word Problem in Generalized Higman Groups is in P
Jürn Laun
This paper continues the 2012 STACS contribution by Diekert, Ushakov, and the author. We extend the results published in the proceedings in two ways. First, we show that the data s…
math.GR2011
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P
Volker Diekert, Jürn Laun, Alexander Ushakov
Power circuits are data structures which support efficient algorithms for highly compressed integers. Using this new data structure it has been shown recently by Myasnikov, Ushakov…
math.GR2009★ 1 cited
On Computing Geodesics in Baumslag-Solitar Groups
Volker Diekert, Jürn Laun
We introduce the peak normal form of elements of the Baumslag-Solitar groups BS(p,q). This normal form is very close to the length-lexicographical normal form, but more symmetric.…