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


2014 | Journal Article | IST-REx-ID: 2141
K. Chatterjee and M. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3, 2014.
View | Files available | DOI | Download (ext.)
 

2014 | Journal Article | IST-REx-ID: 2211
K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2, 2014.
View | Files available | DOI | Download (ext.) | arXiv
 

2014 | Journal Article | IST-REx-ID: 2038   OA
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4, p. 27, 2014.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 1853
S. Jha, S. Tripakis, S. Seshia, and K. Chatterjee, “Game theoretic secure localization in wireless sensor networks,” presented at the IOT: Internet of Things, Cambridge, USA, 2014, pp. 85–90.
View | DOI
 

2014 | Journal Article | IST-REx-ID: 1884
D. Landau et al., “Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples,” Blood, vol. 124, no. 21, pp. 1952–1952, 2014.
View | Download (ext.)
 

2014 | Technical Report | IST-REx-ID: 5420   OA
K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff games. IST Austria, 2014.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2027   OA
T. Brázdil et al., “Verification of markov decision processes using learning algorithms,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 98–114.
View | DOI | Download (ext.)
 

2014 | Journal Article | IST-REx-ID: 2039   OA
K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” PLoS Computational Biology, vol. 10, no. 9, 2014.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2053   OA
H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 249–265.
View | DOI | Download (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2212
K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5413
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5418
K. Chatterjee and L. Doyen, Games with a weak adversary. IST Austria, 2014.
View | Files available | DOI
 

2014 | Journal Article | IST-REx-ID: 1733
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3, pp. 348–363, 2014.
View | Files available | DOI | Download (ext.)
 

2014 | Technical Report | IST-REx-ID: 5419   OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5421
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolution on graphs. IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5426
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2213   OA
K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.
View | Files available | DOI | Download (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 2162   OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.
View | Files available | DOI | Download (ext.) | arXiv
 

2014 | Technical Report | IST-REx-ID: 5414
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2054
K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 475   OA
B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146, pp. 83–90.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5427   OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2163   OA
K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.
View | Files available | DOI | Download (ext.) | arXiv
 

2014 | Technical Report | IST-REx-ID: 5415
K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2014.
View | Files available | DOI
 

2014 | Journal Article | IST-REx-ID: 2187   OA
R. Bloem et al., “Synthesizing robust systems,” Acta Informatica, vol. 51, no. 3–4, pp. 193–220, 2014.
View | Files available | DOI
 

2013 | Journal Article | IST-REx-ID: 2816   OA
I. Božić et al., “Evolutionary dynamics of cancer in response to targeted combination therapy,” eLife, vol. 2, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5409   OA
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed automata. IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5404
K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games. IST Austria, 2013.
View | Files available | DOI
 

2013 | Journal Article | IST-REx-ID: 2854   OA
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability and turn based stochastic safety games,” Journal of Computer and System Sciences, vol. 79, no. 5, pp. 640–657, 2013.
View | Files available | DOI
 

2013 | Conference (Editor) | IST-REx-ID: 2292
K. Chatterjee and J. Sgall, Eds., Mathematical Foundations of Computer Science 2013, vol. 8087. Springer, 2013, p. VI-854.
View | DOI
 

2013 | Conference Paper | IST-REx-ID: 1376
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in 13th International Conference on Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.
View | Files available | DOI
 

2013 | Journal Article | IST-REx-ID: 2247   OA
B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in alternating prisoner’s dilemma ,” PLoS One, vol. 8, no. 12, 2013.
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2305   OA
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” in 28th Annual ACM/IEEE Symposium, New Orleans, LA, United States, 2013, pp. 331–340.
View | Files available | DOI | Download (ext.) | arXiv
 

2013 | Technical Report | IST-REx-ID: 5405
K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, Perfect-information stochastic mean-payoff parity games. IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5400
K. Chatterjee, M. Chmelik, and M. Tracol, What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria, 2013.
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2444   OA
K. Chatterjee and J. Ła̧Cki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.
View | DOI | Download (ext.) | arXiv
 

2013 | Journal Article | IST-REx-ID: 2824
K. Chatterjee and V. Prabhu, “Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems,” Information and Computation, vol. 228–229, pp. 83–119, 2013.
View | DOI
 

2013 | Journal Article | IST-REx-ID: 2836   OA
K. Chatterjee and V. Raman, “Assume-guarantee synthesis for digital contract signing,” Formal Aspects of Computing, vol. 26, no. 4, pp. 825–859, 2013.
View | DOI | Download (ext.) | arXiv
 

2013 | Journal Article | IST-REx-ID: 2817   OA
S. Novak, K. Chatterjee, and M. Nowak, “Density games,” Journal of Theoretical Biology, vol. 334, pp. 26–34, 2013.
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2886   OA
M. Chmelik and V. Řehák, “Controllable-choice message sequence graphs,” vol. 7721. Springer, pp. 118–130, 2013.
View | DOI | Download (ext.)
 

2013 | Conference Paper | IST-REx-ID: 2329
K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” vol. 8052. Springer, pp. 500–515, 2013.
View | Files available | DOI | Download (ext.) | arXiv
 

2013 | Journal Article | IST-REx-ID: 2831   OA
K. Chatterjee, M. Henzinger, M. Joglekar, and N. Shah, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” Formal Methods in System Design, vol. 42, no. 3, pp. 301–327, 2013.
View | Files available | DOI | Download (ext.) | arXiv
 

2013 | Technical Report | IST-REx-ID: 5406
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2279
K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” vol. 8172. Springer, pp. 118–132, 2013.
View | Files available | DOI | Download (ext.)
 

2013 | Conference Paper | IST-REx-ID: 2820
K. Chatterjee, A. Kößler, and U. Schmid, “Automated analysis of real-time scheduling using graph games,” in Proceedings of the 16th International conference on Hybrid systems: Computation and control, Philadelphia, PA, United States, 2013, pp. 163–172.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5399
J. Reiter, I. Bozic, K. Chatterjee, and M. Nowak, TTP: Tool for Tumor Progression. IST Austria, 2013.
View | Files available | DOI
 

2013 | Journal Article | IST-REx-ID: 2299   OA
Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6, pp. 585–601, 2013.
View | Files available | DOI
 

2013 | Journal Article | IST-REx-ID: 2814   OA
K. Chatterjee, L. Alfaro, and R. Majumdar, “The complexity of coverage,” International Journal of Foundations of Computer Science, vol. 24, no. 2, pp. 165–185, 2013.
View | DOI | Download (ext.) | arXiv
 

2013 | Conference Paper | IST-REx-ID: 2819   OA
K. Chatterjee and V. Prabhu, “Quantitative timed simulation functions and refinement metrics for real-time systems,” in Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, Philadelphia, PA USA, 2013, vol. 1, pp. 273–282.
View | DOI | Download (ext.)
 

2013 | Conference Paper | IST-REx-ID: 2446   OA
K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.
View | DOI | Download (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed