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.
470 Publications
2012 |Published| Conference Paper | IST-REx-ID: 497 |
Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–82, doi:10.4230/LIPIcs.CSL.2012.167.
[Published Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 3165 |
Chatterjee, Krishnendu, and Monika H. Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–99, doi:10.1137/1.9781611973099.109.
View
| Files available
| DOI
| Download None (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 2956
Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280438, IEEE, 2012, doi:10.1109/LICS.2012.30.
View
| Files available
| DOI
2012 |Published| Technical Report | IST-REx-ID: 5377 |
Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012, doi:10.15479/AT:IST-2012-0002.
[Published Version]
View
| Files available
| DOI
2012 |Published| Technical Report | IST-REx-ID: 5378 |
Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. IST Austria, 2012, doi:10.15479/AT:IST-2012-0001.
[Published Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 2955 |
Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280436, IEEE, 2012, doi:10.1109/LICS.2012.28.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 3341 |
Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. Vol. 7213, Springer, 2012, pp. 270–85, doi:10.1007/978-3-642-28729-9_18.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 2957 |
Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280437, IEEE, 2012, doi:10.1109/LICS.2012.29.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 10905 |
Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithms – ESA 2012, vol. 7501, Springer, 2012, pp. 301–12, doi:10.1007/978-3-642-33090-2_27.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Journal Article | IST-REx-ID: 3157 |
Diaz Jr, Luis, et al. “The Molecular Evolution of Acquired Resistance to Targeted EGFR Blockade in Colorectal Cancers.” Nature, vol. 486, no. 7404, Nature Publishing Group, 2012, pp. 537–40, doi:10.1038/nature11219.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 |Published| Journal Article | IST-REx-ID: 3260 |
Chatterjee, Krishnendu, et al. “Evolutionary Dynamics of Biological Auctions.” Theoretical Population Biology, vol. 81, no. 1, Academic Press, 2012, pp. 69–80, doi:10.1016/j.tpb.2011.11.003.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2011 |Published| Conference Paper | IST-REx-ID: 3316 |
Bloem, Roderick, et al. “Specification-Centered Robustness.” 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–85, doi:10.1109/SIES.2011.5953660.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3350
Chatterjee, Krishnendu, and Ritankar Majumdar. Minimum Attention Controller Synthesis for Omega Regular Objectives. Edited by Uli Fahrenberg and Stavros Tripakis, vol. 6919, Springer, 2011, pp. 145–59, doi:10.1007/978-3-642-24310-3_11.
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3351 |
Chatterjee, Krishnendu, et al. On Memoryless Quantitative Objectives. Edited by Olaf Owe et al., vol. 6914, Springer, 2011, pp. 148–59, doi:10.1007/978-3-642-22953-4_13.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Journal Article | IST-REx-ID: 3354
Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4, 28, ACM, 2011, doi:10.1145/1970398.1970404.
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3349 |
Chatterjee, Krishnendu, and Nathanaël Fijalkow. A Reduction from Parity Games to Simple Stochastic Games. Vol. 54, EPTCS, 2011, pp. 74–86, doi:10.4204/EPTCS.54.6.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3365 |
Chatterjee, Krishnendu, et al. QUASY: Quantitative Synthesis Tool. Vol. 6605, Springer, 2011, pp. 267–71, doi:10.1007/978-3-642-19835-9_24.
[Submitted Version]
View
| Files available
| DOI
2011 |Submitted| Preprint | IST-REx-ID: 3363 |
Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic Automata on Infinite Words. ArXiv.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2011 |Published| Journal Article | IST-REx-ID: 3315 |
Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science, vol. 7, no. 4, International Federation of Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.
[Published Version]
View
| Files available
| DOI
2011 |Published| Preprint | IST-REx-ID: 3339 |
Chatterjee, Krishnendu, et al. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv, ArXiv, 2011.
[Preprint]
View
| Download Preprint (ext.)
| arXiv