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.

527 Publications


2012 | Published | Conference Paper | IST-REx-ID: 3341 | OA
Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. https://doi.org/10.1007/978-3-642-28729-9_18
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 | Published | Journal Article | IST-REx-ID: 3846 | OA
Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic ω regular games. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2011.05.002
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 

earlier version | 2012 | Published | Conference Paper | IST-REx-ID: 2955 | OA
Chatterjee, K., & Doyen, L. (2012). Partial-observation stochastic games: How to win when belief fails. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.28
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

earlier version | 2012 | Published | Conference Paper | IST-REx-ID: 10905 | OA
Chatterjee, K., Henzinger, M., Krinninger, S., & Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In 20th Annual European Symposium on Algorithms (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer. https://doi.org/10.1007/978-3-642-33090-2_27
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

earlier version | 2012 | Published | Conference Paper | IST-REx-ID: 10904 | OA
Chatterjee, K., Randour, M., & Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny & I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-32940-1_10
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 | Published | Journal Article | IST-REx-ID: 3157 | OA
Diaz Jr, L., Williams, R., Wu, J., Kinde, I., Hecht, J., Berlin, J., … Vogelstein, B. (2012). The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature. Nature Publishing Group. https://doi.org/10.1038/nature11219
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | PubMed | Europe PMC
 

2012 | Published | Journal Article | IST-REx-ID: 3260 | OA
Chatterjee, K., Reiter, J., & Nowak, M. (2012). Evolutionary dynamics of biological auctions. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2011.11.003
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | PubMed | Europe PMC
 

2012 | Published | Conference Paper | IST-REx-ID: 2936 | OA
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2012). Finite automata with time delay blocks. In Proceedings of the 10th ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380370
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

earlier version | 2011 | Published | Technical Report | IST-REx-ID: 5379 | OA
Chatterjee, K., & Henzinger, M. (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
 

earlier version | 2011 | Published | Technical Report | IST-REx-ID: 5380 | OA
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
 

earlier version | 2011 | Published | Technical Report | IST-REx-ID: 5382 | OA
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
 

earlier version | 2011 | Published | Technical Report | IST-REx-ID: 5384 | OA
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
 

earlier version | 2011 | Published | Technical Report | IST-REx-ID: 5387 | OA
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
 

2011 | Published | Conference Paper | IST-REx-ID: 3316 | OA
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2011). Specification-centered robustness. In 6th IEEE International Symposium on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE. https://doi.org/10.1109/SIES.2011.5953660
[Published Version] View | DOI | Download Published Version (ext.)
 

2011 | Submitted | Preprint | IST-REx-ID: 3338 | OA
Chatterjee, K. (n.d.). Bounded rationality in concurrent parity games. arXiv. https://doi.org/10.48550/arXiv.1107.2146
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2011 | Submitted | Preprint | IST-REx-ID: 3339 | OA
Chatterjee, K., De Alfaro, L., & Pritam, R. (n.d.). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. https://doi.org/10.48550/arXiv.1107.2132
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

earlier version | 2011 | Published | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee, K., Henzinger, M., Joglekar, M., & Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_21
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2011 | Published | Conference Paper | IST-REx-ID: 3343 | OA
Chatterjee, K., & Henzinger, M. (2011). Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States: SIAM. https://doi.org/10.1137/1.9781611973082.101
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2011 | Published | Conference Paper | IST-REx-ID: 3344
Chatterjee, K. (2011). Graph games with reachability objectives. In 5th International Workshop on Reachability Problems (Vol. 6945, pp. 1–1). Genoa, Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1
View | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3345 | OA
Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. https://doi.org/10.1007/978-3-642-22993-0_21
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed