Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
1 Publication
2006 |
Published |
Conference Paper |
IST-REx-ID: 3890
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2006). The complexity of quantitative concurrent parity games. In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (pp. 678–687). Miami, FL, United States: SIAM. https://doi.org/10.1145/1109557.1109631
View
| DOI