2 citations · 9 across the 12 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.GR2017
Knapsack Problems for Wreath Products
Moses Ganardi, Daniel König, Markus Lohrey +1
In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns ou…
cs.CC2017
A universal tree balancing theorem
Moses Ganardi, Markus Lohrey
We present a general framework for balancing expressions (terms) in form of so called tree straight-line programs. The latter can be seen as circuits over the free term algebra ext…
cs.FL2017
Automata theory on sliding windows
Moses Ganardi, Danny Hucke, Daniel König +2
In a recent paper we analyzed the space complexity of streaming algorithms whose goal is to decide membership of a sliding window to a fixed language. For the class of regular lang…