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.

340 Publications


2013 | Conference Paper | IST-REx-ID: 1374   OA
K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy, 2013, vol. 23, pp. 181–196.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5410
U. Ahmed, K. Chatterjee, and S. Gulwani, Automatic generation of alternative starting positions for traditional board games. IST Austria, 2013.
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2000   OA
J. Reiter, I. Božić, K. Chatterjee, and M. Nowak, “TTP: Tool for tumor progression,” in Proceedings of 25th Int. Conf. on Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044, pp. 101–106.
View | Files available | DOI | Download (ext.) | arXiv
 

2013 | Journal Article | IST-REx-ID: 2858   OA
J. Reiter, I. Božić, B. Allen, K. Chatterjee, and M. Nowak, “The effect of one additional driver mutation on tumor progression,” Evolutionary Applications, vol. 6, no. 1, pp. 34–45, 2013.
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2295   OA
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5408
K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria, 2013.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 2715   OA
K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 2012, vol. 18, pp. 461–473.
View | Files available | DOI
 

2012 | Technical Report | IST-REx-ID: 5377
K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria, 2012.
View | Files available | DOI
 

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

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

2012 | Journal Article | IST-REx-ID: 3314
K. Chatterjee and R. Majumdar, “Discounting and averaging in games across time scales,” International Journal of Foundations of Computer Science, vol. 23, no. 3, pp. 609–625, 2012.
View | DOI
 

2012 | Conference Paper | IST-REx-ID: 496   OA
A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012.
View | DOI | Download (ext.)
 

2012 | Journal Article | IST-REx-ID: 3846   OA
K. Chatterjee and T. A. Henzinger, “A survey of stochastic ω regular games,” Journal of Computer and System Sciences, vol. 78, no. 2, pp. 394–413, 2012.
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 2848   OA
K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations with different learners,” Journal of Theoretical Biology, vol. 301, pp. 161–173, 2012.
View | DOI | Download (ext.) | PubMed | Europe PMC
 

2012 | Conference Paper | IST-REx-ID: 2956
K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 3341   OA
K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.
View | Files available | DOI | Download (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 3252   OA
K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.
View | DOI | Download (ext.)
 

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: 3255
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 | DOI
 

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
 

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   OA
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: 3316
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
 

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: 3342   OA
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 | DOI | Download (ext.) | arXiv
 

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: 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.)
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed