K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, vol. Part 7772, pp. 400–408.
LibreCat: https://research-explorer.ista.ac.at/record/6490
DOI: 10.1145/3297280.3297322
WoS: 000474685800052

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. ACM, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/7158
DOI: 10.1145/3363525
WoS: 000564108400004

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. ACM, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/7014
DOI: 10.1145/3339984
WoS: 000564108400001
arXiv: 1705.00317

K. Chatterjee, W. Dvoák, M. H. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253.
LibreCat: https://research-explorer.ista.ac.at/record/10883
DOI: 10.29007/5z5k
arXiv: 1909.04983

S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.
LibreCat: https://research-explorer.ista.ac.at/record/325
DOI: 10.1145/3158122
arXiv: 1709.04037

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.
LibreCat: https://research-explorer.ista.ac.at/record/59
DOI: 10.1007/978-3-319-10575-8_27

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.
LibreCat: https://research-explorer.ista.ac.at/record/86
DOI: 10.1007/978-3-319-95246-8_9

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.
LibreCat: https://research-explorer.ista.ac.at/record/454
DOI: 10.1038/s41467-017-02721-8
WoS: 000424318200001

T. Brázdil, K. Chatterjee, A. Kudera, 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. 8033, pp. 185–194.
LibreCat: https://research-explorer.ista.ac.at/record/143
DOI: 10.1145/3209108.3209191
WoS: 000545262800020

C. Hilbe, S. Simsa, K. Chatterjee, and M. Nowak, “Evolution of cooperation in stochastic games,” Nature, vol. 559, no. 7713. Nature Publishing Group, pp. 246–249, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/157
DOI: 10.1038/s41586-018-0277-x
WoS: 000438240900054

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.
LibreCat: https://research-explorer.ista.ac.at/record/310
DOI: 10.1137/1.9781611975031.151
WoS: 000483921200152
arXiv: 1711.09148

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.
LibreCat: https://research-explorer.ista.ac.at/record/5679
DOI: 10.1007/978-3-030-02768-1_11
WoS: 000916310900011
arXiv: 1806.06683

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.
LibreCat: https://research-explorer.ista.ac.at/record/419
DOI: 10.1038/s41562-018-0320-9
WoS: 000446612000016

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.
LibreCat: https://research-explorer.ista.ac.at/record/79
DOI: 10.1007/978-3-319-99154-2_4
WoS: 000548912200004
arXiv: 1806.05126

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.
LibreCat: https://research-explorer.ista.ac.at/record/297
DOI: 10.1007/978-3-319-89960-2_21
WoS: 000546326300021

K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.
LibreCat: https://research-explorer.ista.ac.at/record/141
DOI: 10.1007/978-3-319-96142-2_13
WoS: 000491469700013

M. Hoffman, C. Hilbe, and M. Nowak, “The signal-burying game can explain why we obscure positive traits and good deeds,” Nature Human Behaviour, vol. 2. Nature Publishing Group, pp. 397–404, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/293
DOI: 10.1038/s41562-018-0354-z
WoS: 000435551300009

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.
LibreCat: https://research-explorer.ista.ac.at/record/5967
DOI: 10.1145/3219166.3219198
WoS: 000492755100020

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. Association for Computing Machinery (ACM), 2018.
LibreCat: https://research-explorer.ista.ac.at/record/5993
DOI: 10.1145/3174800
WoS: 000434634500003
arXiv: 1510.08517

K. Horák, B. Bosanský, 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.
LibreCat: https://research-explorer.ista.ac.at/record/25
DOI: 10.24963/ijcai.2018/662
WoS: 000764175404127