Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

414 Publications


2022 | Journal Article | IST-REx-ID: 10731 | OA
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
View | Files available | DOI | arXiv
 

2022 | Journal Article | IST-REx-ID: 9311 | OA
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
View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Journal Article | IST-REx-ID: 11402 | OA
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
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2022 | Conference Paper | IST-REx-ID: 11459 | OA
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
View | Files available | DOI | arXiv
 

2022 | Journal Article | IST-REx-ID: 10770 | OA
Graham, T., Kleshnina, M., & Filar, J. A. (2022). 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
View | Files available | DOI
 

2022 | Journal Article | IST-REx-ID: 11938 | OA
Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00591
View | Files available | DOI | arXiv
 

2022 | Conference Paper | IST-REx-ID: 12000 | OA
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
View | Files available | DOI
 

2022 | Journal Article | IST-REx-ID: 12280
Schmid, Laura, Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology 18 (6). 2022
View | DOI
 

2022 | Journal Article | IST-REx-ID: 12257
Chatterjee, Krishnendu, Social balance on networks: Local minima and best-edge dynamics. Physical Review E 106 (3). 2022
View | DOI
 

2022 | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi, Ali, Algorithms and hardness results for computing cores of Markov chains. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 250. 2022
View | Files available | DOI
 

2022 | Conference Paper | IST-REx-ID: 12101 | OA
Chatterjee, Krishnendu, Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 250. 2022
View | Files available | DOI
 

2022 | Conference Paper | IST-REx-ID: 12170
Meggendorfer, Tobias, PET – A partial exploration tool for probabilistic verification. 20th International Symposium on Automated Technology for Verification and Analysis 13505. 2022
View | DOI
 

2021 | Journal Article | IST-REx-ID: 10602 | OA
Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2021). Index appearance record with preorders. Acta Informatica. Springer Science and Business Media LLC. https://doi.org/10.1007/s00236-021-00412-y
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10629 | OA
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
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10630 | OA
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
View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10694 | OA
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
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 8793 | OA
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
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10004 | OA
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
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 10191 | OA
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
View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., & Žikelić, Đ. (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
View | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications