Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
STACS
2009
Springer
10 years 8 months ago
Forward Analysis for WSTS, Part I: Completions
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...
Alain Finkel, Jean Goubault-Larrecq
STACS
2009
Springer
10 years 8 months ago
A Complexity Dichotomy for Partition Functions with Mixed Signs
Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Ma...
STACS
2009
Springer
10 years 8 months ago
Randomness on Computable Probability Spaces - A Dynamical Point of View
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, ...
Péter Gács, Mathieu Hoyrup, Cristoba...
STACS
2009
Springer
10 years 8 months ago
Weak MSO with the Unbounding Quantifier
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...
Mikolaj Bojanczyk
STACS
2009
Springer
10 years 8 months ago
Enumerating Homomorphisms
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...
Andrei A. Bulatov, Víctor Dalmau, Martin Gr...
STACS
2009
Springer
10 years 8 months ago
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
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...
Daniel Kirsten, Sylvain Lombardy
STACS
2009
Springer
10 years 8 months ago
Quantum Query Complexity of Multilinear Identity Testing
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...
Vikraman Arvind, Partha Mukhopadhyay
STACS
2009
Springer
10 years 8 months ago
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
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...
Tomás Ebenlendr, Jiri Sgall
STACS
2009
Springer
10 years 8 months ago
Nonclairvoyant Speed Scaling for Flow and Energy
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 ...
Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei ...
books