@incollection{Czerwi_ski_2019,
    doi = {10.1137/1.9781611975482.142},
    url = {https://doi.org/10.1137%2F1.9781611975482.142},
    year = {2019},
    month = {jan},
    publisher = {Society for Industrial and Applied Mathematics},
    pages = {2333--2349},
    author = {Wojciech Czerwi{\'{n}}ski and Laure Daviaud and Nathanaël Fijalkow and Marcin Jurdzi{\'{n}}ski and Ranko Lazi{\'{c}} and Pawe{{\l}} Parys},
    title = {Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games},
    booktitle = {Proceedings of the Thirtieth Annual {ACM}-{SIAM} Symposium on Discrete Algorithms}
}

@incollection{Czerwi_ski_2019, doi = {10.1137/1.9781611975482.142}, url = {https://doi.org/10.1137%2F1.9781611975482.142}, year = {2019}, month = {jan}, publisher = {Society for Industrial and Applied Mathematics}, pages = {2333--2349}, author = {Wojciech Czerwi{\'{n}}ski and Laure Daviaud and Nathanaël Fijalkow and Marcin Jurdzi{\'{n}}ski and Ranko Lazi{\'{c}} and Pawe{{\l}} Parys}, title = {Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games}, booktitle = {Proceedings of the Thirtieth Annual {ACM}-{SIAM} Symposium on Discrete Algorithms} }