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.

475 Publications


2019 | Published | Journal Article | IST-REx-ID: 7014 | OA
Non-polynomial worst-case analysis of recursive programs
K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages and Systems 41 (2019).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Published | Journal Article | IST-REx-ID: 7158 | OA
Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019).
[Submitted Version] View | Files available | DOI | WoS
 

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

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

2018 | Published | Conference Paper | IST-REx-ID: 141 | OA
Symbolic algorithms for graphs and Markov decision processes with fairness objectives
K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer, 2018, pp. 178–197.
[Published Version] View | Files available | DOI | WoS
 

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

2018 | Published | Conference Paper | IST-REx-ID: 10883 | OA
Quasipolynomial set-based symbolic algorithms for parity games
K. Chatterjee, W. Dvořák, M. Henzinger, A. Svozil, in:, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair, 2018, pp. 233–253.
[Published Version] View | Files available | DOI | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 24 | OA
Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives
K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 25 | OA
Goal-HSVI: Heuristic search value iteration for goal-POMDPs
K. Horák, B. Bošanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 

2018 | Published | Journal Article | IST-REx-ID: 293 | OA
The signal-burying game can explain why we obscure positive traits and good deeds
M. Hoffman, C. Hilbe, M. Nowak, Nature Human Behaviour 2 (2018) 397–404.
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 297 | OA
Strategy representation by decision trees in reactive synthesis
T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp. 385–407.
[Published Version] View | Files available | DOI | WoS
 

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

2018 | Published | Conference Paper | IST-REx-ID: 311 | OA
Quantitative analysis of smart contracts
K. Chatterjee, A.K. Goharshady, Y. Velner, in:, Springer, 2018, pp. 739–767.
[Published Version] View | Files available | DOI
 

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

2018 | Conference Paper | IST-REx-ID: 5679 | OA
New approaches for almost-sure termination of probabilistic programs
M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 5751 | OA
Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M.A. Nowak, Communications Biology 1 (2018).
[Published Version] View | Files available | DOI | WoS
 

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

2018 | Published | Conference Paper | IST-REx-ID: 5967 | OA
The Big Match with a clock and a bit of memory
K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM Press, 2018, pp. 149–150.
[Submitted Version] View | Files available | DOI | WoS
 

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

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

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Export / Embed