Strategy complexity of parity objectives in countable MDPs por Kiefer, S, Mayr, R, Shirmohammadi, M, Totzke, P

A polynomial-time algorithm for reachability in branching VASS in dimension one por Göller, S, Haase, C, Lazic, R, Totzke, P

Strategy complexity of reachability in countable stochastic 2-player games por Kiefer, S, Mayr, R, Shirmohammadi, M, Totzke, P

Büchi objectives in countable MDPs por Kiefer, S, Mayr, R, Shirmohammadi, M, Totzke, P

Transience in countable MDPs por Kiefer, SM, Mayr, R, Shirmohammadi, M, Totzke, P

The reachability problem for two-dimensional vector addition systems with states por Blondin, M, Englert, M, Finkel, A, Göller, S, Haase, C, Lazic, R, McKenzie, P, Totzke, P