Sciweavers

FSTTCS
2006
Springer
14 years 3 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
FSTTCS
2006
Springer
14 years 3 months ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys
FSTTCS
2006
Springer
14 years 3 months ago
Some Results on Average-Case Hardness Within the Polynomial Hierarchy
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
FSTTCS
2006
Springer
14 years 3 months ago
The Meaning of Ordered SOS
Structured Operational Semantics (SOS) is a popular method for defining semantics by means of deduction rules. An important feature of deduction rules, or simply SOS rules, are neg...
Mohammad Reza Mousavi, Iain C. C. Phillips, Michel...
FSTTCS
2006
Springer
14 years 3 months ago
Game Semantics for Higher-Order Concurrency
Abstract. We describe a denotational (game) semantics for a call-byvalue functional language with multiple threads of control, which may communicate values of general type on local...
James Laird
FSTTCS
2006
Springer
14 years 3 months ago
The Anatomy of Innocence Revisited
We refine previous analyses of Hyland-Ong game semantics and its relation to - and
Russell Harmer, Olivier Laurent
FSTTCS
2006
Springer
14 years 3 months ago
Coresets for Discrete Integration and Clustering
Given a set P of n points on the real line and a (potentially innite) family of functions, we investigate the problem of nding a small (weighted) subset S P, such that for any f ...
Sariel Har-Peled
FSTTCS
2006
Springer
14 years 3 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
FSTTCS
2006
Springer
14 years 3 months ago
On Reduction Criteria for Probabilistic Reward Models
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
Marcus Größer, Gethin Norman, Christel ...