en
Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
324 Publications
2019 | Conference Paper | IST-REx-ID: 6490
Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; :400-408. doi:10.1145/3297280.3297322
View
| DOI
2019 | Conference Paper | IST-REx-ID: 5948
Fu H, Chatterjee K. Termination of nondeterministic probabilistic programs. Enea C, Piskac R, eds. 2019;11388:468-490. doi:10.1007/978-3-030-11245-5_22
View
| DOI
2019 | Conference Paper | IST-REx-ID: 6175 
Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. In: 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019).
View
| Files available
| arXiv
2019 | Conference Paper | IST-REx-ID: 6056
Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts: Secure randomness on the blockchain. In: IEEE International Conference on Blockchain and Cryptocurrency. IEEE.
View
| Files available
| Download (ext.)
| arXiv
2019 | Journal Article | IST-REx-ID: 6380
Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 2019;3(POPL):53. doi:10.1145/3290366
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 6378
Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; :374-381. doi:10.1145/3297280.3297319
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 6462
Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. Run-time optimization for learned controllers through quantitative games. In: 31st International Conference on Computer-Aided Verification. Vol 11561. Springer; 2019:630-649. doi:10.1007/978-3-030-25540-4_36
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 6780
Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure termination of probabilistic programs. In: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . ACM.
View
| Files available
| Download (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 143
Brázdil T, Chatterjee K, Kučera A, Novotny P, Velan D, Zuleger F. Efficient algorithms for asymptotic bounds on termination time in VASS. In: Vol F138033. IEEE; 2018:185-194. doi:10.1145/3209108.3209191
View
| DOI
| Download (ext.)
2018 | Journal Article | IST-REx-ID: 198
Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Language acquisition with communication between learners. Journal of the Royal Society Interface. 2018;15(140). doi:10.1098/rsif.2018.0073
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 35
Chatterjee K, Dvorák W, Henzinger M, Svozil A. Algorithms and conditional lower bounds for planning problems. In: 28th International Conference on Automated Planning and Scheduling . AAAI Press; 2018.
View
| Download (ext.)
| arXiv
2018 | Book Chapter | IST-REx-ID: 59
Bloem R, Chatterjee K, Jobstmann B. Graph games and reactive synthesis. In: Henzinger TA, Clarke EM, Veith H, Bloem R, eds. Handbook of Modeling Checking. 1st ed. Springer; 2018:921-962. doi:10.1007/978-3-319-10575-8_27
View
| DOI
2018 | Conference Paper | IST-REx-ID: 66
Chatterjee K, Goharshady A, Ibsen-Jensen R, Velner Y. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:11. doi:10.4230/LIPIcs.CONCUR.2018.11
View
| Files available
| DOI
| Download (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 24
Chatterjee K, Elgyütt A, Novotny P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652
View
| DOI
| Download (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 310
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter. In: ACM; 2018:2341-2356. doi:10.1137/1.9781611975031.151
View
| DOI
| Download (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 454
Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 2018;9(1). doi:10.1038/s41467-017-02721-8
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 5967
Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit of memory. In: Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. ACM Press; 2018:149-150. doi:10.1145/3219166.3219198
View
| DOI
2018 | Journal Article | IST-REx-ID: 6009
Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 2018;40(3):9. doi:10.1145/3210257
View
| Files available
| DOI
| Download (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 5993
Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. ACM Transactions on Programming Languages and Systems. 2018;40(2):7. doi:10.1145/3174800
View
| Files available
| DOI
| Download (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 6340
Goharshady AK, Behrouz A, Chatterjee K. Secure Credit Reporting on the Blockchain. In: Proceedings of the IEEE International Conference on Blockchain. IEEE; 2018:1343-1348.
View
| Files available
| arXiv