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 
LibreCat: https://research-explorer.ista.ac.at/record/8272
DOI: 10.1007/978-3-030-53291-8_21
WoS: 000695272500021
arXiv: 2005.04018

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 
LibreCat: https://research-explorer.ista.ac.at/record/8671
DOI: 10.29252/ijmsi.15.2.117
arXiv: 1805.10672

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 
LibreCat: https://research-explorer.ista.ac.at/record/7212
DOI: 10.1371/journal.pcbi.1007494
WoS: 000510916500025
arXiv: 1906.02785

Tkadlec, J. (2020). A role of graphs in evolutionary processes. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:7196 
LibreCat: https://research-explorer.ista.ac.at/record/7196
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/9814
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/8324
DOI: 10.1145/3371093
arXiv: 1902.04744

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 
LibreCat: https://research-explorer.ista.ac.at/record/15055
DOI: 10.1609/aaai.v34i06.6531
arXiv: 2002.12086

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.
LibreCat: https://research-explorer.ista.ac.at/record/15082

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 
LibreCat: https://research-explorer.ista.ac.at/record/7810
DOI: 10.1007/978-3-030-44914-8_5
WoS: 000681656800005

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 
LibreCat: https://research-explorer.ista.ac.at/record/8728
DOI: 10.1007/978-3-030-59152-6_14
WoS: 000723555700014

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 
LibreCat: https://research-explorer.ista.ac.at/record/8089
DOI: 10.1145/3385412.3385969
WoS: 000614622300045
arXiv: 1902.04373

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 
LibreCat: https://research-explorer.ista.ac.at/record/6918
DOI: 10.1016/j.ress.2019.106665
WoS: 000501641400050
arXiv: 1712.09692

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 
LibreCat: https://research-explorer.ista.ac.at/record/6887
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/6885
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/6889
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/6884
DOI: 10.4230/LIPICS.MFCS.2019.11
arXiv: 1905.03835

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 
LibreCat: https://research-explorer.ista.ac.at/record/5948
DOI: 10.1007/978-3-030-11245-5_22
WoS: 000931943000022
arXiv: 1701.02944

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 
LibreCat: https://research-explorer.ista.ac.at/record/6462
DOI: 10.1007/978-3-030-25540-4_36
WoS: 000491468000036

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 
LibreCat: https://research-explorer.ista.ac.at/record/6836
DOI: 10.1038/s41586-019-1488-5
WoS: 000482219600045

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 
LibreCat: https://research-explorer.ista.ac.at/record/6942
DOI: 10.1007/978-3-030-30281-8_7
WoS: 000679281300007
arXiv: 1906.08178