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.
77 Publications
2013 | Technical Report | IST-REx-ID: 5404 | 
Chatterjee, K., & Ibsen-Jensen, R. (2013). The complexity of ergodic games. IST Austria. https://doi.org/10.15479/AT:IST-2013-127-v1-1
[Published Version]
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5405 |
Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2013). Perfect-information stochastic mean-payoff parity games. IST Austria. https://doi.org/10.15479/AT:IST-2013-128-v1-1
[Published Version]
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5409 |
Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2013). Edit distance for timed automata. IST Austria. https://doi.org/10.15479/AT:IST-2013-144-v1-1
[Published Version]
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5406 |
Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL Fragments. IST Austria. https://doi.org/10.15479/AT:IST-2013-130-v1-1
[Published Version]
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5408 |
Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2013). The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria. https://doi.org/10.15479/AT:IST-2013-141-v1-1
[Published Version]
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5410 |
Ahmed, U., Chatterjee, K., & Gulwani, S. (2013). Automatic generation of alternative starting positions for traditional board games. IST Austria. https://doi.org/10.15479/AT:IST-2013-146-v1-1
[Published Version]
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 6440 |
Henzinger, T. A., Payer, H., & Sezgin, A. (2013). Replacing competition with cooperation to achieve scalable lock-free FIFO queues . IST Austria. https://doi.org/10.15479/AT:IST-2013-124-v1-1
[Published Version]
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5377 |
Chatterjee, K., & Velner, Y. (2012). Mean-payoff pushdown games. IST Austria. https://doi.org/10.15479/AT:IST-2012-0002
[Published Version]
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5378 |
Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations. IST Austria. https://doi.org/10.15479/AT:IST-2012-0001
[Published Version]
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5396 |
Korc, F., Kolmogorov, V., & Lampert, C. (2012). Approximating marginals using discrete energy minimization. IST Austria. https://doi.org/10.15479/AT:IST-2012-0003
[Published Version]
View
| Files available
| 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
2011 | Technical Report | IST-REx-ID: 5382 |
Chatterjee, K. (2011). Robustness of structurally equivalent concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0006
[Published Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5385 |
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003
[Published Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5386 |
Chen, C., Freedman, D., & Lampert, C. (2011). Enforcing topological constraints in random field image segmentation. IST Austria. https://doi.org/10.15479/AT:IST-2011-0002
[Published Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5383 |
Wies, T., Muñiz, M., & Kuncak, V. (2011). On an efficient decision procedure for imperative tree data structures. IST Austria. https://doi.org/10.15479/AT:IST-2011-0005
[Published Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5384 |
Chatterjee, K., & Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria. https://doi.org/10.15479/AT:IST-2011-0004
[Published Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5387 |
Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2011-0001
[Published Version]
View
| Files available
| DOI
2010 | Technical Report | IST-REx-ID: 5388 |
Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. https://doi.org/10.15479/AT:IST-2010-0004
[Published Version]
View
| Files available
| DOI