| Termination analysis of probabilistic programs through Positivstellensätze K Chatterjee, H Fu, AK Goharshady International Conference on Computer Aided Verification (CAV), 2016 | 102 | 2016 |
| Probabilistic Smart Contracts: Secure Randomness on the Blockchain K Chatterjee, A Goharshady, A Pourdamghani IEEE International Conference on Blockchain and Cryptocurrency (ICBC), 2019 | 73 | 2019 |
| Quantitative Analysis of Smart Contracts K Chatterjee, AK Goharshady, Y Velner European Symposium on Programming (ESOP), 2018 | 71 | 2018 |
| Cost Analysis of Nondeterministic Probabilistic Programs P Wang, H Fu, AK Goharshady, K Chatterjee, X Qin, W Shi ACM Conference on Programming Language Design and Implementation (PLDI), 2019 | 43 | 2019 |
| The Treewidth of Smart Contracts K Chatterjee, AK Goharshady, EK Goharshady ACM Symposium on Applied Computing (SAC), 2019 | 41 | 2019 |
| Non-polynomial Worst-case Analysis of Recursive Programs K Chatterjee, H Fu, AK Goharshady ACM Transactions on Programming Languages and Systems (TOPLAS) 41 (4), 20, 2019 | 35 | 2019 |
| Non-polynomial Worst-Case Analysis of Recursive Programs K Chatterjee, H Fu, AK Goharshady International Conference on Computer Aided Verification (CAV), 2017 | 35 | 2017 |
| Hybrid Mining: Exploiting Blockchain's Computational Power for Distributed Problem Solving K Chatterjee, AK Goharshady, A Pourdamghani ACM Symposium on Applied Computing (SAC), 2019 | 32 | 2019 |
| Modular Verification for Almost-Sure Termination of Probabilistic Programs M Huang, H Fu, K Chatterjee, AK Goharshady ACM International Conference on Object-Oriented Programming, Systems …, 2019 | 31 | 2019 |
| Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies K Chatterjee, AK Goharshady, R Ibsen-Jensen, Y Velner International Conference on Concurrency Theory (CONCUR), 2018 | 31 | 2018 |
| Polynomial invariant generation for non-deterministic recursive programs K Chatterjee, H Fu, AK Goharshady, EK Goharshady ACM Conference on Programming Language Design and Implementation (PLDI), 2020 | 28 | 2020 |
| Algorithms for algebraic path properties in concurrent systems of constant treewidth components K Chatterjee, AK Goharshady, R Ibsen-Jensen, A Pavlogiannis ACM Symposium on Principles of Programming Languages (POPL), 2016 | 25 | 2016 |
| [1, 2]-sets and [1, 2]-total sets in trees with algorithms AK Goharshady, MR Hooshmandasl, MA Meybodi Discrete Applied Mathematics 198, 136-146, 2016 | 21 | 2016 |
| Polynomial Reachability Witnesses via Stellensätze A Asadi, K Chatterjee, H Fu, A Goharshady, M Mahdavi ACM Conference on Programming Language Design and Implementation (PLDI), 2021 | 19 | 2021 |
| An Efficient Algorithm for Computing Network Reliability in Small Treewidth AK Goharshady, F Mohammadi Reliability Engineering and System Safety, 2020 | 19 | 2020 |
| Quantitative Analysis of Assertion Violations in Probabilistic Programs J Wang, Y Sun, H Fu, K Chatterjee, AK Goharshady ACM Conference on Programming Language Design and Implementation (PLDI), 2021 | 18 | 2021 |
| Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis K Chatterjee, AK Goharshady, R Ibsen-Jensen, A Pavlogiannis European Symposium on Programming (ESOP), 2020 | 17 | 2020 |
| Efficient Parameterized Algorithms for Data Packing K Chatterjee, AK Goharshady, N Okati, A Pavlogiannis ACM Symposium on Principles of Programming Languages (POPL), 2019 | 17 | 2019 |
| Computational Approaches for Stochastic Shortest Path on Succinct MDPs K Chatterjee, H Fu, AK Goharshady, N Okati International Joint Conference on Artificial Intelligence (IJCAI), 2018 | 17 | 2018 |
| Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth K Chatterjee, AK Goharshady, P Goyal, R Ibsen-Jensen, A Pavlogiannis ACM Transactions on Programming Languages and Systems (TOPLAS), 2019 | 16 | 2019 |
Krishnendu ChatterjeeProfessor, IST AustriaVerified email at ist.ac.at
