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.

400 Publications


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

2022 | Journal Article | IST-REx-ID: 10770 | OA
Where do mistakes lead? A survey of games with incompetent players
T. Graham, M. Kleshnina, J.A. Filar, Dynamic Games and Applications (2022).
View | Files available | DOI
 

2022 | Journal Article | IST-REx-ID: 9311 | OA
Finite-memory strategies in POMDPs with long-run average objectives
K. Chatterjee, R.J. Saona Urmeneta, B. Ziliotto, Mathematics of Operations Research 47 (2022) 100–119.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 10602 | OA
Index appearance record with preorders
J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, Acta Informatica (2021).
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10629 | OA
Quantitative verification on product graphs of small treewidth
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10630 | OA
On the complexity of intersection non-emptiness for star-free language classes
E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
View | Files available | DOI | arXiv
 

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

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

2021 | Journal Article | IST-REx-ID: 8793 | OA
Optimal strategies for selecting coordinators
M. Zeiner, U. Schmid, K. Chatterjee, Discrete Applied Mathematics 289 (2021) 392–415.
View | Files available | DOI
 

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

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

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

2021 | Thesis | IST-REx-ID: 10293
Evolution of cooperation via (in)direct reciprocity under imperfect information
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
On lexicographic proof rules for probabilistic termination
K. Chatterjee, E.K. Goharshady, P. Novotný, J. Zárevúcky, Đ. Žikelić, in:, 24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.
View | DOI | Download Preprint (ext.) | arXiv
 

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

2021 | Conference Paper | IST-REx-ID: 9296 | OA
On compatible matchings
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and Computation, Springer Nature, 2021, pp. 221–233.
View | DOI | Download Preprint (ext.) | arXiv
 

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

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

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

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

Filters and Search Terms

department=KrCh

Search

Filter Publications