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
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “The complexity of quantitative concurrent parity games,” in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, Miami, FL, United States, 2006, pp. 678–687.
View
| DOI