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