FSTTCS
2010
Springer
13 years 9 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
FSTTCS
2010
Springer
13 years 9 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
FSTTCS
2010
Springer
13 years 10 months ago
2010
Springer
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...
FSTTCS
2010
Springer
13 years 10 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
FSTTCS
2010
Springer
13 years 10 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
FSTTCS
2010
Springer
13 years 10 months ago
2010
Springer
This article is a survey of developments in algorithmic convex geometry over the past decade. These include algorithms for sampling, optimization, integration, rounding and learni...
FSTTCS
2010
Springer
13 years 10 months ago
2010
Springer
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
FSTTCS
2010
Springer
13 years 10 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
FSTTCS
2010
Springer
13 years 10 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
FSTTCS
2010
Springer
13 years 10 months ago
2010
Springer
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...