163
click to vote
STACS
2016
Springer
10 years 3 months ago
2016
Springer
We prove that for every positive integer r and for every graph class G of bounded expansion, the r-Dominating Set problem admits a linear kernel on graphs from G. Moreover, in the...
184
click to vote
STACS
2016
Springer
10 years 3 months ago
2016
Springer
The quantitative verification of Probabilistic Automata (PA) is undecidable in general. Unary PA are a simpler model where the choice of action is fixed. Still, the quantitative...
182
click to vote
STACS
2016
Springer
10 years 3 months ago
2016
Springer
We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution D over [n] and a proper...
184
click to vote
STACS
2016
Springer
10 years 3 months ago
2016
Springer
John Tromp introduced the so-called ’binary lambda calculus’ as a way to encode lambda terms in terms of 0−1-strings. Later, Grygiel and Lescanne conjectured that the number...