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


2018 | Journal Article | IST-REx-ID: 454 | OA
Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. 2018. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 9(1), 555.
[Published Version] View | Files available | DOI | WoS
 

2018 | Conference Paper | IST-REx-ID: 143 | OA
Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. 2018. Efficient algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 

2018 | Journal Article | IST-REx-ID: 157 | OA
Hilbe C, Šimsa Š, Chatterjee K, Nowak M. 2018. Evolution of cooperation in stochastic games. Nature. 559(7713), 246–249.
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Conference Paper | IST-REx-ID: 310 | OA
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Conference Paper | IST-REx-ID: 5679 | OA
Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275, 181–201.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications