3 citations · 3 across the 1 of their papers we have counts for
3 papers
cs.FL2020★ 3 cited
Computational Complexity of Synchronization under Regular Commutative Constraints
Stefan Hoffmann
Here we study the computational complexity of the constrained synchronization problem for the class of regular commutative constraint languages. Utilizing a vector representation o…
cs.FL2020
State Complexity Bounds for the Commutative Closure of Group Languages
Stefan Hoffmann
In this work we construct an automaton for the commutative closure of a given regular group language. The number of states of the resulting automaton is bounded by the number of st…
cs.DS2016
Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels
Stefan Hoffmann, Egon Wanke
This paper examines the problem of assigning a transmission power to every node of a wireless sensor network. The goal is to minimize the total power consumption while ensuring tha…