Huang, M., Fu, H., Chatterjee, K., &; Goharshady, A. K. (2019). Modular verification for almost-sure termination of probabilistic programs. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications  (Vol. 3). Athens, Greece: ACM.https://doi.org/10.1145/3360555 
LibreCat: https://research-explorer.ista.ac.at/record/6780
DOI: 10.1145/3360555
arXiv: 1901.06087

Chatterjee, K., Goharshady, A. K., Okati, N., &; Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. ACM.https://doi.org/10.1145/3290366 
LibreCat: https://research-explorer.ista.ac.at/record/6380
DOI: 10.1145/3290366

Chatterjee, K., Goharshady, A. K., &; Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE.https://doi.org/10.1109/BLOC.2019.8751326 
LibreCat: https://research-explorer.ista.ac.at/record/6056
DOI: 10.1109/BLOC.2019.8751326
arXiv: 1902.07986

Chatterjee, K., Goharshady, A. K., &; Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part 7772, pp. 374–381). Limassol, Cyprus: ACM.https://doi.org/10.1145/3297280.3297319 
LibreCat: https://research-explorer.ista.ac.at/record/6378
DOI: 10.1145/3297280.3297319
WoS: 000474685800049

Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., &; Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery.https://doi.org/10.1145/3314221.3314581 
LibreCat: https://research-explorer.ista.ac.at/record/6175
DOI: 10.1145/3314221.3314581
WoS: 000523190300014
arXiv: 1902.04659

Chatterjee, K., Goharshady, A. K., &; Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part 7772, pp. 400–408). Limassol, Cyprus: ACM.https://doi.org/10.1145/3297280.3297322 
LibreCat: https://research-explorer.ista.ac.at/record/6490
DOI: 10.1145/3297280.3297322
WoS: 000474685800052

Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., &; Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. ACM.https://doi.org/10.1145/3363525 
LibreCat: https://research-explorer.ista.ac.at/record/7158
DOI: 10.1145/3363525
WoS: 000564108400004

Chatterjee, K., Fu, H., &; Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. ACM.https://doi.org/10.1145/3339984 
LibreCat: https://research-explorer.ista.ac.at/record/7014
DOI: 10.1145/3339984
WoS: 000564108400001
arXiv: 1705.00317

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

Agrawal, S., Chatterjee, K., &; Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM.https://doi.org/10.1145/3158122 
LibreCat: https://research-explorer.ista.ac.at/record/325
DOI: 10.1145/3158122
arXiv: 1709.04037

Bloem, R., Chatterjee, K., &; Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, &; R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer.https://doi.org/10.1007/978-3-319-10575-8_27 
LibreCat: https://research-explorer.ista.ac.at/record/59
DOI: 10.1007/978-3-319-10575-8_27

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, &; M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer.https://doi.org/10.1007/978-3-319-95246-8_9 
LibreCat: https://research-explorer.ista.ac.at/record/86
DOI: 10.1007/978-3-319-95246-8_9

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

Brázdil, T., Chatterjee, K., Kudera, A., Novotný, P., Velan, D., &; Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. 8033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE.https://doi.org/10.1145/3209108.3209191 
LibreCat: https://research-explorer.ista.ac.at/record/143
DOI: 10.1145/3209108.3209191
WoS: 000545262800020

Hilbe, C., Simsa, S., Chatterjee, K., &; Nowak, M. (2018). Evolution of cooperation in stochastic games. Nature. Nature Publishing Group.https://doi.org/10.1038/s41586-018-0277-x 
LibreCat: https://research-explorer.ista.ac.at/record/157
DOI: 10.1038/s41586-018-0277-x
WoS: 000438240900054

Chatterjee, K., Dvorák, W., Henzinger, M. H., &; Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States: ACM.https://doi.org/10.1137/1.9781611975031.151 
LibreCat: https://research-explorer.ista.ac.at/record/310
DOI: 10.1137/1.9781611975031.151
WoS: 000483921200152
arXiv: 1711.09148

Huang, M., Fu, H., &; Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer.https://doi.org/10.1007/978-3-030-02768-1_11 
LibreCat: https://research-explorer.ista.ac.at/record/5679
DOI: 10.1007/978-3-030-02768-1_11
WoS: 000916310900011
arXiv: 1806.06683

Hilbe, C., Chatterjee, K., &; Nowak, M. (2018). Partners and rivals in direct reciprocity. Nature Human Behaviour. Nature Publishing Group.https://doi.org/10.1038/s41562-018-0320-9 
LibreCat: https://research-explorer.ista.ac.at/record/419
DOI: 10.1038/s41562-018-0320-9
WoS: 000446612000016

Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., &; Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer.https://doi.org/10.1007/978-3-319-99154-2_4 
LibreCat: https://research-explorer.ista.ac.at/record/79
DOI: 10.1007/978-3-319-99154-2_4
WoS: 000548912200004
arXiv: 1806.05126

Brázdil, T., Chatterjee, K., Kretinsky, J., &; Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer.https://doi.org/10.1007/978-3-319-89960-2_21 
LibreCat: https://research-explorer.ista.ac.at/record/297
DOI: 10.1007/978-3-319-89960-2_21
WoS: 000546326300021