Please note that IST 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.

376 Publications


2018 | Conference Paper | IST-REx-ID: 143 | OA
T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, and F. Zuleger, “Efficient algorithms for asymptotic bounds on termination time in VASS,” presented at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033, pp. 185–194.
View | DOI | Download Preprint (ext.)
 

2018 | Journal Article | IST-REx-ID: 157 | OA
C. Hilbe, Š. Šimsa, K. Chatterjee, and M. Nowak, “Evolution of cooperation in stochastic games,” Nature, vol. 559, no. 7713. Nature Publishing Group, pp. 246–249, 2018.
View | Files available | DOI
 

2018 | Journal Article | IST-REx-ID: 419 | OA
C. Hilbe, K. Chatterjee, and M. Nowak, “Partners and rivals in direct reciprocity,” Nature Human Behaviour, vol. 2. Nature Publishing Group, pp. 469–477, 2018.
View | Files available | DOI
 

2018 | Journal Article | IST-REx-ID: 454 | OA
J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, and M. Nowak, “Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness,” Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 310 | OA
K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States, 2018, pp. 2341–2356.
View | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications