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 
LibreCat: https://research-explorer.ista.ac.at/record/9640
DOI: 10.1038/s41467-021-24271-w
WoS: 000671752100003
PMID: 34188036

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 
LibreCat: https://research-explorer.ista.ac.at/record/9646
DOI: 10.1145/3453483.3454102
WoS: 000723661700076
arXiv: 2011.14617

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 
LibreCat: https://research-explorer.ista.ac.at/record/9645
DOI: 10.1145/3453483.3454076
WoS: 000723661700050

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 
LibreCat: https://research-explorer.ista.ac.at/record/10002
DOI: 10.1109/LICS52264.2021.9470739
WoS: 000947350400089
arXiv: 2104.07466

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 
LibreCat: https://research-explorer.ista.ac.at/record/10004
DOI: 10.1109/LICS52264.2021.9470595
WoS: 000947350400036
arXiv: 2104.07278

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 
LibreCat: https://research-explorer.ista.ac.at/record/10055
DOI: 10.4230/LIPIcs.STACS.2021.44
WoS: 000635691700044

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 
LibreCat: https://research-explorer.ista.ac.at/record/9987
DOI: 10.1007/978-3-030-81685-8_16
WoS: 000698732400016
arXiv: 2105.06424

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 
LibreCat: https://research-explorer.ista.ac.at/record/10191
DOI: 10.1145/3485541
arXiv: 2011.11763

Toman, V. (2021). Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:10199 
LibreCat: https://research-explorer.ista.ac.at/record/10199
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/9293
DOI: 10.1016/j.artint.2021.103499
WoS: 000657537500003
arXiv: 1804.07031

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 
LibreCat: https://research-explorer.ista.ac.at/record/9393
DOI: 10.1007/s10703-021-00373-5
WoS: 000645490300001
arXiv: 1504.07384

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 
LibreCat: https://research-explorer.ista.ac.at/record/9644
DOI: 10.1145/3453483.3454093
WoS: 000723661700067
arXiv: 2104.01189

Chatterjee, K., Goharshady, A. K., Novotný, P., &; Zikelic, D. (2021). RevTerm. Association for Computing Machinery.https://doi.org/10.1145/3410304 
LibreCat: https://research-explorer.ista.ac.at/record/15284
DOI: 10.1145/3410304

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 
LibreCat: https://research-explorer.ista.ac.at/record/10414
DOI: 10.1007/978-3-030-90870-6_33
WoS: 000758218600033
arXiv: 2108.02188

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 
LibreCat: https://research-explorer.ista.ac.at/record/8934
DOI: 10.15479/AT:ISTA:8934

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 
LibreCat: https://research-explorer.ista.ac.at/record/10293
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/9997
DOI: 10.1038/s41598-021-96932-1
WoS: 000692406400018
PMID: 34465830

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 
LibreCat: https://research-explorer.ista.ac.at/record/9402
DOI: 10.1038/s41562-021-01114-8
WoS: 000650304000002
PMID: 33986519

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 
LibreCat: https://research-explorer.ista.ac.at/record/7346
DOI: 10.4230/LIPIcs.OPODIS.2019.21
arXiv: 1906.00110

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 
LibreCat: https://research-explorer.ista.ac.at/record/8600
DOI: 10.4230/LIPIcs.CONCUR.2020.23
arXiv: 2007.08917