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.

401 Publications


2022 | Journal Article | IST-REx-ID: 10731 | OA
J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Infection dynamics of COVID-19 virus under lockdown and reopening,” Scientific Reports, vol. 12, no. 1. Springer Nature, 2022.
View | Files available | DOI | arXiv
 

2022 | Journal Article | IST-REx-ID: 10770 | OA
T. Graham, M. Kleshnina, and J. A. Filar, “Where do mistakes lead? A survey of games with incompetent players,” Dynamic Games and Applications. Springer Nature; Birkhäuser, 2022.
View | Files available | DOI
 

2022 | Journal Article | IST-REx-ID: 9311 | OA
K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies in POMDPs with long-run average objectives,” Mathematics of Operations Research, vol. 47, no. 1. Institute for Operations Research and the Management Sciences, pp. 100–119, 2022.
View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Journal Article | IST-REx-ID: 11402 | OA
K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” Journal of Computer and System Sciences, vol. 129. Elsevier, pp. 1–21, 2022.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 10602 | OA
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” Acta Informatica. Springer Science and Business Media LLC, 2021.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10629 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10630 | OA
E. Arrighi et al., “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, Virtual, 2021, vol. 213.
View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10694 | OA
G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Virtual, 2021, pp. 617–636.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10847 | OA
P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in 30th International Joint Conference on Artificial Intelligence, Virtual, Online, 2021, pp. 4182–4189.
View | DOI | Download Published Version (ext.)
 

2021 | Journal Article | IST-REx-ID: 8793 | OA
M. Zeiner, U. Schmid, and K. Chatterjee, “Optimal strategies for selecting coordinators,” Discrete Applied Mathematics, vol. 289, no. 1. Elsevier, pp. 392–415, 2021.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10002 | OA
K. Chatterjee, W. Dvorak, M. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10004 | OA
K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 10191 | OA
T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.
View | Files available | DOI | arXiv
 

2021 | Thesis | IST-REx-ID: 10293
L. Schmid, “Evolution of cooperation via (in)direct reciprocity under imperfect information,” IST Austria, 2021.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10414 | OA
K. Chatterjee, E. K. Goharshady, P. Novotný, J. Zárevúcky, and Đ. Žikelić, “On lexicographic proof rules for probabilistic termination,” in 24th International Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 9293
K. Chatterjee, W. Dvořák, M. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” Artificial Intelligence, vol. 297, no. 8. Elsevier, 2021.
View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 9296 | OA
O. Aichholzer et al., “On compatible matchings,” in 15th International Conference on Algorithms and Computation, Yangon, Myanmar, 2021, vol. 12635, pp. 221–233.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 9393
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” Formal Methods in System Design. Springer, 2021.
View | DOI
 

2021 | Journal Article | IST-REx-ID: 9402
L. Schmid, K. Chatterjee, C. Hilbe, and M. A. Nowak, “A unified framework of direct and indirect reciprocity,” Nature Human Behaviour. Springer Nature, 2021.
View | Files available | DOI
 

2021 | Book Chapter | IST-REx-ID: 9403 | OA
L. Schmid and C. Hilbe, “The evolution of strategic ignorance in strategic interaction,” in Deliberate Ignorance: Choosing Not To Know, vol. 29, R. Hertwig and C. Engel, Eds. MIT Press, 2021, pp. 139–152.
View | Download Published Version (ext.)
 

2021 | Journal Article | IST-REx-ID: 9640 | OA
J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Fast and strong amplifiers of natural selection,” Nature Communications, vol. 12, no. 1. Springer Nature, 2021.
View | Files available | DOI | PubMed | Europe PMC
 

2021 | Conference Paper | IST-REx-ID: 9644 | OA
K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “Proving non-termination by program reversal,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1033–1048.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 9645 | OA
A. Asadi, K. Chatterjee, H. Fu, A. K. Goharshady, and M. Mahdavi, “Polynomial reachability witnesses via Stellensätze,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 772–787.
View | DOI | Download Submitted Version (ext.)
 

2021 | Conference Paper | IST-REx-ID: 9646 | OA
J. Wang, Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Quantitative analysis of assertion violations in probabilistic programs,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1171–1186.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 9997 | OA
L. Schmid, P. Shati, C. Hilbe, and K. Chatterjee, “The evolution of indirect reciprocity under action and assessment generosity,” Scientific Reports, vol. 11, no. 1. Springer Nature, 2021.
View | Files available | DOI | PubMed | Europe PMC
 

2021 | Conference Paper | IST-REx-ID: 9987 | OA
P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366.
View | Files available | DOI | arXiv
 

2021 | Thesis | IST-REx-ID: 10199 | OA
V. Toman, “Improved verification techniques for concurrent systems,” IST Austria, 2021.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10052 | OA
I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in 32nd International Conference on Concurrency Theory, Paris, France, 2021, vol. 203.
View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10075 | OA
S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 2021, vol. 202.
View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10054 | OA
K. Chatterjee, M. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in 48th International Colloquium on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10055 | OA
I. R. Jecker, “A Ramsey theorem for finite monoids,” in 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 2021, vol. 187.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10667 | OA
M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in 35th Conference on Neural Information Processing Systems, Virtual, 2021.
View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2021 | Thesis | IST-REx-ID: 8934 | OA
A. K. Goharshady, “Parameterized and algebro-geometric advances in static program analysis,” IST Austria, 2021.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 7955 | OA
P. Ashok, K. Chatterjee, J. Kretinsky, M. Weininger, and T. Winkler, “Approximating values of generalized-reachability stochastic games,” in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , Saarbrücken, Germany, 2020, pp. 102–115.
View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8193
K. Chatterjee, M. Chmelik, D. Karkhanis, P. Novotný, and A. Royer, “Multiple-environment Markov decision processes: Efficient analysis and applications,” in Proceedings of the 30th International Conference on Automated Planning and Scheduling, Nancy, France, 2020, vol. 30, pp. 48–56.
View | Files available
 

2020 | Conference Paper | IST-REx-ID: 8272 | OA
K. Chatterjee, J. P. Katoen, M. Weininger, and T. Winkler, “Stochastic games with lexicographic reachability-safety objectives,” in International Conference on Computer Aided Verification, 2020, vol. 12225, pp. 398–420.
View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8533 | OA
K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified game of life: Algorithms and complexity,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.
View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8534 | OA
I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 8600 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average problems for vector addition systems with states,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.
View | Files available | DOI | arXiv
 

2020 | Thesis | IST-REx-ID: 7196 | OA
J. Tkadlec, “A role of graphs in evolutionary processes,” IST Austria, 2020.
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 7212 | OA
J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Limits on amplifiers of natural selection under death-Birth updating,” PLoS computational biology, vol. 16. PLoS, 2020.
View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 7343 | OA
B. Milutinovic, M. Stock, A. V. Grasse, E. Naderlinger, C. Hilbe, and S. Cremer, “Social immunity modulates competition between coinfecting pathogens,” Ecology Letters, vol. 23, no. 3. Wiley, pp. 565–574, 2020.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 7346 | OA
L. Schmid, K. Chatterjee, and S. Schmid, “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, Neuchâtel, Switzerland, 2020, vol. 153.
View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 8671 | OA
A. Shakiba, A. K. Goharshady, M. R. Hooshmandasl, and M. Alambardar Meybodi, “A note on belief structures and s-approximation spaces,” Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2. ACECR Tarbiat Modares University, pp. 117–128, 2020.
View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 8767 | OA
K. Kaveh, A. McAvoy, K. Chatterjee, and M. A. Nowak, “The Moran process on 2-chromatic graphs,” PLOS Computational Biology, vol. 16, no. 11. Public Library of Science, 2020.
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 8788
A. Pavlogiannis, N. Schaumberger, U. Schmid, and K. Chatterjee, “Precedence-aware automated competitive analysis of real-time scheduling,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11. IEEE, pp. 3981–3992, 2020.
View | DOI
 

2020 | Journal Article | IST-REx-ID: 8789 | OA
M. Kleshnina, S. Streipert, J. Filar, and K. Chatterjee, “Prioritised learning in snowdrift-type games,” Mathematics, vol. 8, no. 11. MDPI, 2020.
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 9197
G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.
View | DOI | arXiv
 

2020 | Research Data Reference | IST-REx-ID: 9814
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners.” Royal Society, 2020.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 7810 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal and perfectly parallel algorithms for on-demand data-flow analysis,” in European Symposium on Programming, Dublin, Ireland, 2020, vol. 12075, pp. 112–140.
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications