Wang P, Fu H, Chatterjee K, Deng Y, Xu M. 2020. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. Proceedings of the ACM on Programming Languages. vol. 4, 25.
LibreCat: https://research-explorer.ista.ac.at/record/8324
DOI: 10.1145/3371093
arXiv: 1902.04744

Brázdil T, Chatterjee K, Novotný P, Vahala J. 2020. Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. 34(06), 9794–9801.
LibreCat: https://research-explorer.ista.ac.at/record/15055
DOI: 10.1609/aaai.v34i06.6531
arXiv: 2002.12086

Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.
LibreCat: https://research-explorer.ista.ac.at/record/15082

Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2020. Optimal and perfectly parallel algorithms for on-demand data-flow analysis. European Symposium on Programming. ESOP: Programming Languages and Systems, LNCS, vol. 12075, 112–140.
LibreCat: https://research-explorer.ista.ac.at/record/7810
DOI: 10.1007/978-3-030-44914-8_5
WoS: 000681656800005

Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. 2020. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 12302, 253–270.
LibreCat: https://research-explorer.ista.ac.at/record/8728
DOI: 10.1007/978-3-030-59152-6_14
WoS: 000723555700014

Chatterjee K, Fu H, Goharshady AK, Goharshady EK. 2020. Polynomial invariant generation for non-deterministic recursive programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 672–687.
LibreCat: https://research-explorer.ista.ac.at/record/8089
DOI: 10.1145/3385412.3385969
WoS: 000614622300045
arXiv: 1902.04373

Goharshady AK, Mohammadi F. 2020. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 193, 106665.
LibreCat: https://research-explorer.ista.ac.at/record/6918
DOI: 10.1016/j.ress.2019.106665
WoS: 000501641400050
arXiv: 1712.09692

Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7.
LibreCat: https://research-explorer.ista.ac.at/record/6887
DOI: 10.4230/LIPICS.CONCUR.2019.7

Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27.
LibreCat: https://research-explorer.ista.ac.at/record/6885
DOI: 10.4230/LIPICS.CONCUR.2019.27

Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.
LibreCat: https://research-explorer.ista.ac.at/record/6889
DOI: 10.4230/LIPICS.CONCUR.2019.6

Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: nternational Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 138, 11.
LibreCat: https://research-explorer.ista.ac.at/record/6884
DOI: 10.4230/LIPICS.MFCS.2019.11
arXiv: 1905.03835

Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs. International Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 11388, 468–490.
LibreCat: https://research-explorer.ista.ac.at/record/5948
DOI: 10.1007/978-3-030-11245-5_22
WoS: 000931943000022
arXiv: 1701.02944

Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019. Run-time optimization for learned controllers through quantitative games. 31st International Conference on Computer-Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 11561, 630–649.
LibreCat: https://research-explorer.ista.ac.at/record/6462
DOI: 10.1007/978-3-030-25540-4_36
WoS: 000491468000036

Hauser OP, Hilbe C, Chatterjee K, Nowak MA. 2019. Social dilemmas among unequals. Nature. 572(7770), 524–527.
LibreCat: https://research-explorer.ista.ac.at/record/6836
DOI: 10.1038/s41586-019-1488-5
WoS: 000482219600045

Ashok P, Brázdil T, Chatterjee K, Ketínský J, Lampert C, Toman V. 2019. Strategy representation by decision trees with linear classifiers. 16th International Conference on Quantitative Evaluation of Systems. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11785, 109–128.
LibreCat: https://research-explorer.ista.ac.at/record/6942
DOI: 10.1007/978-3-030-30281-8_7
WoS: 000679281300007
arXiv: 1906.08178

Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. 2019. Deciding fast termination for probabilistic VASS with nondeterminism. International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated TEchnology for Verification and Analysis, LNCS, vol. 11781, 462–478.
LibreCat: https://research-explorer.ista.ac.at/record/7183
DOI: 10.1007/978-3-030-31784-3_27
WoS: 000723515700027
arXiv: 1907.11010

Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2019. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2, 138.
LibreCat: https://research-explorer.ista.ac.at/record/7210
DOI: 10.1038/s42003-019-0373-y
WoS: 000465425700006
PMID: 31044163

Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 124.
LibreCat: https://research-explorer.ista.ac.at/record/10190
DOI: 10.1145/3360550
arXiv: 1909.00989

Chatterjee K, Doyen L. 2019. Graph planning with expected finite horizon. 34th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.
LibreCat: https://research-explorer.ista.ac.at/record/7402
DOI: 10.1109/lics.2019.8785706
WoS: 000805002800001
arXiv: 1802.03642

Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec J, Turcotte A. Token swapping on trees. arXiv, 1903.06981.
LibreCat: https://research-explorer.ista.ac.at/record/7950
arXiv: 1903.06981