Pavlogiannis, A. (2017). Algorithmic advances in program analysis and their applications. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:th_854 

Svoreová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cbrná, I., &; Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier.https://doi.org/10.1016/j.nahs.2016.04.006 

Brázdil, T., Chatterjee, K., Forejt, V., &; Kudera, A. (2017). Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2016.09.009 

Reiter, J., Makohon Moore, A., Gerold, J., Boei, I., Chatterjee, K., Iacobuzio Donahue, C.,https://doi.org/10.1038/ncomms14114__Nowak, M. (2017). Reconstructing metastatic seeding patterns of human cancers. Nature Communications. Nature Publishing Group.https://doi.org/10.1038/ncomms14114 

Chatterjee, K., &; Osang, G. F. (2017). Pushdown reachability with constant treewidth. Information Processing Letters. Elsevier.https://doi.org/10.1016/j.ipl.2017.02.003 

Chatterjee, K., Henzinger, T. A., Otop, J., &; Velner, Y. (2017). Quantitative fair simulation games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2016.10.006 

Chatterjee, K., Kragl, B., Mishra, S., &; Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer.https://doi.org/10.1007/978-3-662-54434-1_11 

Chatterjee, K., Novotný, P., Pérez, G., Raskin, J., &; Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.

Priklopil, T., Chatterjee, K., &; Nowak, M. (2017). Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. https://doi.org/10.1016/j.jtbi.2017.08.025__Journal of Theoretical Biology. Elsevier.https://doi.org/10.1016/j.jtbi.2017.08.025 

Chatterjee, K., Novotný, P., &; Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM.https://doi.org/10.1145/3009837.3009873 

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak , M. (2017). Strong amplifiers of natural selection. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:51 

Chatterjee, K., Fu, H., &; Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar &; V. Kundak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer.https://doi.org/10.1007/978-3-319-63390-9_3 

Chatterjee, K., Goharshady, A. K., &; Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer.https://doi.org/10.1007/978-3-319-68167-2_4 

Chatterjee, K., Dvorák, W., Henzinger, M. H., &; Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2016.25 

Chonev, V. K., Ouaknine, J., &; Worrell, J. (2016). On the skolem problem for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2016.100 

Chatterjee, K., &; Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2016.98 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2016.24 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2016). Quantitative automata under probabilistic semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium (pp. 76–85). New York, NY, USA: IEEE.https://doi.org/10.1145/2933575.2933588 

Chatterjee, K., Dvoák, W., Henzinger, M. H., &; Loitzenbauer, V. (2016). Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 197–206). New York, NY, USA: IEEE.https://doi.org/10.1145/2933575.2935304 

Chatterjee, K., Ibsen-Jensen, R., &; Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.