Author:
Hausmann Daniel,Piterman Nir
Publisher
Springer Nature Switzerland
Reference27 articles.
1. Calude, C., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: Theory of Computing, STOC 2017, pp. 252–263. ACM (2017)
2. Chatterjee, K., Henzinger, M.: An O(n$${}^{{2}}$$) time algorithm for alternating büchi games. In: SODA, pp. 1386–1399. SIAM (2012)
3. Lecture Notes in Computer Science;T Colcombet,2019
4. Czerwinski, W., Daviaud, L., Fijalkow, N., Jurdzinski, M., Lazic, R., Parys, P.: Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. In: SODA, pp. 2333–2349. SIAM (2019)
5. Emerson, E.A., Jutla, C.: The complexity of tree automata and logics of programs. SIAM J. Comput. 29(1), 132–158 (1999)