Please note that IST 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.

344 Publications


2013 | Conference Paper | IST-REx-ID: 2446   OA
Chatterjee, K., Gaiser, A., & Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_37
View | DOI | Download (ext.) | arXiv
 

2013 | Conference Paper | IST-REx-ID: 2238
Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_17
View | DOI
 

2013 | Journal Article | IST-REx-ID: 3116
Chatterjee, K., De Alfaro, L., Faella, M., Majumdar, R., & Raman, V. (2013). Code aware resource management. Formal Methods in System Design, 42(2), 142–174. https://doi.org/10.1007/s10703-012-0170-4
View | DOI
 

2013 | Technical Report | IST-REx-ID: 5403   OA
Chatterjee, K., & Ibsen-Jensen, R. (2013). Qualitative analysis of concurrent mean-payoff games. IST Austria. https://doi.org/10.15479/AT:IST-2013-126-v1-1
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 1374   OA
Chatterjee, K., & Fijalkow, N. (2013). Infinite-state games with finitary conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.181
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2000   OA
Reiter, J., Božić, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification (Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_6
View | Files available | DOI | Download (ext.) | arXiv
 

2013 | Journal Article | IST-REx-ID: 2858   OA
Reiter, J., Božić, I., Allen, B., Chatterjee, K., & Nowak, M. (2013). The effect of one additional driver mutation on tumor progression. Evolutionary Applications, 6(1), 34–45. https://doi.org/10.1111/eva.12020
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2295   OA
Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.165
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
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
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
View | Files available | DOI
 

2012 | 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
View | Files available | DOI | Download (ext.) | arXiv
 

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

2012 | Journal Article | IST-REx-ID: 3314
Chatterjee, K., & Majumdar, R. (2012). Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science, 23(3), 609–625. https://doi.org/10.1142/S0129054112400308
View | DOI
 

2012 | Conference Paper | IST-REx-ID: 496   OA
Rabinovich, A., & Rubin, S. (2012). Interpretations in trees with countably many branches. Presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.65
View | DOI | Download (ext.)
 

2012 | Conference Paper | IST-REx-ID: 2715
Chatterjee, K., Joglekar, M., & Shah, N. (2012). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Vol. 18, pp. 461–473). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461
View | Files available | DOI
 

2012 | 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, 78(2), 394–413. https://doi.org/10.1016/j.jcss.2011.05.002
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 2848   OA
Chatterjee, K., Zufferey, D., & Nowak, M. (2012). Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology, 301, 161–173. https://doi.org/10.1016/j.jtbi.2012.02.021
View | DOI | Download (ext.) | PubMed | Europe PMC
 

2012 | Conference Paper | IST-REx-ID: 2956
Chatterjee, K., & Velner, Y. (2012). Mean payoff pushdown games. 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.30
View | Files available | DOI
 

2012 | 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
View | Files available | DOI | Download (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 3252   OA
Chatterjee, K., & Raman, V. (2012). Synthesizing protocols for digital contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_11
View | DOI | Download (ext.)
 

2012 | Conference Paper | IST-REx-ID: 497   OA
Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2012.167
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
View | Files available | DOI
 

2012 | 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, 486(7404), 537–540. https://doi.org/10.1038/nature11219
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 

2012 | Conference Paper | IST-REx-ID: 2957   OA
Chatterjee, K., & Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. 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.29
View | Files available | DOI | Download (ext.) | arXiv
 

2012 | Journal Article | IST-REx-ID: 3260   OA
Chatterjee, K., Reiter, J., & Nowak, M. (2012). Evolutionary dynamics of biological auctions. Theoretical Population Biology, 81(1), 69–80. https://doi.org/10.1016/j.tpb.2011.11.003
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 

2012 | Journal Article | IST-REx-ID: 2972   OA
Chatterjee, K., & Doyen, L. (2012). Energy parity games. Theoretical Computer Science, 458, 49–60. https://doi.org/10.1016/j.tcs.2012.07.038
View | Files available | DOI | arXiv
 

2012 | Conference Paper | IST-REx-ID: 3165
Chatterjee, K., & Henzinger, M. (2012). An O(n2) time algorithm for alternating Büchi games. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1386–1399). Kyoto, Japan: SIAM. https://doi.org/10.1137/1.9781611973099.109
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 3254
Chatterjee, K. (2012). The complexity of stochastic Müller games. Information and Computation, 211, 29–48. https://doi.org/10.1016/j.ic.2011.11.004
View | DOI | Download (ext.)
 

2012 | Conference Paper | IST-REx-ID: 2916   OA
Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface Simulation Distances. In Electronic Proceedings in Theoretical Computer Science (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. https://doi.org/10.4204/EPTCS.96.3
View | Files available | DOI | Download (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 2947   OA
Chatterjee, K., Chmelik, M., & Majumdar, R. (2012). Equivalence of games with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399). Presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India: Springer. https://doi.org/10.1007/978-3-642-33386-6_30
View | DOI | Download (ext.)
 

2012 | Journal Article | IST-REx-ID: 3128   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design, 43(2), 268–284. https://doi.org/10.1007/s10703-012-0164-2
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 3135   OA
Brázdil, B., Chatterjee, K., Kučera, A., & Novotny, P. (2012). Efficient controller synthesis for consumption games with multiple resource types (Vol. 7358, pp. 23–38). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer. https://doi.org/10.1007/978-3-642-31424-7_8
View | DOI | Download (ext.)
 

2012 | Conference Paper | IST-REx-ID: 495   OA
Kruckman, A., Rubin, S., Sheridan, J., & Zax, B. (2012). A Myhill Nerode theorem for automata with advice. In Proceedings GandALF 2012 (Vol. 96, pp. 238–246). Napoli, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.96.18
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 3255   OA
Chatterjee, K., & Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-25929-6_3
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 | Preprint | IST-REx-ID: 3338
Chatterjee, K. (2011). Bounded rationality in concurrent parity games. ArXiv. ArXiv.
View | Files available | Download (ext.) | arXiv
 

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
View | Files available | DOI
 

2011 | 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
View | Files available | DOI | Download (ext.) | arXiv
 

2011 | Preprint | IST-REx-ID: 3339   OA
Chatterjee, K., De Alfaro, L., & Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. ArXiv. ArXiv.
View | Download (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3365   OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24
View | Files available | DOI
 

2011 | Journal Article | IST-REx-ID: 3315
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science, 7(4). https://doi.org/10.2168/LMCS-7(4:8)2011
View | Files available | DOI
 

2011 | 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
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3346   OA
Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.10
View | DOI | Download (ext.)
 

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
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
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3366   OA
Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3361   OA
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
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3347   OA
Chatterjee, K., & Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_16
View | DOI | Download (ext.) | arXiv
 

2011 | Journal Article | IST-REx-ID: 3354
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL), 12(4). https://doi.org/10.1145/1970398.1970404
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed