| No. |
Title |
Author |
Year |
| 1 |
Minimising Good-For-Games Automata Is NP-Complete |
Schewe, Sven |
2020 |
| 2 |
Model-Free Reinforcement Learning for Stochastic Parity Games |
Hahn, Ernst Moritz et al. |
2020 |
| 3 |
Front Matter, Table of Contents, Preface, Conference Organization |
Schewe, Sven et al. |
2018 |
| 4 |
LIPIcs, Volume 118, CONCUR'18, Complete Volume |
Schewe, Sven et al. |
2018 |
| 5 |
Maximum Rooted Connected Expansion |
Lamprou, Ioannis et al. |
2018 |
| 6 |
Parity Games with Weights |
Schewe, Sven et al. |
2018 |
| 7 |
Front Matter, Table of Contents, Preface, Organization, List of Authors |
Schewe, Sven et al. |
2017 |
| 8 |
LIPIcs, Volume 90, TIME'17, Complete Volume |
Schewe, Sven et al. |
2017 |
| 9 |
Lazy Probabilistic Model Checking without Determinisation |
Hahn, Ernst Moritz et al. |
2015 |
| 10 |
Bounded Satisfiability for PCTL |
Bertrand, Nathalie et al. |
2012 |
| 11 |
Efficient Approximation of Optimal Control for Continuous-Time Markov Games |
Fearnley, John et al. |
2011 |
| 12 |
Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete |
Schewe, Sven |
2010 |
| 13 |
Software Synthesis is Hard -- and Simple |
Schewe, Sven |
2010 |
| 14 |
Büchi Complementation Made Tight |
Schewe, Sven |
2009 |
