Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.”https://doi.org/10.1145/3360555__In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Vol. 3. ACM, 2019.https://doi.org/10.1145/3360555 .
LibreCat: https://research-explorer.ista.ac.at/record/6780
DOI: 10.1145/3360555
arXiv: 1901.06087

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.”https://doi.org/10.1145/3290366__Proceedings of the ACM on Programming Languages. ACM, 2019.https://doi.org/10.1145/3290366 .
LibreCat: https://research-explorer.ista.ac.at/record/6380
DOI: 10.1145/3290366

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.”https://doi.org/10.1109/BLOC.2019.8751326__In IEEE International Conference on Blockchain and Cryptocurrency. IEEE, 2019.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, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.”https://doi.org/10.1145/3297280.3297319__In Proceedings of the 34th ACM Symposium on Applied Computing, Part 7772:374–81. ACM, 2019.https://doi.org/10.1145/3297280.3297319 .
LibreCat: https://research-explorer.ista.ac.at/record/6378
DOI: 10.1145/3297280.3297319
WoS: 000474685800049

Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.”https://doi.org/10.1145/3314221.3314581__In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 204–20. Association for Computing Machinery, 2019.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, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.”https://doi.org/10.1145/3297280.3297322__In Proceedings of the 34th ACM Symposium on Applied Computing, Part 7772:400–408. ACM, n.d.https://doi.org/10.1145/3297280.3297322 .
LibreCat: https://research-explorer.ista.ac.at/record/6490
DOI: 10.1145/3297280.3297322
WoS: 000474685800052

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.”https://doi.org/10.1145/3363525__ACM Transactions on Programming Languages and Systems. ACM, 2019.https://doi.org/10.1145/3363525 .
LibreCat: https://research-explorer.ista.ac.at/record/7158
DOI: 10.1145/3363525
WoS: 000564108400004

Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.”https://doi.org/10.1145/3339984__ACM Transactions on Programming Languages and Systems. ACM, 2019.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, Krishnendu, Wolfgang Dvoák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.”https://doi.org/10.29007/5z5k__In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018.https://doi.org/10.29007/5z5k .
LibreCat: https://research-explorer.ista.ac.at/record/10883
DOI: 10.29007/5z5k
arXiv: 1909.04983

Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,”https://doi.org/10.1145/3158122__Vol. 2. ACM, 2018.https://doi.org/10.1145/3158122 .
LibreCat: https://research-explorer.ista.ac.at/record/325
DOI: 10.1145/3158122
arXiv: 1709.04037

Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.”https://doi.org/10.1007/978-3-319-10575-8_27__In Handbook of Model Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018.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, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.”https://doi.org/10.1007/978-3-319-95246-8_9__In Principles of Modeling, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018.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, Johannes, Christian Hilbe, David Rand, Krishnendu Chatterjee, and Martin Nowak. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.”https://doi.org/10.1038/s41467-017-02721-8__Nature Communications. Nature Publishing Group, 2018.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, Tomás, Krishnendu Chatterjee, Antonín Kudera, Petr Novotný, Dominik Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS,”https://doi.org/10.1145/3209108.3209191__8033:185–94. IEEE, 2018.https://doi.org/10.1145/3209108.3209191 .
LibreCat: https://research-explorer.ista.ac.at/record/143
DOI: 10.1145/3209108.3209191
WoS: 000545262800020

Hilbe, Christian, Stepán Simsa, Krishnendu Chatterjee, and Martin Nowak. “Evolution of Cooperation in Stochastic Games.”https://doi.org/10.1038/s41586-018-0277-x__Nature. Nature Publishing Group, 2018.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, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter,”https://doi.org/10.1137/1.9781611975031.151__2341–56. ACM, 2018.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, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.”https://doi.org/10.1007/978-3-030-02768-1_11__edited by Sukyoung Ryu, 11275:181–201. Springer, 2018.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, Christian, Krishnendu Chatterjee, and Martin Nowak. “Partners and Rivals in Direct Reciprocity.”https://doi.org/10.1038/s41562-018-0320-9__Nature Human Behaviour. Nature Publishing Group, 2018.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, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,”https://doi.org/10.1007/978-3-319-99154-2_4__11024:53–70. Springer, 2018.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, Tomás, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,”https://doi.org/10.1007/978-3-319-89960-2_21__10805:385–407. Springer, 2018.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