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.

345 Publications


2019 | Conference Paper | IST-REx-ID: 6889 | OA
K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 6942 | OA
P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, and V. Toman, “Strategy representation by decision trees with linear classifiers,” in 16th International Conference on Quantitative Evaluation of Systems, Glasgow, United Kingdom, 2019, vol. 11785, pp. 109–128.
View | DOI | Download Preprint (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 7014
K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 2019.
View | Files available | DOI | arXiv
 

2019 | Journal Article | IST-REx-ID: 7158
K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 2019.
View | DOI
 

2019 | Conference Paper | IST-REx-ID: 7183 | OA
T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, and D. Velan, “Deciding fast termination for probabilistic VASS with nondeterminism,” in International Symposium on Automated Technology for Verification and Analysis, Taipei, Taiwan, 2019, vol. 11781, pp. 462–478.
View | DOI | Download Preprint (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 7210 | OA
J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Population structure determines the tradeoff between fixation probability and fixation time,” Communications Biology, vol. 2, 2019.
View | Files available | DOI | PubMed | Europe PMC
 

2019 | Conference Paper | IST-REx-ID: 7402 | OA
K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” in 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver, BC, Canada, 2019, pp. 1–13.
View | DOI | Download Preprint (ext.) | arXiv
 

2019 | Preprint | IST-REx-ID: 7950 | OA
A. Biniaz et al., “Token swapping on trees,” arXiv:1903.06981. ArXiv.
View | Files available | Download Preprint (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 6836 | OA
O. P. Hauser, C. Hilbe, K. Chatterjee, and M. A. Nowak, “Social dilemmas among unequals,” Nature, vol. 572, no. 7770, pp. 524–527, 2019.
View | Files available | DOI
 

2018 | Journal Article | IST-REx-ID: 198 | OA
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140, 2018.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 24 | OA
K. Chatterjee, A. Elgyütt, P. Novotny, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.
View | DOI | Download Preprint (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 25
K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.
View | 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, 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, 2018.
View | Files available | DOI
 

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

2018 | Journal Article | IST-REx-ID: 5751 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” Communications Biology, vol. 1, no. 1, 2018.
View | Files available | DOI
 

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 | Conference Paper | IST-REx-ID: 5967 | OA
K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 5977 | OA
K. Chatterjee, H. Fu, A. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.
View | DOI | Download Preprint (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 5993 | OA
K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, p. 7, 2018.
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications