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.
459 Publications
2011 | Conference Paper | IST-REx-ID: 3361 |
Cerny, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee, K., Henzinger, T. A., & Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_17
View
| DOI
2011 | Technical Report | IST-REx-ID: 5379 |
Chatterjee, K., & Henzinger, M. H. (2011). An O(n2) time algorithm for alternating Büchi games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0009
[Published Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5381 |
Chatterjee, K., & Doyen, L. (2011). Partial-observation stochastic games: How to win when belief fails. IST Austria. https://doi.org/10.15479/AT:IST-2011-0007
[Published Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5380 |
Chatterjee, K. (2011). Bounded rationality in concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0008
[Published Version]
View
| Files available
| DOI