STACS
2009
Springer
13 years 11 months ago
2009
Springer
STACS
2009
Springer
13 years 11 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
STACS
2009
Springer
13 years 11 months ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ω-regular languages. The class has two equivalent desc...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P(s) = sα . We give a ...