Items where Author is "Jurdziński, M."
Article
Daviaud, L. 
ORCID: 0000-0002-9220-7118, Jurdziński, M. & Thejaswini, K. S. (2020).
The Strahler number of a parity game.
LIPIcs : Leibniz International Proceedings in Informatics, 168,
article number 123.
doi: 10.4230/LIPIcs.ICALP.2020.123
Conference or Workshop Item
Czerwiński, W., Daviaud, L., Fijalkow, N. , Jurdziński, M., Lazić, R. & Parys, P. (2019). Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. ACM - SIAM Symposium on Discrete Algorithms, 6 - 9 January 2019, San Diego, California, USA.
Daviaud, L. ORCID: 0000-0002-9220-7118, Jurdziński, M. & Lehtinen, K. (2019).
Alternating Weak Automata from Universal Trees.
Paper presented at the 30th International Conference on Concurrency Theory, 26-31 Aug 2019, Amsterdam, the Netherlands.
doi: 10.4230/LIPIcs.CONCUR.2019.14
Daviaud, L. ORCID: 0000-0002-9220-7118, Jurdziński, M. & Lazić, R. (2018).
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games.
In:
LICS '18 Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science.
Daviaud, L., Jurdziński, M., Lazić, R. , Mazowiecki, F., Pérez, G. A. & Worrell, J. (2018). When is Containment Decidable for Probabilistic Automata? In: 45th International Colloquium on Automata, Languages, and Programming. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), 9-13 July, Prague, Czech Republic.