Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys. Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 2333-2349, SIAM, 2019. [doi]
@inproceedings{CzerwinskiDFJLP19,
title = {Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games},
author = {Wojciech Czerwinski and Laure Daviaud and Nathanaël Fijalkow and Marcin Jurdzinski and Ranko Lazic and Pawel Parys},
year = {2019},
doi = {10.1137/1.9781611975482.142},
url = {https://doi.org/10.1137/1.9781611975482.142},
researchr = {https://researchr.org/publication/CzerwinskiDFJLP19},
cites = {0},
citedby = {0},
pages = {2333-2349},
booktitle = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019},
editor = {Timothy M. Chan},
publisher = {SIAM},
isbn = {978-1-61197-548-2},
}