STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We show that for infinite transition systems induced by cryptographic protocols in the Rusinowitch/Turuani style certain fundamental branching properties are decidable. ...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
STACS
2005
Springer
13 years 10 months ago
2005
Springer
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper we determine some limit distributions of pattern statistics in rational stochastic models, defined by means of nondeterministic weighted finite automata. ...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive m...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...