Sciweavers

Share
FSTTCS
2007
Springer
10 years 2 months ago
Efficient and Expressive Tree Filters
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...
Michael Benedikt, Alan Jeffrey
FSTTCS
2007
Springer
10 years 4 months ago
Strong Reductions and Isomorphism of Complete Sets
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...
Ryan C. Harkins, John M. Hitchcock, Aduri Pavan
FSTTCS
2007
Springer
10 years 4 months ago
Reductions to Graph Isomorphism
Jacobo Torán
FSTTCS
2007
Springer
10 years 4 months ago
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
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...
Anand Srivastav, Sören Werth
FSTTCS
2007
Springer
10 years 4 months ago
Solving Parity Games in Big Steps
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...
Sven Schewe
FSTTCS
2007
Springer
10 years 4 months ago
Program Analysis Using Weighted Pushdown Systems
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...
Thomas W. Reps, Akash Lal, Nicholas Kidd
FSTTCS
2007
Springer
10 years 4 months ago
Acceleration in Convex Data-Flow Analysis
Jérôme Leroux, Grégoire Sutre
books