Browse by People


Up a level
Export as [feed] RSS [feed] RSS 2.0 Short Author List
Number of items: 20.


Schewe, S ORCID: 0000-0002-9093-9518, Gainer, Paul and Hahn, Ernst Moritz
(2018) Accelerated Model Checking of Parametric Markov Chains. In: International Symposium on Automated Technology for Verification and Analysis, 2018-10-7 - 2018-10-10, Los Angeles.


Schewe, S ORCID: 0000-0002-9093-9518, Tang, Q ORCID: 0000-0002-9265-3011 and Zhanabekova, T
(2023) Deciding What Is Good-For-MDPs. In: CONCUR 2023.


Fearnley, J, Rabe, MN, Schewe, S ORCID: 0000-0002-9093-9518 and Zhang, L
(2016) Efficient approximation of optimal control for continuous-time Markov games. INFORMATION AND COMPUTATION, 247. pp. 106-129.


Gupta, A
(2016) Equilibria in Finite Games. PhD thesis, University of Liverpool.


Martin, RA ORCID: 0000-0002-7043-503X, Lamprou, I ORCID: 0000-0001-5337-7336 and Schewe, S ORCID: 0000-0002-9093-9518
(2016) Fast Two-Robot Disk Evacuation with Wireless Communication. In: International Symposium on Distributed Computing (DISC), 2016-9-26 - 2016-9-30, Paris, France.


Huang, C-H, Peled, DA, Schewe, S ORCID: 0000-0002-9093-9518 and Wang, F
(2016) A Game-Theoretic Foundation for the Maximum Software Resilience against Dense Errors. IEEE Transactions on Software Engineering, 42 (7). pp. 605-622.


Hahn, EM, Li, G, Schewe, S ORCID: 0000-0002-9093-9518, Turrini, A and Zhang, L
(2015) Lazy probabilistic model checking without determinisation. In: 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), 42 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, pp. 354-367. ISBN 9783939897910


Schewe, S ORCID: 0000-0002-9093-9518
(2020) Minimising good-for-games automata is NP-complete. .


Lamprou, I ORCID: 0000-0001-5337-7336
(2018) Mobility Problems in Distributed Search and Combinatorial Games. PhD thesis, University of Liverpool.


Hahn, EM, Perez, M, Schewe, S ORCID: 0000-0002-9093-9518, Somenzi, F, Trivedi, A and Wojtczak, D ORCID: 0000-0001-5560-0546
(2020) Model-free reinforcement learning for stochastic parity games. In: CONCUR 2020, 2020-9-1 - 2020-9-4.


Ehlers, R and Schewe, S ORCID: 0000-0002-9093-9518
(2022) Natural Colors of Infinite Words. In: FSTTCS.


Hahn, EM, Perez, Mateo, Schewe, S ORCID: 0000-0002-9093-9518, Somenzi, Fabio, Trivedi, Ashutosh and Wojtczak, DK ORCID: 0000-0001-5560-0546
(2019) Omega-Regular Objectives in Model-Free Reinforcement Learning. In: 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2019-4-6 - 2019-4-11, Prague, Czech Republic.


Schewe, S ORCID: 0000-0002-9093-9518, Weinert, A and Zimmermann, M ORCID: 0000-0002-8038-2453
(2018) Parity Games with Weights. In: CSL 2018.


Lamprou, I ORCID: 0000-0001-5337-7336, Martin, RA ORCID: 0000-0002-7043-503X and Schewe, S ORCID: 0000-0002-9093-9518
(2017) Perpetually Dominating Large Grids. In: 10th International Conference on Algorithms and Complexity, 2017-5-24 - 2017-5-26, Athens, Greece.


Husien, I, Schewe, S ORCID: 0000-0002-9093-9518 and Berthier, N ORCID: 0000-0002-0933-8193
(2017) PranCS: A protocol and discrete controller synthesis tool. .


Schewe, S ORCID: 0000-0002-9093-9518 and Zhang, L
(2018) Preface. In: CONCUR, 2018-9-4 - 2018-9-7, Beijing.


Alshareef, A, Berthier, N, Schewe, S ORCID: 0000-0002-9093-9518 and Huang, X ORCID: 0000-0001-6267-0366
(2022) Quantifying the Importance of Latent Features in Neural Networks. .


Hahn, EM, Perez, M, Schewe, S ORCID: 0000-0002-9093-9518, Somenzi, F, Trivedi, A and Wojtczak, D ORCID: 0000-0001-5560-0546
(2022) Recursive Reinforcement Learning. In: NeurIPS.


Hahn, EM, Perez, M, Schewe, S ORCID: 0000-0002-9093-9518, Somenzi, F, Trivedi, A and Wojtczak, D ORCID: 0000-0001-5560-0546
(2020) Reward Shaping for Reinforcement Learning with Omega-Regular Objectives.


Li, Y, Schewe, S ORCID: 0000-0002-9093-9518 and Vardi, MY
(2023) Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata. .

This list was generated on Sat Mar 23 03:35:48 2024 GMT.