Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
452 Publications
2012 | Published | Journal Article | IST-REx-ID: 3254
The complexity of stochastic Müller games
K. Chatterjee, Information and Computation 211 (2012) 29–48.
View
| DOI
| Download None (ext.)
K. Chatterjee, Information and Computation 211 (2012) 29–48.
2012 | Published | Conference Paper | IST-REx-ID: 3255 | 
Games and Markov decision processes with mean payoff parity and energy parity objectives
K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.
[Submitted Version]
View
| Files available
| DOI
K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.
2012 | Published | Journal Article | IST-REx-ID: 3260 |
Evolutionary dynamics of biological auctions
K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012) 69–80.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012) 69–80.
2012 | Published | Journal Article | IST-REx-ID: 3314
Discounting and averaging in games across time scales
K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625.
View
| DOI
K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625.
2012 | Published | Conference Paper | IST-REx-ID: 3341 |
Robustness of structurally equivalent concurrent parity games
K. Chatterjee, in:, Springer, 2012, pp. 270–285.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, in:, Springer, 2012, pp. 270–285.
2012 | Published | Journal Article | IST-REx-ID: 3846 |
A survey of stochastic ω regular games
K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.
2012 | Published | Conference Paper | IST-REx-ID: 495 |
A Myhill Nerode theorem for automata with advice
A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.
[Published Version]
View
| Files available
| DOI
A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.
2012 | Published | Conference Paper | IST-REx-ID: 496 |
Interpretations in trees with countably many branches
A. Rabinovich, S. Rubin, in:, IEEE, 2012.
[Preprint]
View
| DOI
| Download Preprint (ext.)
A. Rabinovich, S. Rubin, in:, IEEE, 2012.
2012 | Published | Conference Paper | IST-REx-ID: 497 |
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.
2012 | Published | Technical Report | IST-REx-ID: 5377 |
Mean-payoff pushdown games
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
2012 | Published | Technical Report | IST-REx-ID: 5378 |
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.
2012 | Published | Conference Paper | IST-REx-ID: 10904
Strategy synthesis for multi-dimensional quantitative objectives
K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.
[Preprint]
View
| Files available
| DOI
| arXiv
K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.
2012 | Published | Conference Paper | IST-REx-ID: 10905 |
Polynomial-time algorithms for energy games with special weight structures
K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms – ESA 2012, Springer, 2012, pp. 301–312.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms – ESA 2012, Springer, 2012, pp. 301–312.
2011 | Published | Journal Article | IST-REx-ID: 3315 |
Timed parity games: Complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).
[Published Version]
View
| Files available
| DOI
K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).
2011 | Published | Conference Paper | IST-REx-ID: 3316 |
Specification-centered robustness
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–185.
[Published Version]
View
| DOI
| Download Published Version (ext.)
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–185.
2011 | Published | Preprint | IST-REx-ID: 3338 |
Bounded rationality in concurrent parity games
K. Chatterjee, ArXiv (2011) 1–51.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
K. Chatterjee, ArXiv (2011) 1–51.
2011 | Published | Preprint | IST-REx-ID: 3339 |
Magnifying lens abstraction for stochastic games with discounted and long-run average objectives
K. Chatterjee, L. De Alfaro, R. Pritam, ArXiv (2011).
[Preprint]
View
| Download Preprint (ext.)
| arXiv
K. Chatterjee, L. De Alfaro, R. Pritam, ArXiv (2011).
2011 | Published | Conference Paper | IST-REx-ID: 3342 |
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
K. Chatterjee, M.H. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, M.H. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276.
2011 | Published | Conference Paper | IST-REx-ID: 3343 |
Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification
K. Chatterjee, M.H. Henzinger, in:, SIAM, 2011, pp. 1318–1336.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
K. Chatterjee, M.H. Henzinger, in:, SIAM, 2011, pp. 1318–1336.
2011 | Published | Conference Paper | IST-REx-ID: 3344
Graph games with reachability objectives
K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1.
View
| DOI
K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1.