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 
LibreCat: https://research-explorer.ista.ac.at/record/8788
DOI: 10.1109/TCAD.2020.3012803
WoS: 000587712700069

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 
LibreCat: https://research-explorer.ista.ac.at/record/9197
DOI: 10.1609/aaai.v34i02.5546
arXiv: 1911.08360

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 
LibreCat: https://research-explorer.ista.ac.at/record/7343
DOI: 10.1111/ele.13458
WoS: 000507515900001

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

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