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.

457 Publications


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
[Published Version] View | Files available | DOI
 

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
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10847 | OA
Tomášek, P., Horák, K., Aradhye, A., Bošanský, 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
[Published Version] View | DOI | Download Published Version (ext.)
 

2021 | Conference Paper | IST-REx-ID: 9296 | OA
Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … 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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2021 | Book Chapter | IST-REx-ID: 9403 | OA
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.
[Published Version] View | Download Published Version (ext.)
 

2021 | Conference Paper | IST-REx-ID: 12767 | OA
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
[Published Version] View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10667 | OA
Lechner, M., Žikelić, Ð., 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
[Published Version] View | Files available | DOI | Download Published Version (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
[Published Version] View | Files available | DOI | WoS
 

2021 | Journal Article | IST-REx-ID: 9381 | OA
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
[Published Version] View | Files available | DOI | WoS
 

2021 | Journal Article | IST-REx-ID: 9640 | OA
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
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

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

2021 | Conference Paper | IST-REx-ID: 9645 | OA
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
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

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

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
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10055 | OA
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
[Published Version] View | Files available | DOI | WoS
 

2021 | Conference Paper | IST-REx-ID: 9987 | OA
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
[Published Version] View | Files available | DOI | WoS | 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
[Published Version] View | Files available | DOI | arXiv
 

2021 | Thesis | IST-REx-ID: 10199 | OA
Toman, V. (2021). Improved verification techniques for concurrent systems. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10199
[Published Version] View | Files available | DOI
 

2021 | Journal Article | IST-REx-ID: 9293 | OA
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Journal Article | IST-REx-ID: 9393 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Conference Paper | IST-REx-ID: 9644 | OA
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10414 | OA
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Thesis | IST-REx-ID: 8934 | OA
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
[Published Version] View | Files available | DOI
 

2021 | Thesis | IST-REx-ID: 10293 | OA
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
[Published Version] View | Files available | DOI
 

2021 | Journal Article | IST-REx-ID: 9997 | OA
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
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

2021 | Journal Article | IST-REx-ID: 9402 | OA
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
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

2020 | Conference Paper | IST-REx-ID: 7346 | OA
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
[Preprint] View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8600 | OA
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
[Published Version] View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.22
[Published Version] View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8534 | OA
Jecker, I. R., Kupferman, O., & Mazzocchi, N. (2020). Unary prime languages. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.51
[Published Version] View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 7955 | OA
Ashok, P., Chatterjee, K., Kretinsky, J., Weininger, M., & Winkler, T. (2020). Approximating values of generalized-reachability stochastic games. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 102–115). Saarbrücken, Germany: Association for Computing Machinery. https://doi.org/10.1145/3373718.3394761
[Published Version] View | Files available | DOI | WoS | arXiv
 

2020 | Journal Article | IST-REx-ID: 8767 | OA
Kaveh, K., McAvoy, A., Chatterjee, K., & Nowak, M. A. (2020). The Moran process on 2-chromatic graphs. PLOS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1008402
[Published Version] View | Files available | DOI | WoS
 

2020 | Journal Article | IST-REx-ID: 8789 | OA
Kleshnina, M., Streipert, S., Filar, J., & Chatterjee, K. (2020). Prioritised learning in snowdrift-type games. Mathematics. MDPI. https://doi.org/10.3390/math8111945
[Published Version] View | Files available | DOI | WoS
 

2020 | Journal Article | IST-REx-ID: 8788
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
View | DOI | WoS
 

2020 | Journal Article | IST-REx-ID: 9197
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
[Preprint] View | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 7343 | OA
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
[Published Version] View | Files available | DOI | WoS
 

2020 | Research Data Reference | IST-REx-ID: 13060 | OA
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
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2020 | Conference Paper | IST-REx-ID: 8193
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.
View | Files available
 

2020 | Conference Paper | IST-REx-ID: 8272 | OA
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
[Published Version] View | Files available | DOI | WoS | arXiv
 

2020 | Journal Article | IST-REx-ID: 8671 | OA
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
[Submitted Version] View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 7212 | OA
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
[Published Version] View | Files available | DOI | WoS | arXiv
 

2020 | Thesis | IST-REx-ID: 7196 | OA
Tkadlec, J. (2020). A role of graphs in evolutionary processes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7196
[Published Version] View | Files available | DOI
 

2020 | Research Data Reference | IST-REx-ID: 9814 | OA
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
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2020 | Conference Paper | IST-REx-ID: 8324 | OA
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
[Published Version] View | Files available | DOI | arXiv
 

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

2020 | Conference Paper | IST-REx-ID: 15082 | OA
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.
[Published Version] View | Download Published Version (ext.)
 

2020 | Conference Paper | IST-REx-ID: 7810 | OA
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
[Published Version] View | Files available | DOI | WoS
 

2020 | Conference Paper | IST-REx-ID: 8728 | OA
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
[Submitted Version] View | Files available | DOI | WoS
 

2020 | Conference Paper | IST-REx-ID: 8089 | OA
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2020 | Journal Article | IST-REx-ID: 6918 | OA
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
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications