ICALP
2007
Springer
14 years 5 months ago
2007
Springer
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic g...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. In this paper, we identify some issues in the interplay between practice and theory in cryptography, issues that have repeatedly appeared in different incarnations over ...