Bidding mechanisms in graph games
G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/6884
DOI: 10.4230/LIPICS.MFCS.2019.11
arXiv: 1905.03835

Termination of nondeterministic probabilistic programs
H. Fu, K. Chatterjee, in:, International Conference on Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2019, pp. 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

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

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

Strategy representation by decision trees with linear classifiers
P. Ashok, T. Brázdil, K. Chatterjee, J. Ketínský, C. Lampert, V. Toman, in:, 16th International Conference on Quantitative Evaluation of Systems, Springer Nature, 2019, pp. 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

Deciding fast termination for probabilistic VASS with nondeterminism
T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, D. Velan, in:, International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2019, pp. 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

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

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

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

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

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

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

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

Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving
K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381.
LibreCat: https://research-explorer.ista.ac.at/record/6378
DOI: 10.1145/3297280.3297319
WoS: 000474685800049

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

The treewidth of smart contracts
K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, n.d., pp. 400–408.
LibreCat: https://research-explorer.ista.ac.at/record/6490
DOI: 10.1145/3297280.3297322
WoS: 000474685800052

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

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

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

Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs
S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/325
DOI: 10.1145/3158122
arXiv: 1709.04037