We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs signiļ¬cantly the state-of-the-art algorithm for this task [20]. Speciļ¬...
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and veriļ¬cation, optim...
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...
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 ...
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Pr...
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic g...