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.

459 Publications


2018 | Book Chapter | IST-REx-ID: 59
R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Model Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.
View | DOI
 

2018 | Book Chapter | IST-REx-ID: 86 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161.
[Submitted Version] 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.
[Published Version] View | Files available | DOI | WoS
 

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

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.
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Conference Paper | IST-REx-ID: 310 | OA
K. Chatterjee, W. Dvorák, M. H. 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

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

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.
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Conference Paper | IST-REx-ID: 79 | OA
S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Conference Paper | IST-REx-ID: 297 | OA
T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.
[Published Version] View | Files available | DOI | WoS
 

Filters and Search Terms

department=KrCh

Search

Filter Publications