FSTTCS
2007
Springer
13 years 10 months ago
2007
Springer
FSTTCS
2007
Springer
13 years 10 months ago
2007
Springer
FSTTCS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...
FSTTCS
2007
Springer
14 years 29 days ago
2007
Springer
We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic polynomial-time reductions (SNP-reductions). We show the following resu...
FSTTCS
2007
Springer
14 years 29 days ago
2007
Springer
FSTTCS
2007
Springer
14 years 29 days ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
FSTTCS
2007
Springer
14 years 29 days ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
FSTTCS
2007
Springer
14 years 29 days ago
2007
Springer
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
FSTTCS
2007
Springer
14 years 29 days ago
2007
Springer
FSTTCS
2007
Springer
14 years 29 days ago
2007
Springer