Hirvonen, J., Schmid, L., Chatterjee, K., &; Schmid, S. (2024). On the convergence time in graphical games: A locality-sensitive approach. In 27th International Conference on Principles of Distributed Systems (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2023.11 

Hübner, V., Staab, M., Hilbe, C., Chatterjee, K., &; Kleshnina, M. (2024). Efficiency and resilience of cooperation in asymmetric social dilemmas. Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences.https://doi.org/10.1073/pnas.2315558121 

Hübner, V., &; Kleshnina, M. (2024). Computer code for “Efficiency and resilience of cooperation in asymmetric social dilemmas.”https://doi.org/10.5281/ZENODO.10639167__Zenodo.https://doi.org/10.5281/ZENODO.10639167 

Attia, L., Oliu-Barton, M., &; Saona Urmeneta, R. J. (2024). Marginal values of a stochastic game. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences.https://doi.org/10.1287/moor.2023.0297 

Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., &; Svoboda, J. (n.d.). Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms. arXiv.https://doi.org/10.48550/arXiv.2405.02486 

Attia, L., Lichev, L., Mitsche, D., Saona Urmeneta, R. J., &; Ziliotto, B. (n.d.). Zero-sum random games on directed graphs. arXiv.https://doi.org/10.48550/arXiv.2401.16252 

Chatterjee, K., Goharshady, A. K., Meggendorfer, T., &; Zikelic, D. (2024). Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery.https://doi.org/10.1145/3649824 

Schmid, S., Svoboda, J., &; Yeo, M. X. (2024). Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2023.114353 

Chatterjee, K., Goharshady, E., Novotný, P., &; Zikelic, D. (2024). Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery.https://doi.org/10.1145/3656462 

Chatterjee, K., Ebrahimzadeh, A., Karrabi, M., Pietrzak, K. Z., Yeo, M. X., &; Zikelic, D. (2024). Fully automated selfish mining analysis in efficient proof systems blockchains. In https://doi.org/10.1145/3662158.3662769__Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing (pp. 268–278). Nantes, France: Association for Computing Machinery.https://doi.org/10.1145/3662158.3662769 

Alistarh, D.-A., Chatterjee, K., Karrabi, M., &; Lazarsfeld, J. M. (2024). Game dynamics and equilibrium computation in the population protocol model. In Proceedings of the 43rd Annual ACM Symposium on Principles of Distributed Computing (pp. 40–49). Nantes, France: Association for Computing Machinery.https://doi.org/10.1145/3662158.3662768 

Asadi, A., Chatterjee, K., Svoboda, J., &; Saona Urmeneta, R. J. (2024). Deterministic sub-exponential algorithm for discounted-sum games with unary weights. In 39th Annual ACM/IEEE Symposium on Logic in Computer Science. Tallinn, Estonia: Association for Computing Machinery.https://doi.org/10.1145/3661814.3662080 

Meggendorfer, T., &; Weininger, M. (2024). Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. In 36th International Conference on Computer Aided Verification (Vol. 14683, pp. 359–372). Montreal, Canada: Springer Nature.https://doi.org/10.1007/978-3-031-65633-0_16 

Svoboda, J., Joshi, S. S., Tkadlec, J., &; Chatterjee, K. (2024). Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. Public Library of Science.https://doi.org/10.1371/journal.pcbi.1012008 

Baier, C., Chatterjee, K., Meggendorfer, T., &; Piribauer, J. (2024). Entropic risk for turn-based stochastic games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2024.105214 

Chatterjee, K., Meggendorfer, T., Saona Urmeneta, R. J., &; Svoboda, J. (2023). Faster algorithm for turn-based stochastic games with bounded treewidth. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611977554.ch173 

Chatterjee, K., Henzinger, T. A., Lechner, M., &; Zikelic, D. (2023). A learner-verifier framework for neural network controllers and certificates of stochastic systems. In Tools and Algorithms for the Construction and Analysis of Systems  (Vol. 13993, pp. 3–25). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30823-9_1 

Svoboda, J., Tkadlec, J., Kaveh, K., &; Chatterjee, K. (2023). Coexistence times in the Moran process with environmental heterogeneity. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. The Royal Society.https://doi.org/10.1098/rspa.2022.0685 

Schmid, L., Ekbatani, F., Hilbe, C., &; Chatterjee, K. (2023). Quantitative assessment can stabilize indirect reciprocity under imperfect information. Nature Communications. Springer Nature.https://doi.org/10.1038/s41467-023-37817-x 

Lechner, M., Zikelic, D., Chatterjee, K., Henzinger, T. A., &; Rus, D. (2023). Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 14964–14973). Washington, DC, United States: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v37i12.26747 

Avni, G., Jecker, I. R., &; Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 5464–5471). Washington, DC, United States.https://doi.org/10.1609/aaai.v37i5.25679 

Kretinsky, J., Meggendorfer, T., Prokop, M., &; Rieder, S. (2023). Guessing winning policies in LTL synthesis by semantic learning. In 35th International Conference on Computer Aided Verification  (Vol. 13964, pp. 390–414). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37706-8_20 

Sun, Y., Fu, H., Chatterjee, K., &; Goharshady, A. K. (2023). Automated tail bound analysis for probabilistic recurrence relations. In Computer Aided Verification (Vol. 13966, pp. 16–39). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37709-9_2 

Akshay, S., Chatterjee, K., Meggendorfer, T., &; Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In International Conference on Computer Aided Verification (Vol. 13966, pp. 86–112). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37709-9_5 

Chatterjee, K., Katoen, J. P., Mohr, S., Weininger, M., &; Winkler, T. (2023). Stochastic games with lexicographic objectives. Formal Methods in System Design. Springer Nature.https://doi.org/10.1007/s10703-023-00411-4 

Graham, T., Kleshnina, M., &; Filar, J. A. (2023). Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications. Springer Nature.https://doi.org/10.1007/s13235-022-00425-3 

Mckerral, J. C., Kleshnina, M., Ejov, V., Bartle, L., Mitchell, J. G., &; Filar, J. A. (2023). Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations. PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0279838 

Avni, G., Meggendorfer, T., Sadhukhan, S., Tkadlec, J., &; Zikelic, D. (2023). Reachability poorman discrete-bidding games. In Frontiers in Artificial Intelligence and Applications (Vol. 372, pp. 141–148). Krakow, Poland: IOS Press.https://doi.org/10.3233/FAIA230264 

Tkadlec, J., Kaveh, K., Chatterjee, K., &; Nowak, M. A. (2023). Evolutionary dynamics of mutants that modify population structure. Journal of the Royal Society, Interface. The Royal Society.https://doi.org/10.1098/rsif.2023.0355 

Kleshnina, M., Hilbe, C., Simsa, S., Chatterjee, K., &; Nowak, M. A. (2023). The effect of environmental information on evolution of cooperation in stochastic games. Nature Communications. Springer Nature.https://doi.org/10.1038/s41467-023-39625-9 

Kleshnina, M. (2023). kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games. Zenodo.https://doi.org/10.5281/ZENODO.8059564 

Kretinsky, J., Meggendorfer, T., &; Weininger, M. (2023). Stopping criteria for value iteration on stochastic games with quantitative objectives. In 38th Annual ACM/IEEE Symposium on Logic in Computer Science (Vol. 2023). Boston, MA, United States: Institute of Electrical and Electronics Engineers.https://doi.org/10.1109/LICS56636.2023.10175771 

Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D.,https://doi.org/10.46298/DMTCS.8383__Turcotte, A. (2023). Token swapping on trees. Discrete Mathematics and Theoretical Computer Science. EPI Sciences.https://doi.org/10.46298/DMTCS.8383 

Bastankhah, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., &; Yeo, M. X. (2023). : Boosting liquidity in payment channel networks with online admission control. In 27th International Conference on Financial Cryptography and Data Security (Vol. 13950, pp. 309–325). Bol, Brac, Croatia: Springer Nature.https://doi.org/10.1007/978-3-031-47754-6_18 

Zikelic, D. (2023). Automated verification and control of infinite state stochastic systems. Institute of Science and Technology Austria.https://doi.org/10.15479/14539 

Kisan, J. M., &; Svoboda, J. (2023). Shortest dominating set reconfiguration under token sliding. In 24th International Symposium on Fundamentals of Computation Theory (Vol. 14292, pp. 333–347). Trier, Germany: Springer Nature.https://doi.org/10.1007/978-3-031-43587-4_24 

Zikelic, D., Lechner, M., Henzinger, T. A., &; Chatterjee, K. (2023). Learning control policies for stochastic systems with reach-avoid guarantees. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 11926–11935). Washington, DC, United States: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v37i10.26407 

Meggendorfer, T. (2023). Correct approximation of stationary distributions. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 489–507). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30823-9_25 

Meggendorfer, T. (2023). Artefact for: Correct Approximation of Stationary Distributions. Zenodo.https://doi.org/10.5281/ZENODO.7548214 

Chatterjee, K., Kafshdar Goharshady, E., Novotný, P., Zárevúcky, J., &; Zikelic, D. (2023). On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. Association for Computing Machinery.https://doi.org/10.1145/3585391 

Giambartolomei, G., Frederik Mallmann-Trenn, F. M.-T., &; Saona Urmeneta, R. J. (n.d.). Prophet inequalities: Separating random order from order selection. arXiv.https://doi.org/10.48550/arXiv.2304.04024 

Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., &; Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In 37th Conference on Neural Information Processing Systems. New Orleans, LO, United States.

Baier, C., Chatterjee, K., Meggendorfer, T., &; Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In 48th International Symposium on Mathematical Foundations of Computer Science (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2023.15 

Ansaripour, M., Chatterjee, K., Henzinger, T. A., Lechner, M., &; Zikelic, D. (2023). Learning provably stabilizing neural controllers for discrete-time stochastic systems. In 21st International Symposium on Automated Technology for Verification and Analysis (Vol. 14215, pp. 357–379). Singapore, Singapore: Springer Nature.https://doi.org/10.1007/978-3-031-45329-8_17 

Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., &; Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29 

Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., &; Svoboda, J. (2022). Complexity of spatial games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11 

Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36, pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v36i9.21222 

Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A.,https://doi.org/10.7155/jgaa.00591__Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph Algorithms and Applications. Brown University.https://doi.org/10.7155/jgaa.00591 

Chatterjee, K., Mohammadi, M., &; Saona Urmeneta, R. J. (n.d.). Repeated prophet inequality with near-optimal bounds. arXiv.https://doi.org/10.48550/ARXIV.2209.14368 

Kretinsky, J., Meggendorfer, T., Waldmann, C., &; Weininger, M. (2022). Index appearance record with preorders. Acta Informatica. Springer Nature.https://doi.org/10.1007/s00236-021-00412-y 

Svoboda, J., Tkadlec, J., Pavlogiannis, A., Chatterjee, K., &; Nowak, M. A. (2022). Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. Springer Nature.https://doi.org/10.1038/s41598-022-05333-5 

Zikelic, D., Chang, B.-Y. E., Bolignano, P., &; Raimondi, F. (2022). Differential cost analysis with simultaneous potentials and anti-potentials. In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 442–457). San Diego, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3519939.3523435 

Chatterjee, K., Svoboda, J., Zikelic, D., Pavlogiannis, A., &; Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical Review E. American Physical Society.https://doi.org/10.1103/physreve.106.034321 

Schmid, L., Hilbe, C., Chatterjee, K., &; Nowak, M. (2022). Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. Public Library of Science.https://doi.org/10.1371/journal.pcbi.1010149 

Chatterjee, K., Saona Urmeneta, R. J., &; Ziliotto, B. (2022). Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences.https://doi.org/10.1287/moor.2020.1116 

Meggendorfer, T. (2022). PET – A partial exploration tool for probabilistic verification. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 320–326). Virtual: Springer Nature.https://doi.org/10.1007/978-3-031-19992-9_20 

Chatterjee, K., &; Doyen, L. (2022). Graph planning with expected finite horizon. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2022.04.003 

Grover, K., Kretinsky, J., Meggendorfer, T., &; Weininger, M. (2022). Anytime guarantees for reachability in uncountable Markov decision processes. In 33rd International Conference on Concurrency Theory  (Vol. 243). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2022.11 

Chatterjee, K., Goharshady, A. K., Meggendorfer, T., &; Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer.https://doi.org/10.1007/978-3-031-13185-1_4 

Lechner, M., Zikelic, D., Chatterjee, K., &; Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v36i7.20695 

Zikelic, D., Lechner, M., Chatterjee, K., &; Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. arXiv.https://doi.org/10.48550/arXiv.2205.11991 

Zikelic, D., Lechner, M., Henzinger, T. A., &; Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. arXiv.https://doi.org/10.48550/ARXIV.2210.05308 

McAvoy, A., Kates-Harbeck, J., Chatterjee, K., &; Hilbe, C. (2022). Evolutionary instability of selfish learning in repeated games. PNAS Nexus. Oxford University Press.https://doi.org/10.1093/pnasnexus/pgac141 

Jecker, I. R., Mazzocchi, N., &; Wolf, P. (2021). Decomposing permutation automata. In 32nd International Conference on Concurrency Theory (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2021.18 

Chatterjee, K., Henzinger, M. H., Kale, S. S., &; Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In 48th International Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2021.124 

Guha, S., Jecker, I. R., Lehtinen, K., &; Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In 46th International Symposium on Mathematical Foundations of Computer Science (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2021.53 

Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., &; Wolf, P. (2021). On the complexity of intersection non-emptiness for star-free language classes. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42 

Avni, G., Jecker, I. R., &; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611976465.38 

Tomásek, P., Horák, K., Aradhye, A., Bosanský, B., &; Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In 30th International Joint Conference on Artificial Intelligence (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence.https://doi.org/10.24963/ijcai.2021/575 

Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A.,https://doi.org/10.1007/978-3-030-68211-8_18__Vogtenhuber, B. (2021). On compatible matchings. In 15th International Conference on Algorithms and Computation (Vol. 12635, pp. 221–233). Yangon, Myanmar: Springer Nature.https://doi.org/10.1007/978-3-030-68211-8_18 

Schmid, L., &; Hilbe, C. (2021). The evolution of strategic ignorance in strategic interaction. In R. Hertwig &; C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know (Vol. 29, pp. 139–152). MIT Press.

Bansal, S., Chatterjee, K., &; Vardi, M. Y. (2021). On satisficing in quantitative games. In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12651, pp. 20–37). Luxembourg City, Luxembourg: Springer Nature.https://doi.org/10.1007/978-3-030-72016-2 

Lechner, M., dikeli, Ð., Chatterjee, K., &; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In 35th Conference on Neural Information Processing Systems. Virtual.https://doi.org/10.48550/arXiv.2111.03165 

Zeiner, M., Schmid, U., &; Chatterjee, K. (2021). Optimal strategies for selecting coordinators. Discrete Applied Mathematics. Elsevier.https://doi.org/10.1016/j.dam.2020.10.022 

Kleshnina, M., Streipert, S. S., Filar, J. A., &; Chatterjee, K. (2021). Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. Public Library of Science.https://doi.org/10.1371/journal.pcbi.1008523 

Tkadlec, J., Pavlogiannis, A., Chatterjee, K., &; Nowak, M. A. (2021). Fast and strong amplifiers of natural selection. Nature Communications. Springer Nature.https://doi.org/10.1038/s41467-021-24271-w 

Wang, J., Sun, Y., Fu, H., Chatterjee, K., &; Goharshady, A. K. (2021). Quantitative analysis of assertion violations in probabilistic programs. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1171–1186). Online: Association for Computing Machinery.https://doi.org/10.1145/3453483.3454102 

Asadi, A., Chatterjee, K., Fu, H., Goharshady, A. K., &; Mahdavi, M. (2021). Polynomial reachability witnesses via Stellensätze. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 772–787). Online: Association for Computing Machinery.https://doi.org/10.1145/3453483.3454076 

Chatterjee, K., Dvorak, W., Henzinger, M. H., &; Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers.https://doi.org/10.1109/LICS52264.2021.9470739 

Chatterjee, K., &; Doyen, L. (2021). Stochastic processes with expected stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers.https://doi.org/10.1109/LICS52264.2021.9470595 

Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In 38th International Symposium on Theoretical Aspects of Computer Science (Vol. 187). Saarbrücken, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.STACS.2021.44 

Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., &; Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In 33rd International Conference on Computer-Aided Verification  (Vol. 12759, pp. 341–366). Virtual: Springer Nature.https://doi.org/10.1007/978-3-030-81685-8_16 

Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., &; Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. Association for Computing Machinery.https://doi.org/10.1145/3485541 

Toman, V. (2021). Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:10199 

Chatterjee, K., Dvoák, W., Henzinger, M. H., &; Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. Elsevier.https://doi.org/10.1016/j.artint.2021.103499 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-021-00373-5 

Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., &; Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In 24th International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual: Springer Nature.https://doi.org/10.1007/978-3-030-90870-6_33 

Chatterjee, K., Goharshady, E. K., Novotný, P., &; Zikelic, D. (2021). Proving non-termination by program reversal. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1033–1048). Online: Association for Computing Machinery.https://doi.org/10.1145/3453483.3454093 

Chatterjee, K., Goharshady, E. K., Novotný, P., &; Zikelic, D. (2021). RevTerm. Association for Computing Machinery.https://doi.org/10.1145/3410304 

Schmid, L. (2021). Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:10293 

Schmid, L., Shati, P., Hilbe, C., &; Chatterjee, K. (2021). The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. Springer Nature.https://doi.org/10.1038/s41598-021-96932-1 

Schmid, L., Chatterjee, K., Hilbe, C., &; Nowak, M. A. (2021). A unified framework of direct and indirect reciprocity. Nature Human Behaviour. Springer Nature.https://doi.org/10.1038/s41562-021-01114-8 

Goharshady, A. K. (2021). Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:8934 

Schmid, L., Chatterjee, K., &; Schmid, S. (2020). The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In Proceedings of the 23rd International Conference on Principles of Distributed Systems (Vol. 153). Neuchâtel, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2019.21 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2020.23 

Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., &; Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2020.22 

Jecker, I. R., Kupferman, O., &; Mazzocchi, N. (2020). Unary prime languages. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2020.51 

Ashok, P., Chatterjee, K., Kretinsky, J., Weininger, M., &; Winkler, T. (2020). Approximating values of generalized-reachability stochastic games. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science  (pp. 102–115). Saarbrücken, Germany: Association for Computing Machinery.https://doi.org/10.1145/3373718.3394761 

Kaveh, K., McAvoy, A., Chatterjee, K., &; Nowak, M. A. (2020). The Moran process on 2-chromatic graphs. PLOS Computational Biology. Public Library of Science.https://doi.org/10.1371/journal.pcbi.1008402 

Kleshnina, M., Streipert, S., Filar, J., &; Chatterjee, K. (2020). Prioritised learning in snowdrift-type games. Mathematics. MDPI.https://doi.org/10.3390/math8111945 

Pavlogiannis, A., Schaumberger, N., Schmid, U., &; Chatterjee, K. (2020). Precedence-aware automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE.https://doi.org/10.1109/TCAD.2020.3012803 

Avni, G., Ibsen-Jensen, R., &; Tkadlec, J. (2020). All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v34i02.5546 

Milutinovic, B., Stock, M., Grasse, A. V., Naderlinger, E., Hilbe, C., &; Cremer, S. (2020). Social immunity modulates competition between coinfecting pathogens. Ecology Letters. Wiley.https://doi.org/10.1111/ele.13458 

Milutinovic, B., Stock, M., Grasse, A. V., Naderlinger, E., Hilbe, C., &; Cremer, S. (2020). Social immunity modulates competition between coinfecting pathogens. Dryad.https://doi.org/10.5061/DRYAD.CRJDFN318 

Chatterjee, K., Chmelik, M., Karkhanis, D., Novotný, P., &; Royer, A. (2020). Multiple-environment Markov decision processes: Efficient analysis and applications. In Proceedings of the 30th International Conference on Automated Planning and Scheduling (Vol. 30, pp. 48–56). Nancy, France: Association for the Advancement of Artificial Intelligence.

Chatterjee, K., Katoen, J. P., Weininger, M., &; Winkler, T. (2020). Stochastic games with lexicographic reachability-safety objectives. In International Conference on Computer Aided Verification (Vol. 12225, pp. 398–420). Springer Nature.https://doi.org/10.1007/978-3-030-53291-8_21 

Shakiba, A., Goharshady, A. K., Hooshmandasl, M. R., &; Alambardar Meybodi, M. (2020). A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. Iranian Academic Center for Education, Culture and Research.https://doi.org/10.29252/ijmsi.15.2.117 

Tkadlec, J., Pavlogiannis, A., Chatterjee, K., &; Nowak, M. A. (2020). Limits on amplifiers of natural selection under death-Birth updating. PLoS Computational Biology. Public Library of Science.https://doi.org/10.1371/journal.pcbi.1007494 

Tkadlec, J. (2020). A role of graphs in evolutionary processes. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:7196 

Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2020). Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. Royal Society.https://doi.org/10.6084/m9.figshare.5973013.v1 

Wang, P., Fu, H., Chatterjee, K., Deng, Y., &; Xu, M. (2020). Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In Proceedings of the ACM on Programming Languages (Vol. 4). ACM.https://doi.org/10.1145/3371093 

Brázdil, T., Chatterjee, K., Novotný, P., &; Vahala, J. (2020). Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v34i06.6531 

Aichholzer, O., Obmann, J., Patak, P., Perz, D., &; Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In 36th European Workshop on Computational Geometry. Würzburg, Germany, Virtual.

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2020). Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In European Symposium on Programming (Vol. 12075, pp. 112–140). Dublin, Ireland: Springer Nature.https://doi.org/10.1007/978-3-030-44914-8_5 

Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., &; Pavlogiannis, A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In Automated Technology for Verification and Analysis (Vol. 12302, pp. 253–270). Hanoi, Vietnam: Springer Nature.https://doi.org/10.1007/978-3-030-59152-6_14 

Chatterjee, K., Fu, H., Goharshady, A. K., &; Goharshady, E. K. (2020). Polynomial invariant generation for non-deterministic recursive programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 672–687). London, United Kingdom: Association for Computing Machinery.https://doi.org/10.1145/3385412.3385969 

Goharshady, A. K., &; Mohammadi, F. (2020). An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. Elsevier.https://doi.org/10.1016/j.ress.2019.106665 

Chatterjee, K., Dvorák, W., Henzinger, M. H., &; Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.CONCUR.2019.7 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.CONCUR.2019.27 

Chatterjee, K., &; Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.CONCUR.2019.6 

Avni, G., Henzinger, T. A., &; Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.MFCS.2019.11 

Fu, H., &; Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. In International Conference on Verification, Model Checking, and Abstract Interpretation (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer Nature.https://doi.org/10.1007/978-3-030-11245-5_22 

Avni, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., &; Pranger, S. (2019). Run-time optimization for learned controllers through quantitative games. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 630–649). New York, NY, United States: Springer.https://doi.org/10.1007/978-3-030-25540-4_36 

Hauser, O. P., Hilbe, C., Chatterjee, K., &; Nowak, M. A. (2019). Social dilemmas among unequals. Nature. Springer Nature.https://doi.org/10.1038/s41586-019-1488-5 

Ashok, P., Brázdil, T., Chatterjee, K., Ketínský, J., Lampert, C., &; Toman, V. (2019). Strategy representation by decision trees with linear classifiers. In 16th International Conference on Quantitative Evaluation of Systems (Vol. 11785, pp. 109–128). Glasgow, United Kingdom: Springer Nature.https://doi.org/10.1007/978-3-030-30281-8_7 

Brázdil, T., Chatterjee, K., Kucera, A., Novotný, P., &; Velan, D. (2019). Deciding fast termination for probabilistic VASS with nondeterminism. In International Symposium on Automated Technology for Verification and Analysis (Vol. 11781, pp. 462–478). Taipei, Taiwan: Springer Nature.https://doi.org/10.1007/978-3-030-31784-3_27 

Tkadlec, J., Pavlogiannis, A., Chatterjee, K., &; Nowak, M. A. (2019). Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. Springer Nature.https://doi.org/10.1038/s42003-019-0373-y 

Chatterjee, K., Pavlogiannis, A., &; Toman, V. (2019). Value-centric dynamic partial order reduction. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM.https://doi.org/10.1145/3360550 

Chatterjee, K., &; Doyen, L. (2019). Graph planning with expected finite horizon. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Vancouver, BC, Canada: IEEE.https://doi.org/10.1109/lics.2019.8785706 

Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D.,  Turcotte, A. (n.d.). Token swapping on trees. arXiv.

Huang, M., Fu, H., Chatterjee, K., &; Goharshady, A. K. (2019). Modular verification for almost-sure termination of probabilistic programs. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications  (Vol. 3). Athens, Greece: ACM.https://doi.org/10.1145/3360555 

Chatterjee, K., Goharshady, A. K., Okati, N., &; Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. ACM.https://doi.org/10.1145/3290366 

Chatterjee, K., Goharshady, A. K., &; Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE.https://doi.org/10.1109/BLOC.2019.8751326 

Chatterjee, K., Goharshady, A. K., &; Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part 7772, pp. 374–381). Limassol, Cyprus: ACM.https://doi.org/10.1145/3297280.3297319 

Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., &; Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery.https://doi.org/10.1145/3314221.3314581 

Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., &; Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. ACM.https://doi.org/10.1145/3363525 

Chatterjee, K., Fu, H., &; Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. ACM.https://doi.org/10.1145/3339984 

Chatterjee, K., Goharshady, A. K., &; Goharshady, E. K. (2019). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part 7772, pp. 400–408). Limassol, Cyprus: ACM.https://doi.org/10.1145/3297280.3297322 

Chatterjee, K., Dvoák, W., Henzinger, M. H., &; Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair.https://doi.org/10.29007/5z5k 

Agrawal, S., Chatterjee, K., &; Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM.https://doi.org/10.1145/3158122 

Bloem, R., Chatterjee, K., &; Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, &; R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer.https://doi.org/10.1007/978-3-319-10575-8_27 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, &; M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer.https://doi.org/10.1007/978-3-319-95246-8_9 

Reiter, J., Hilbe, C., Rand, D., Chatterjee, K., &; Nowak, M. (2018). Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. Nature Publishing Group.https://doi.org/10.1038/s41467-017-02721-8 

Brázdil, T., Chatterjee, K., Kudera, A., Novotný, P., Velan, D., &; Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. 8033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE.https://doi.org/10.1145/3209108.3209191 

Hilbe, C., Simsa, S., Chatterjee, K., &; Nowak, M. (2018). Evolution of cooperation in stochastic games. Nature. Nature Publishing Group.https://doi.org/10.1038/s41586-018-0277-x 

Chatterjee, K., Dvorák, W., Henzinger, M. H., &; Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States: ACM.https://doi.org/10.1137/1.9781611975031.151 

Huang, M., Fu, H., &; Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer.https://doi.org/10.1007/978-3-030-02768-1_11 

Hilbe, C., Chatterjee, K., &; Nowak, M. (2018). Partners and rivals in direct reciprocity. Nature Human Behaviour. Nature Publishing Group.https://doi.org/10.1038/s41562-018-0320-9 

Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., &; Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer.https://doi.org/10.1007/978-3-319-99154-2_4 

Brázdil, T., Chatterjee, K., Kretinsky, J., &; Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer.https://doi.org/10.1007/978-3-319-89960-2_21 

Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., &; Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer.https://doi.org/10.1007/978-3-319-96142-2_13 

Hoffman, M., Hilbe, C., &; Nowak, M. (2018). The signal-burying game can explain why we obscure positive traits and good deeds. Nature Human Behaviour. Nature Publishing Group.https://doi.org/10.1038/s41562-018-0354-z 

Hansen, K. A., Ibsen-Jensen, R., &; Neyman, A. (2018). The Big Match with a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM Press.https://doi.org/10.1145/3219166.3219198 

Chatterjee, K., Fu, H., Novotný, P., &; Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM).https://doi.org/10.1145/3174800 

Horák, K., Bosanský, B., &; Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI.https://doi.org/10.24963/ijcai.2018/662 

Chatterjee, K., Elgyütt, A., Novotný, P., &; Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI.https://doi.org/10.24963/ijcai.2018/652 

Chatterjee, K., Chemlík, M., &; Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.

Chatterjee, K., Dvorák, W., Henzinger, M. H., &; Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.

Chatterjee, K., Pavlogiannis, A., Kößler, A., &; Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. Springer.https://doi.org/10.1007/s11241-017-9293-4 

Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2018). Language acquisition with communication between learners. Journal of the Royal Society Interface. The Royal Society.https://doi.org/10.1098/rsif.2018.0073 

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. Springer Nature.https://doi.org/10.1038/s42003-018-0078-7 

Hilbe, C., Schmid, L., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2018). Indirect reciprocity with private, noisy, and incomplete information. PNAS. National Academy of Sciences.https://doi.org/10.1073/pnas.1810565115 

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &; Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2018.11 

Chatterjee, K., Goharshady, A. K., &; Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer.https://doi.org/10.1007/978-3-319-89884-1_26 

Chatterjee, K., Fu, H., Goharshady, A. K., &; Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI.https://doi.org/10.24963/ijcai.2018/653 

Goharshady, A. K., Behrouz, A., &; Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE.https://doi.org/10.1109/Cybermatics_2018.2018.00231 

Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., &; Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM).https://doi.org/10.1145/3210257 

Mciver, A., Morgan, C., Kaminski, B. L., &; Katoen, J. P. (2017). A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3158121 

Chatterjee, K., Henzinger, M. H., &; Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.23638/LMCS-13(3:26)2017 

Chatterjee, K., Ketínská, Z., &; Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.23638/LMCS-13(2:15)2017 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/3152769 

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.23638/LMCS-13(3:23)2017 

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group.https://doi.org/10.1038/s41598-017-00107-w 

Chatterjee, K., Choudhary, B., &; Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3158118 

Chatterjee, K., Choudhary, B., &; Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria.https://doi.org/10.15479/AT:IST-2017-870-v1-1 

Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., &; Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3158119 

Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., &; Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria.https://doi.org/10.15479/AT:IST-2017-872-v1-1 

Chatterjee, K., Ibsen-Jensen, R., &; Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2017.61 

Chatterjee, K., Henzinger, M. H., &; Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2017.39 

Chatterjee, K., Hansen, K., &; Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2017.55 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, &; R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer.https://doi.org/10.1007/978-3-319-63121-9_18 

Chatterjee, K., Fu, H., &; Murhekar, A. (2017). Automated recurrence analysis for almost linear expected runtime bounds. In R. Majumdar &; V. Kundak (Eds.) (Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer.https://doi.org/10.1007/978-3-319-63387-9_6 

Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., &; Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar &; V. Kundak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer.https://doi.org/10.1007/978-3-319-63387-9_10 

Chatterjee, K., Dvorák, W., Henzinger, M. H., &; Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik.https://doi.org/10.4230/LIPICS.CSL.2017.18 

Makohon Moore, A., Zhang, M., Reiter, J., Boei, I., Allen, B., Kundu, D.,https://doi.org/10.1038/ng.3764__Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. Nature Publishing Group.https://doi.org/10.1038/ng.3764 

Hilbe, C., Martinez, V., Chatterjee, K., &; Nowak, M. (2017). Memory-n strategies of direct reciprocity. PNAS. National Academy of Sciences.https://doi.org/10.1073/pnas.1621239114 

Chatterjee, K., Doyen, L., Filiot, E., &; Raskin, J. (2017). Doomsday equilibria for omega-regular games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2016.10.012 

Chatterjee, K., &; Piterman, N. (2017). Obligation blackwell games and p-automata. Journal of Symbolic Logic. Cambridge University Press.https://doi.org/10.1017/jsl.2016.71 

Veller, C., Hayward, L., Nowak, M., &; Hilbe, C. (2017). The red queen and king in finite populations. PNAS. National Academy of Sciences.https://doi.org/10.1073/pnas.1702020114 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2017.5 

Chatterjee, K., &; Velner, Y. (2017). The complexity of mean-payoff pushdown games. Journal of the ACM. ACM.https://doi.org/10.1145/3121408 

Chatterjee, K., &; Velner, Y. (2017). Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. Academic Press.https://doi.org/10.1016/j.jcss.2017.04.005 

Chatterjee, K., &; Ehlers, R. (2017). Special issue: Synthesis and SYNT 2014. Acta Informatica. Springer.https://doi.org/10.1007/s00236-017-0299-0 

Kretinsky, J., Meggendorfer, T., Waldmann, C., &; Weininger, M. (2017). Index appearance record for transforming Rabin automata into parity automata. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 10205, pp. 443–460). Uppsala, Sweden: Springer.https://doi.org/10.1007/978-3-662-54577-5_26 

Avni, G., Henzinger, T. A., &; Chonev, V. K. (2017). Infinite-duration bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2017.21 

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 

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.

Hilbe, C., &; Traulsen, A. (2016). Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods”https://doi.org/10.1016/j.plrev.2016.10.004__by C. Adami, J. Schossau and A. Hintze. Physics of Life Reviews. Elsevier.https://doi.org/10.1016/j.plrev.2016.10.004 

Pandey, V., &; Chatterjee, K. (2016). Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (Vol. 26, pp. 365–368). San Francisco, CA, USA: ACM.https://doi.org/10.1145/2818052.2869122 

Brázdil, T., Forejt, V., Kudera, A., &; Novotný, P. (2016). Stability in graphs and games (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2016.10 

Chatterjee, K., &; Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.

Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., &; Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.

Brázdil, T., Kudera, A., &; Novotný, P. (2016). Optimizing the expected mean payoff in Energy Markov Decision Processes (Vol. 9938, pp. 32–49). Presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan: Springer.https://doi.org/10.1007/978-3-319-46520-3_3 

Milinski, M., Hilbe, C., Semmann, D., Sommerfeld, R., &; Marotzke, J. (2016). Humans choose representatives who enforce cooperation in social dilemmas through extortion. Nature Communications. Nature Publishing Group.https://doi.org/10.1038/ncomms10915 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2016). Quantitative monitor automata (Vol. 9837, pp. 23–38). Presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-53413-7_2 

Hansen, K., Ibsen-Jensen, R., &; Koucký, M. (2016). The big match in small space (Vol. 9928, pp. 64–76). Presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-53354-3_6 

Chonev, V. K., Ouaknine, J., &; Worrell, J. (2016). On the complexity of the orbit problem. Journal of the ACM. ACM.https://doi.org/10.1145/2857050 

Chonev, V. K., Ouaknine, J., &; Worrell, J. (2016). On recurrent reachability for continuous linear dynamical systems. In LICS ’16 (pp. 515–524). New York, NY, USA: IEEE.https://doi.org/10.1145/2933575.2934548 

Chakra, M., Hilbe, C., &; Traulsen, A. (2016). Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites. Royal Society Open Science. Royal Society, The.https://doi.org/10.1098/rsos.160036 

Baek, S., Jeong, H., Hilbe, C., &; Nowak, M. (2016). Comparing reactive and memory-one strategies of direct reciprocity. Scientific Reports. Nature Publishing Group.https://doi.org/10.1038/srep25676 

Lohse, K., Chmelik, M., Martin, S., &; Barton, N. H. (2016). Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. Genetics Society of America.https://doi.org/10.1534/genetics.115.183814 

Chatterjee, K., &; Ibsen-Jensen, R. (2016). The complexity of deciding legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands: IOS Press.https://doi.org/10.3233/978-1-61499-672-9-1432 

Chatterjee, K., &; Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE.https://doi.org/10.1145/2933575.2934513 

Chatterjee, K., Chmelik, M., &; Tracol, M. (2016). What is decidable about partially observable Markov decision processes with <9-regular objectives. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2016.02.009 

Chatterjee, K., Chmelik, M., Gupta, R., &; Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. Elsevier.https://doi.org/10.1016/j.artint.2016.01.007 

Chatterjee, K., Pavlogiannis, A., &; Velner, Y. (2016). Quantitative interprocedural analysis. IST Austria.https://doi.org/10.15479/AT:IST-2016-523-v1-1 

Chatterjee, K., Chmelik, M., &; Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2016). Amplification on undirected population structures: Comets beat stars. IST Austria.https://doi.org/10.15479/AT:IST-2016-648-v1-1 

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria.https://doi.org/10.15479/AT:IST-2017-749-v3-1 

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2016). Strong amplifiers of natural selection. IST Austria.https://doi.org/10.15479/AT:IST-2016-728-v1-1 

Hilbe, C., Hagel, K., &; Milinski, M. (2016). Experimental game instructions. Public Library of Science.https://doi.org/10.1371/journal.pone.0163867.s008 

Hilbe, C., Hagel, K., &; Milinski, M. (2016). Asymmetric power boosts extortion in an economic experiment. PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0163867 

Hilbe, C., Hagel, K., &; Milinski, M. (2016). Experimental data. Public Library of Science.https://doi.org/10.1371/journal.pone.0163867.s009 

Chmelik, M. (2016). Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.

Daca, P., Henzinger, T. A., Kretinsky, J., &; Petrov, T. (2016). Linear distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2016.20 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik.https://doi.org/10.4230/LIPIcs.ESA.2016.28 

Chatterjee, K., Fu, H., Novotný, P., &; Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM.https://doi.org/10.1145/2837614.2837639 

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria.https://doi.org/10.15479/AT:IST-2017-728-v2-1 

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM.https://doi.org/10.1145/2837614.2837624 

Chatterjee, K., Fu, H., &; Goharshady, A. K. (2016). Termination analysis of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer.https://doi.org/10.1007/978-3-319-41528-4_1 

Chatterjee, K., &; Ibsen-Jensen, R. (2015). The value 1 problem under finite-memory strategies for concurrent mean-payoff games. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2015, pp. 1018–1029). San Diego, CA, United States: SIAM.https://doi.org/10.1137/1.9781611973730.69 

Kretinsky, J., Larsen, K., Laursen, S., &; Srba, J. (2015). Polynomial time decidability of weighted synchronization under partial observability (Vol. 42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2015.142 

Ibsen-Jensen, R., Chatterjee, K., &; Nowak, M. (2015). Computational complexity of ecological and evolutionary spatial dynamics. PNAS. National Academy of Sciences.https://doi.org/10.1073/pnas.1511366112 

Forejt, V., Krdál, J., &; Kretinsky, J. (2015). Controller synthesis for MDPs and frequency LTL\'47U (Vol. 9450, pp. 162–177). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Suva, Fiji: Springer.https://doi.org/10.1007/978-3-662-48899-7_12 

Babiak, T., Blahoudek, F., Duret Lutz, A., Klein, J., Kretinsky, J., Mueller, D.,https://doi.org/10.1007/978-3-319-21690-4_31__Strejdek, J. (2015). The Hanoi omega-automata format (Vol. 9206, pp. 479–486). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer.https://doi.org/10.1007/978-3-319-21690-4_31 

Chatterjee, K., Doyen, L., &; Vardi, M. (2015). The complexity of synthesis from probabilistic components. In 42nd International Colloquium (Vol. 9135, pp. 108–120). Kyoto, Japan: Springer Nature.https://doi.org/10.1007/978-3-662-47666-6_9 

Pavlogiannis, A., Chatterjee, K., Adlam, B., &; Nowak, M. (2015). Cellular cooperation with shift updating and repulsion. Scientific Reports. Nature Publishing Group.https://doi.org/10.1038/srep17147 

Brázdil, T., Kiefer, S., Kudera, A., &; Novotný, P. (2015). Long-run average behaviour of probabilistic vector addition systems (pp. 44–55). Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.15 

Landau, D., Tausch, E., Taylor Weiner, A., Stewart, C., Reiter, J., Bahlo, J.,https://doi.org/10.1038/nature15395__Wu, C. (2015). Mutations driving CLL and their evolution in progression and relapse. Nature. Nature Publishing Group.https://doi.org/10.1038/nature15395 

Brázdil, T., Korendiak, L., Krdál, J., Novotný, P., &; ehák, V. (2015). Optimizing performance of continuous-time stochastic systems using timeout synthesis. Presented at the QEST: Quantitative Evaluation of Systems, Madrid, Spain: Springer.https://doi.org/10.1007/978-3-319-22264-6_10 

Adlam, B., Chatterjee, K., &; Nowak, M. (2015). Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London.https://doi.org/10.1098/rspa.2015.0114 

Svoreová, M., Chmelik, M., Leahy, K., Eniser, H., Chatterjee, K., Cbrná, I., &; Belta, C. (2015). Temporal logic motion planning using POMDPs with parity objectives: Case study paper. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 233–238). Seattle, WA, United States: ACM.https://doi.org/10.1145/2728606.2728617 

Chatterjee, K., &; Prabhu, V. (2015). Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. IEEE.https://doi.org/10.1109/TAC.2015.2404612 

Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., &; Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.03.001 

Chatterjee, K., Chmelik, M., Gupta, R., &; Kanodia, A. (2015). Optimal cost almost-sure reachability in POMDPs. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence  (Vol. 5, pp. 3496–3502). Austin, TX, USA: AAAI Press.

Bloem, R., Chatterjee, K., Jacobs, S., &; Könighofer, R. (2015). Assume-guarantee synthesis for concurrent reactive programs with partial information (Vol. 9035, pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-46681-0_50 

Brázdil, T., Chatterjee, K., Forejt, V., &; Kudera, A. (2015). Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-46681-0_12 

Benes, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., &; Srba, J. (2015). Refinement checking on parametric modal transition systems. Acta Informatica. Springer.https://doi.org/10.1007/s00236-015-0215-4 

Priklopil, T., Kisdi, E., &; Gyllenberg, M. (2015). Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. Wiley.https://doi.org/10.1111/evo.12618 

Chatterjee, K., &; Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence. Elsevier.https://doi.org/10.1016/j.artint.2014.12.009 

Fahrenberg, U., Kretinsky, J., Legay, A., &; Traonouez, L. (2015). Compositionality for quantitative specifications (Vol. 8997, pp. 306–324). Presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy: Springer.https://doi.org/10.1007/978-3-319-15317-9_19 

Bérard, B., Chatterjee, K., &; Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. https://doi.org/10.1016/j.ipl.2014.09.001__Information Processing Letters. Elsevier.https://doi.org/10.1016/j.ipl.2014.09.001 

Chatterjee, K., Joglekar, M., &; Shah, N. (2015). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2015.01.050 

Chatterjee, K., Doyen, L., Gimbert, H., &; Henzinger, T. A. (2015). Randomness for free. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.06.003 

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. ACM.https://doi.org/10.1145/2699430 

Chatterjee, K., Henzinger, M. H., &; Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.34 

Chatterjee, K., Doyen, L., Randour, M., &; Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.03.010 

Chatterjee, K., &; Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.03.009 

Ahmed, U., Chatterjee, K., &; Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp. 745–752). Austin, TX, USA: AAAI Press.

Chatterjee, K., Chmelik, M., Gupta, R., &; Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE.https://doi.org/10.1109/ICRA.2015.7139019 

Chatterjee, K., Ibsen-Jensen, R., &; Hansen, K. (2015). The patience of concurrent stochastic games with safety and reachability objectives. IST Austria.https://doi.org/10.15479/AT:IST-2015-322-v1-1 

Chatterjee, K., Komárková, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.32 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.72 

Chatterjee, K., Komarkova, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2015-318-v1-1 

Chatterjee, K., Komarkova, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2015-318-v2-1 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2015). Nested weighted automata. IST Austria.https://doi.org/10.15479/AT:IST-2015-170-v2-2 

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2015). Edit distance for pushdown automata. In 42nd International Colloquium (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature.https://doi.org/10.1007/978-3-662-47666-6_10 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-330-v2-1 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-319-v1-1 

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2015). Edit distance for pushdown automata. IST Austria.https://doi.org/10.15479/AT:IST-2015-334-v1-1 

Chatterjee, K., Ibsen-Jensen, R., &; Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-323-v2-2 

Chatterjee, K., Ibsen-Jensen, R., &; Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-323-v1-1 

Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C.,https://doi.org/10.15479/AT:IST-2015-399-v1-1__Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers. IST Austria.https://doi.org/10.15479/AT:IST-2015-399-v1-1 

Chatterjee, K., Chmelik, M., &; Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria.https://doi.org/10.15479/AT:IST-2015-325-v2-1 

Reiter, J., Kanodia, A., Gupta, R., Nowak, M., &; Chatterjee, K. (2015). Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society.https://doi.org/10.1098/rspb.2015.1041 

Reiter, J. (2015). The subclonal evolution of cancer. Institute of Science and Technology Austria.

Benes, N., Daca, P., Henzinger, T. A., Kretinsky, J., &; Nickovic, D. (2015). Complete composition operators for IOCO-testing theory (pp. 101–110). Presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada: ACM.https://doi.org/10.1145/2737166.2737175 

Chatterjee, K., Chmelik, M., &; Daca, P. (2015). CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-015-0235-2 

Chatterjee, K., Ibsen-Jensen, R., Pavlogiannis, A., &; Goyal, P. (2015). Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. Mumbai, India: ACM.https://doi.org/10.1145/2676726.2676979 

Chatterjee, K., Pavlogiannis, A., &; Velner, Y. (2015). Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . Mumbai, India: ACM.https://doi.org/10.1145/2676726.2676968 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs (Vol. 9206, pp. 140–157). Presented at the CAV: Computer Aided Verification, San Francisco, CA, USA: Springer.https://doi.org/10.1007/978-3-319-21690-4_9 

Chatterjee, K., Pavlogiannis, A., Kößler, A., &; Schmid, U. (2015). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In Real-Time Systems Symposium (Vol. 2015, pp. 118–127). Rome, Italy: IEEE.https://doi.org/10.1109/RTSS.2014.9 

Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., &; Pavlogiannis, A. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria.https://doi.org/10.15479/AT:IST-2015-340-v1-1 

Svoreová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cbrná, I., &; Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 259–268). Seattle, WA, United States: ACM.https://doi.org/10.1145/2728606.2728608 

Priklopil, T., &; Chatterjee, K. (2015). Evolution of decisions in population games with sequentially searching individuals. Games. MDPI.https://doi.org/10.3390/g6040413 

Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., &; Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer.https://doi.org/10.1007/978-3-319-21690-4_10 

Aminof, B., Jacobs, S., Khalimov, A., &; Rubin, S. (2014). Parameterized model checking of token-passing systems. In Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-642-54013-4_15 

Chatterjee, K., Henzinger, M. H., Krinninger, S., Loitzenbauer, V., &; Raskin, M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2014.06.031 

Jha, S., Tripakis, S., Seshia, S., &; Chatterjee, K. (2014). Game theoretic secure localization in wireless sensor networks (pp. 85–90). Presented at the IOT: Internet of Things, Cambridge, USA: IEEE.https://doi.org/10.1109/IOT.2014.7030120 

Landau, D., Stewart, C., Reiter, J., Lawrence, M., Sougnez, C., Brown, J.,  Wu, C. (2014). 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. American Society of Hematology.

Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M.,https://doi.org/10.1007/978-3-319-11936-6_8__Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez &; J.-F. Raskin (Eds.), https://doi.org/10.1007/978-3-319-11936-6_8__Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics.https://doi.org/10.1007/978-3-319-11936-6_8 

Hermanns, H., Krdál, J., &; Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan &; D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-662-44584-6_18 

Aminof, B., Kotek, T., Rubin, S., Spegni, F., &; Veith, H. (2014). Parameterized model checking of rendezvous systems. In P. Baldan &; D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 109–124). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-662-44584-6_9 

Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B.,https://doi.org/10.1007/s00236-013-0191-5__Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica. Springer.https://doi.org/10.1007/s00236-013-0191-5 

Esparza, J., &; Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer.https://doi.org/10.1007/978-3-319-08867-9_13 

Brázdil, T., Broeek, V., Chatterjee, K., Forejt, V., &; Kudera, A. (2014). Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-10(1:13)2014 

Grinshpun, A., Phalitnonkiat, P., Rubin, S., &; Tarfulea, A. (2014). Alternating traps in Muller and parity games. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2013.11.032 

Chatterjee, K., Randour, M., &; Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. Springer.https://doi.org/10.1007/s00236-013-0182-6 

Cerny, P., Chmelik, M., Henzinger, T. A., &; Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2014.08.019 

Chatterjee, K., &; Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. ACM.https://doi.org/10.1145/2597631 

Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan &; D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-662-44584-6_37 

Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer.https://doi.org/10.1007/978-3-662-44522-8_1 

Chatterjee, K., &; Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2579821 

Boker, U., Chatterjee, K., Henzinger, T. A., &; Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2629686 

Chatterjee, K., &; Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer.https://doi.org/10.1007/978-3-662-43951-7_11 

Chatterjee, K., Doyen, L., Nain, S., &; Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer.https://doi.org/10.1007/978-3-642-54830-7_16 

Chatterjee, K., Doyen, L., Gimbert, H., &; Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer.https://doi.org/10.1007/978-3-642-54830-7_14 

Chatterjee, K., Ibsen-Jensen, R., &; Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer.https://doi.org/10.1145/2562059.2562141 

Chatterjee, K., Daca, P., &; Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria.https://doi.org/10.15479/AT:IST-2014-153-v2-2 

Chatterjee, K., Daca, P., &; Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria.https://doi.org/10.15479/AT:IST-2014-153-v3-1 

Chatterjee, K., Daca, P., &; Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria.https://doi.org/10.15479/AT:IST-2014-153-v1-1 

Chatterjee, K., &; Doyen, L. (2014). Games with a weak adversary. In Lecture Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer.https://doi.org/10.1007/978-3-662-43951-7_10 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2014). Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria.https://doi.org/10.15479/AT:IST-2014-187-v1-1 

Chatterjee, K., &; Doyen, L. (2014). Games with a weak adversary. IST Austria.https://doi.org/10.15479/AT:IST-2014-176-v1-1 

Chatterjee, K., &; Ibsen-Jensen, R. (2014). The value 1 problem for concurrent mean-payoff games. IST Austria.https://doi.org/10.15479/AT:IST-2014-191-v1-1 

Chatterjee, K., Chmelik, M., Gupta, R., &; Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria.https://doi.org/10.15479/AT:IST-2014-305-v1-1 

Chatterjee, K., Chmelik, M., Gupta, R., &; Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria.https://doi.org/10.15479/AT:IST-2014-305-v2-1 

Chatterjee, K., Kössler, A., Pavlogiannis, A., &; Schmid, U. (2014). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria.https://doi.org/10.15479/AT:IST-2014-300-v1-1 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2014). Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria.https://doi.org/10.15479/AT:IST-2014-314-v1-1 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2014). Nested weighted automata. IST Austria.https://doi.org/10.15479/AT:IST-2014-170-v1-1 

Chatterjee, K., Ibsen-Jensen, R., &; Nowak, M. (2014). The complexity of evolution on graphs. IST Austria.https://doi.org/10.15479/AT:IST-2014-190-v2-2 

Chatterjee, K., Doyen, L., Filiot, E., &; Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-642-54013-4_5 

Chatterjee, K., Pavlogiannis, A., Adlam, B., &; Nowak, M. (2014). The time scale of evolutionary innovation. PLoS Computational Biology. Public Library of Science.https://doi.org/10.1371/journal.pcbi.1003818 

Chatterjee, K., Pavlogiannis, A., Adlam, B., &; Novak, M. (2014). Detailed proofs for “The time scale of evolutionary innovation.”https://doi.org/10.1371/journal.pcbi.1003818.s001__Public Library of Science.https://doi.org/10.1371/journal.pcbi.1003818.s001 

Chatterjee, K., Henzinger, M. H., Krinninger, S., &; Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. Algorithmica. Springer.https://doi.org/10.1007/s00453-013-9843-7 

Chatterjee, K., Chmelik, M., &; Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer.https://doi.org/10.1007/978-3-319-08867-9_31 

Chatterjee, K., Henzinger, T. A., Otop, J., &; Velner, Y. (2014). Quantitative fair simulation games. IST Austria.https://doi.org/10.15479/AT:IST-2014-315-v1-1 

Aminof, B., &; Rubin, S. (2014). First cycle games. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association.https://doi.org/10.4204/EPTCS.146.11 

Chatterjee, K., &; Fijalkow, N. (2013). Infinite-state games with finitary conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CSL.2013.181 

Chatterjee, K., Forejt, V., &; Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer.https://doi.org/10.1007/978-3-642-45221-5_17 

Chatterjee, K., &; Sgall, J. (Eds.). (2013). Mathematical Foundations of Computer Science 2013 (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer.https://doi.org/10.1007/978-3-642-40313-2 

Godhal, Y., Chatterjee, K., &; Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. Springer.https://doi.org/10.1007/s10009-011-0207-9 

Chatterjee, K., Gaiser, A., &; Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer.https://doi.org/10.1007/978-3-642-39799-8_37 

Chatterjee, K., &; aCki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer.https://doi.org/10.1007/978-3-642-39799-8_36 

Chatterjee, K., Alfaro, L., &; Majumdar, R. (2013). The complexity of coverage. International Journal of Foundations of Computer Science. World Scientific Publishing.https://doi.org/10.1142/S0129054113400066 

Novak, S., Chatterjee, K., &; Nowak, M. (2013). Density games. Journal of Theoretical Biology. Elsevier.https://doi.org/10.1016/j.jtbi.2013.05.029 

Chatterjee, K., &; Prabhu, V. (2013). Quantitative timed simulation functions and refinement metrics for real-time systems. In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control (Vol. 1, pp. 273–282). Philadelphia, PA USA: Springer.https://doi.org/10.1145/2461328.2461370 

Chatterjee, K., &; Prabhu, V. (2013). Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2013.04.003 

Chatterjee, K., &; Raman, V. (2013). Assume-guarantee synthesis for digital contract signing. Formal Aspects of Computing. Springer.https://doi.org/10.1007/s00165-013-0283-6 

Chatterjee, K., De Alfaro, L., &; Henzinger, T. A. (2013). Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2012.12.001 

Chmelik, M., &; ehák, V. (2013). Controllable-choice message sequence graphs. Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Znojmo, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-36046-6_12 

Chatterjee, K., De Alfaro, L., Faella, M., Majumdar, R., &; Raman, V. (2013). Code aware resource management. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-012-0170-4 

Chatterjee, K., Henzinger, M. H., Joglekar, M., &; Shah, N. (2013). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-012-0180-2 

Chatterjee, K., Doyen, L., Randour, M., &; Raskin, J. (2013). Looking at mean-payoff and total-payoff through windows. Presented at the ATVA: Automated Technology for Verification and Analysis, Hanoi, Vietnam: Springer.https://doi.org/10.1007/978-3-319-02444-8_10 

Reiter, J., Bozic, I., Chatterjee, K., &; Nowak, M. (2013). TTP: Tool for Tumor Progression. IST Austria.https://doi.org/10.15479/AT:IST-2013-104-v1-1 

Chatterjee, K., Chmelik, M., &; Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CSL.2013.165 

Chatterjee, K., &; Ibsen-Jensen, R. (2013). Qualitative analysis of concurrent mean-payoff games. IST Austria.https://doi.org/10.15479/AT:IST-2013-126-v1-1 

Chatterjee, K., Chmelik, M., &; Tracol, M. (2013). What is decidable about partially observable Markov decision processes with <9-regular objectives. IST Austria.https://doi.org/10.15479/AT:IST-2013-109-v1-1 

Chatterjee, K., &; Ibsen-Jensen, R. (2013). The complexity of ergodic games. IST Austria.https://doi.org/10.15479/AT:IST-2013-127-v1-1 

Chatterjee, K., Doyen, L., Gimbert, H., &; Oualhadj, Y. (2013). Perfect-information stochastic mean-payoff parity games. IST Austria.https://doi.org/10.15479/AT:IST-2013-128-v1-1 

Chatterjee, K., Ibsen-Jensen, R., &; Majumdar, R. (2013). Edit distance for timed automata. IST Austria.https://doi.org/10.15479/AT:IST-2013-144-v1-1 

Chatterjee, K., Henzinger, T. A., Otop, J., &; Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In 13th International Conference on Formal Methods in Computer-Aided Design (pp. 18–25). Portland, OR, United States: IEEE.https://doi.org/10.1109/FMCAD.2013.6679386 

Chatterjee, K., Henzinger, T. A., Otop, J., &; Pavlogiannis, A. (2013). Distributed synthesis for LTL Fragments. IST Austria.https://doi.org/10.15479/AT:IST-2013-130-v1-1 

Chatterjee, K., Doyen, L., Nain, S., &; Vardi, M. (2013). The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria.https://doi.org/10.15479/AT:IST-2013-141-v1-1 

Ahmed, U., Chatterjee, K., &; Gulwani, S. (2013). Automatic generation of alternative starting positions for traditional board games. IST Austria.https://doi.org/10.15479/AT:IST-2013-146-v1-1 

Chatterjee, K., &; Velner, Y. (2013). Hyperplane separation technique for multidimensional mean-payoff games. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentinia: Springer.https://doi.org/10.1007/978-3-642-40184-8_35 

Zagorsky, B., Reiter, J., Chatterjee, K., &; Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . Public Library of Science.https://doi.org/10.1371/journal.pone.0080814.s001 

Chatterjee, K., Chaubal, S., &; Rubin, S. (2013). How to travel between languages. In 7th International Conference on Language and Automata Theory and Applications (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature.https://doi.org/10.1007/978-3-642-37064-9_20 

Zagorsky, B., Reiter, J., Chatterjee, K., &; Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0080814 

Reiter, J., Boei, I., Allen, B., Chatterjee, K., &; Nowak, M. (2013). The effect of one additional driver mutation on tumor progression. Evolutionary Applications. Wiley-Blackwell.https://doi.org/10.1111/eva.12020 

Boei, I., Reiter, J., Allen, B., Antal, T., Chatterjee, K., Shah, P.,https://doi.org/10.7554/eLife.00747__Nowak, M. (2013). Evolutionary dynamics of cancer in response to targeted combination therapy. ELife. eLife Sciences Publications.https://doi.org/10.7554/eLife.00747 

Reiter, J., Boei, I., Chatterjee, K., &; Nowak, M. (2013). TTP: Tool for tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification (Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer.https://doi.org/10.1007/978-3-642-39799-8_6 

Brázdil, T., Chatterjee, K., Forejt, V., &; Kudera, A. (2013). Trading performance for stability in Markov decision processes. In 28th Annual ACM/IEEE Symposium (pp. 331–340). New Orleans, LA, United States: IEEE.https://doi.org/10.1109/LICS.2013.39 

Chatterjee, K., Kößler, A., &; Schmid, U. (2013). Automated analysis of real-time scheduling using graph games. In Proceedings of the 16th International conference on Hybrid systems: Computation and control (pp. 163–172). Philadelphia, PA, United States: ACM.https://doi.org/10.1145/2461328.2461356 

Chatterjee, K., Joglekar, M., &; Shah, N. (2012). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Vol. 18, pp. 461–473). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461 

Chatterjee, K., Randour, M., &; Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny &; I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-32940-1_10 

Chatterjee, K., Zufferey, D., &; Nowak, M. (2012). Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. Elsevier.https://doi.org/10.1016/j.jtbi.2012.02.021 

Cerny, P., Chmelik, M., Henzinger, T. A., &; Radhakrishna, A. (2012). Interface Simulation Distances. In Electronic Proceedings in Theoretical Computer Science (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS.https://doi.org/10.4204/EPTCS.96.3 

Chatterjee, K., Henzinger, T. A., &; Prabhu, V. (2012). Finite automata with time delay blocks. In roceedings of the tenth ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM.https://doi.org/10.1145/2380356.2380370 

Chatterjee, K., Chmelik, M., &; Majumdar, R. (2012). Equivalence of games with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399). Presented at thehttps://doi.org/10.1007/978-3-642-33386-6_30__ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India: Springer.https://doi.org/10.1007/978-3-642-33386-6_30 

Brázdil, B., Chatterjee, K., Kudera, A., &; Novotný, P. (2012). Efficient controller synthesis for consumption games with multiple resource types (Vol. 7358, pp. 23–38). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer.https://doi.org/10.1007/978-3-642-31424-7_8 

Chatterjee, K., &; Raman, V. (2012). Synthesizing protocols for digital contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer.https://doi.org/10.1007/978-3-642-27940-9_11 

Chatterjee, K., &; Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-25929-6_3 

Chatterjee, K. (2012). The complexity of stochastic Müller games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2011.11.004 

Chatterjee, K., &; Majumdar, R. (2012). Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. World Scientific Publishing.https://doi.org/10.1142/S0129054112400308 

Chatterjee, K., &; Henzinger, T. A. (2012). A survey of stochastic <9 regular games. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2011.05.002 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-012-0164-2 

Chatterjee, K., &; Doyen, L. (2012). Energy parity games. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2012.07.038 

Kruckman, A., Rubin, S., Sheridan, J., &; Zax, B. (2012). A Myhill Nerode theorem for automata with advice. In Proceedings GandALF 2012 (Vol. 96, pp. 238–246). Napoli, Italy: Open Publishing Association.https://doi.org/10.4204/EPTCS.96.18 

Rabinovich, A., &; Rubin, S. (2012). Interpretations in trees with countably many branches. Presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia: IEEE.https://doi.org/10.1109/LICS.2012.65 

Chatterjee, K., Chaubal, S., &; Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CSL.2012.167 

Chatterjee, K., &; Henzinger, M. H. (2012). An O(n2) time algorithm for alternating Büchi games. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1386–1399). Kyoto, Japan: SIAM.https://doi.org/10.1137/1.9781611973099.109 

Chatterjee, K., &; Velner, Y. (2012). Mean payoff pushdown games. 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.30 

Chatterjee, K., &; Velner, Y. (2012). Mean-payoff pushdown games. IST Austria.https://doi.org/10.15479/AT:IST-2012-0002 

Chatterjee, K., Chaubal, S., &; Kamath, P. (2012). Faster algorithms for alternating refinement relations. IST Austria.https://doi.org/10.15479/AT:IST-2012-0001 

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 

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 

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 

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 

Diaz Jr, L., Williams, R., Wu, J., Kinde, I., Hecht, J., Berlin, J.,https://doi.org/10.1038/nature11219__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 

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 

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 

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 

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 

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 

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 

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 

Chatterjee, K., Henzinger, T. A., &; Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.

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 

Chatterjee, K., De Alfaro, L., &; Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. ArXiv.

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 

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 

Brázdil, T., Broeek, V., Chatterjee, K., Forejt, V., &; Kudera, 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 

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 

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 

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 

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 

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 

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 

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 

Chatterjee, K. (2011). Bounded rationality in concurrent parity games. IST Austria.https://doi.org/10.15479/AT:IST-2011-0008 

Chatterjee, K. (2011). Robustness of structurally equivalent concurrent parity games. IST Austria.https://doi.org/10.15479/AT:IST-2011-0006 

Chatterjee, K. (2011). Bounded rationality in concurrent parity games. arXiv. ArXiv.

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 

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 

Chatterjee, K., &; Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria.https://doi.org/10.15479/AT:IST-2011-0004 

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 

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 

Chatterjee, K., &; Doyen, L. (2011). Energy and mean-payoff parity Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2011-0001 

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 

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 

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 

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 

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 

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 

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 

Chatterjee, K., &; Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at thehttps://doi.org/10.1007/978-3-642-14162-1_50__ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer.https://doi.org/10.1007/978-3-642-14162-1_50 

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 

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 

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 

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 

Chatterjee, K., Henzinger, T. A., &; Piterman, N. (2010). Strategy logic. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2009.07.004 

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 

Cristau, J., David, C., &; Horn, F. (2010). How do we remember the past in randomised strategies? . In Proceedings of GandALF 2010 (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association.https://doi.org/10.4204/EPTCS.25.7 

Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., &; Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria.https://doi.org/10.15479/AT:IST-2010-0004 

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer.https://doi.org/10.1007/978-3-642-14295-6_57 

Chatterjee, K., &; Fijalkow, N. (2010). Topological, automata-theoretic and logical characterization of finitary languages. IST Austria.https://doi.org/10.15479/AT:IST-2010-0002 

Chatterjee, K., &; Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer.https://doi.org/10.1007/978-3-642-15643-4_1 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-15155-2_24 

Chatterjee, K., &; Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS.https://doi.org/10.4204/EPTCS.25.6 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). Probabilistic weighted automata (Vol. 5710, pp. 244–258). Presented at the CONCUR: Concurrency Theory, Bologna, Italy: Springer.https://doi.org/10.1007/978-3-642-04081-8_17 

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2009). Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/1614431.1614432 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). Alternating weighted automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland: Springer.https://doi.org/10.1007/978-3-642-03409-1_2 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). A survey of stochastic games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer.https://doi.org/10.1007/978-3-642-02930-1_1 

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer.https://doi.org/10.1007/978-3-642-03816-7_4 

Bloem, R., Chatterjee, K., Henzinger, T. A., &; Jobstmann, B. (2009). Better quality in synthesis through quantitative objectives (Vol. 5643, pp. 140–156). Presented at the CAV: Computer Aided Verification, Grenoble, France: Springer.https://doi.org/10.1007/978-3-642-02658-4_14 

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Radhakrishna, A. (2009). Gist: A solver for probabilistic games. IST Austria.https://doi.org/10.15479/AT:IST-2009-0003 

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria.https://doi.org/10.15479/AT:IST-2009-0002 

Chatterjee, K. (2009). Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria.https://doi.org/10.15479/AT:IST-2009-0004 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). Qualitative analysis of partially-observable Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2009-0001