The goal of the thesis is to leverage fast graph algorithms and modern
a...
We present a faster symbolic algorithm for the following central problem...
The fundamental model-checking problem, given as input a model and a
spe...
Solving parity games, which are equivalent to modal μ-calculus model
che...
In the k-center clustering problem, we are given a set of n points in a
...
We consider planning problems for graphs, Markov decision processes (MDP...