Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Wojciech Czerwinski' in GoogleThis author has not been identified. Look up 'Laure Daviaud' in GoogleThis author has not been identified. Look up 'Nathanaël Fijalkow' in GoogleThis author has not been identified. Look up 'Marcin Jurdzinski' in GoogleThis author has not been identified. Look up 'Ranko Lazic' in GoogleThis author has not been identified. Look up 'Pawel Parys' in Google

runs on WebDSL