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.

343 Publications


2012 | Conference Paper | IST-REx-ID: 497   OA
K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.
View | Files available | DOI
 

2012 | Technical Report | IST-REx-ID: 5378
K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating refinement relations. IST Austria, 2012.
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 3157   OA
L. Diaz Jr et al., “The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers,” Nature, vol. 486, no. 7404, pp. 537–540, 2012.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 

2012 | Conference Paper | IST-REx-ID: 2957   OA
K. Chatterjee and M. Tracol, “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 , 2012.
View | Files available | DOI | Download (ext.) | arXiv
 

2012 | Journal Article | IST-REx-ID: 3260   OA
K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological auctions,” Theoretical Population Biology, vol. 81, no. 1, pp. 69–80, 2012.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 

2012 | Journal Article | IST-REx-ID: 2972   OA
K. Chatterjee and L. Doyen, “Energy parity games,” Theoretical Computer Science, vol. 458, pp. 49–60, 2012.
View | Files available | DOI | arXiv
 

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

2012 | Journal Article | IST-REx-ID: 3254
K. Chatterjee, “The complexity of stochastic Müller games,” Information and Computation, vol. 211, pp. 29–48, 2012.
View | DOI | Download (ext.)
 

2012 | Conference Paper | IST-REx-ID: 2916   OA
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.
View | Files available | DOI | Download (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 2947   OA
K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic uncertainty and partial observation games,” presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 385–399.
View | DOI | Download (ext.)
 

2012 | Journal Article | IST-REx-ID: 3128   OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation stochastic parity games,” Formal Methods in System Design, vol. 43, no. 2, pp. 268–284, 2012.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 3135   OA
B. Brázdil, K. Chatterjee, A. Kučera, and P. Novotny, “Efficient controller synthesis for consumption games with multiple resource types,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 23–38.
View | DOI | Download (ext.)
 

2012 | Conference Paper | IST-REx-ID: 495   OA
A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in Proceedings GandALF 2012, Napoli, Italy, 2012, vol. 96, pp. 238–246.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 3255   OA
K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol. 7119, pp. 37–46.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3357
K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.
View | DOI
 

2011 | Preprint | IST-REx-ID: 3338
K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv. ArXiv, pp. 1–51, 2011.
View | Files available | Download (ext.) | arXiv
 

2011 | Technical Report | IST-REx-ID: 5384
K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3345   OA
K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218.
View | Files available | DOI | Download (ext.) | arXiv
 

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

2011 | Conference Paper | IST-REx-ID: 3365   OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.
View | Files available | DOI
 

2011 | Journal Article | IST-REx-ID: 3315
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5380   OA
K. Chatterjee, Bounded rationality in concurrent parity games. IST Austria, 2011.
View | Files available | DOI
 

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

2011 | Technical Report | IST-REx-ID: 5385
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5381
K. Chatterjee and L. Doyen, Partial-observation stochastic games: How to win when belief fails. IST Austria, 2011.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3366   OA
P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3361   OA
P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3347   OA
K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 216–226.
View | DOI | Download (ext.) | arXiv
 

2011 | Journal Article | IST-REx-ID: 3354
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5379
K. Chatterjee and M. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3342
K. Chatterjee, M. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.
View | Files available | DOI | Download (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3316   OA
R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered robustness,” in 6th IEEE International Symposium on Industrial and Embedded Systems, Vasteras, Sweden, 2011, pp. 176–185.
View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3343   OA
K. Chatterjee and M. Henzinger, “Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, USA, 2011, pp. 1318–1336.
View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3348   OA
K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA, 2011, pp. 221–230.
View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3350
K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.
View | DOI
 

2011 | Technical Report | IST-REx-ID: 5382
K. Chatterjee, Robustness of structurally equivalent concurrent parity games. IST Austria, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5387
K. Chatterjee and L. Doyen, Energy and mean-payoff parity Markov decision processes. IST Austria, 2011.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3344
K. Chatterjee, “Graph games with reachability objectives,” presented at the RP: Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.
View | DOI
 

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

2011 | Conference Paper | IST-REx-ID: 3349   OA
K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86.
View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3351   OA
K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159.
View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3356
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3852   OA
K. Chatterjee and R. Majumdar, “Discounting in games across time scales,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2010, vol. 25, pp. 22–29.
View | Files available | DOI | arXiv
 

2010 | Conference Paper | IST-REx-ID: 489   OA
J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised strategies? ,” in Proceedings of GandALF 2010, Minori, Amalfi Coast, Italy, 2010, vol. 25, pp. 30–39.
View | DOI | Download (ext.)
 

2010 | Conference Paper | IST-REx-ID: 3857
K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words: decidability and undecidability results,” presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3864
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.
View | Files available | DOI | Download (ext.)
 

2010 | Conference Paper | IST-REx-ID: 3853   OA
K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3865
K. Chatterjee, L. De Alfaro, V. Raman, and C. Sánchez, “Analyzing the impact of change in multi-threaded programs,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 293–307.
View | DOI
 

2010 | Conference Paper | IST-REx-ID: 3860   OA
K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3858   OA
K. Chatterjee and L. Doyen, “The complexity of partial-observation parity games,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 1–14.
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed