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.

457 Publications


2012 | Technical Report | IST-REx-ID: 5377 | OA
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 | OA
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 | 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.) | arXiv
 

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

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

2012 | Conference Paper | IST-REx-ID: 10905 | OA
Chatterjee, K., Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In Algorithms – ESA 2012 (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
 

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. Nature Publishing Group. https://doi.org/10.1038/nature11219
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 

2012 | 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.) | PubMed | Europe PMC
 

2011 | 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 | Conference Paper | IST-REx-ID: 3350
Chatterjee, K., & Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg & S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer. https://doi.org/10.1007/978-3-642-24310-3_11
View | DOI
 

2011 | Conference Paper | IST-REx-ID: 3351 | OA
Chatterjee, K., Doyen, L., & Singh, R. (2011). On memoryless quantitative objectives. In O. Owe, M. Steffen, & J. A. Telle (Eds.) (Vol. 6914, pp. 148–159). Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer. https://doi.org/10.1007/978-3-642-22953-4_13
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

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). ACM. https://doi.org/10.1145/1970398.1970404
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3349 | OA
Chatterjee, K., & Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.54.6
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

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
[Submitted Version] View | Files available | DOI
 

2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.
[Preprint] View | Download Preprint (ext.) | arXiv
 

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

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.
[Preprint] View | Download Preprint (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee, K., Henzinger, M. H., 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 | 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
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

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
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3348 | OA
Chatterjee, K., & Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer. https://doi.org/10.1145/1967701.1967734
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno & I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1
View | DOI
 

2011 | Conference Paper | IST-REx-ID: 3343 | OA
Chatterjee, K., & Henzinger, M. H. (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 | 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
[Submitted Version] 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 | Technical Report | IST-REx-ID: 5379 | OA
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 | OA
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 | 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
 

2011 | 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
 

2011 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee, K. (2011). Bounded rationality in concurrent parity games. arXiv. ArXiv.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33
[Submitted Version] View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5385 | OA
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: 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
 

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
[Submitted Version] 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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2011 | 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
 

2010 | Conference Paper | IST-REx-ID: 3858 | OA
Chatterjee, K., & Doyen, L. (2010). The complexity of partial-observation parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. https://doi.org/10.1007/978-3-642-16242-8_1
[Submitted Version] View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3856 | OA
Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_23
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee, K., & Henzinger, T. A. (Eds.). (2010). Formal modeling and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3866 | OA
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, & P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_36
[Submitted Version] View | Files available | DOI
 

2010 | Journal Article | IST-REx-ID: 3868 | OA
Chatterjee, K., De Alfaro, L., Majumdar, R., & Raman, V. (2010). Algorithms for game metrics. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-6(3:13)2010
[Published Version] View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., & Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_19
[Submitted Version] View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee, K., Horn, F., & Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_20
View | DOI
 

2010 | Conference Paper | IST-REx-ID: 3851 | OA
Chatterjee, K., & Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at the ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-642-14162-1_50
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2010 | Conference Paper | IST-REx-ID: 3860 | OA
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505
[Submitted Version] View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3864 | OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. https://doi.org/10.1007/978-3-642-14295-6_34
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2010 | Conference Paper | IST-REx-ID: 3865
Chatterjee, K., De Alfaro, L., Raman, V., & Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In D. Rosenblum & G. Taenzer (Eds.) (Vol. 6013, pp. 293–307). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. https://doi.org/10.1007/978-3-642-12029-9_21
View | DOI
 

2010 | Journal Article | IST-REx-ID: 3863 | OA
Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.09.006
[Submitted Version] View | Files available | DOI
 

2010 | Journal Article | IST-REx-ID: 3861 | OA
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2010). Strategy logic. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.07.004
[Submitted Version] View | Files available | DOI
 

2010 | Journal Article | IST-REx-ID: 3867 | OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-6(3:10)2010
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications