| Polynomial reachability witnesses via Stellensätze A Asadi, K Chatterjee, H Fu, AK Goharshady, M Mahdavi Proceedings of the 42nd ACM SIGPLAN International Conference on Programming …, 2021 | 38 | 2021 |
| Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth A Asadi, K Chatterjee, AK Goharshady, K Mohammadi, A Pavlogiannis International Symposium on Automated Technology for Verification and …, 2020 | 20 | 2020 |
| Limit-sure reachability for small memory policies in POMDPs is NP-complete A Asadi, K Chatterjee, R Saona, A Shafiee arXiv preprint arXiv:2412.00941, 2024 | | 2024 |
| Concurrent Stochastic Games with Stateful-discounted and Parity Objectives: Complexity and Algorithms A Asadi, K Chatterjee, R Saona, J Svoboda arXiv preprint arXiv:2405.02486, 2024 | | 2024 |
| Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights A Asadi, K Chatterjee, R Saona, J Svoboda Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer …, 2024 | | 2024 |
Krishnendu ChatterjeeProfessor, IST AustriaVerified email at ist.ac.at