Conference or Workshop Item

Czerwiński, W., Daviaud, L., Fijalkow, N. , Jurdziński, M., Lazić, R. & Parys, P.view all authors (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. (pp. 2333-2349). Society for Industrial and Applied Mathematics. ISBN 978-1-61197-548-2