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.
333 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: 6887 
Chatterjee K, Dvorák W, Henzinger M, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:7. doi:10.4230/LIPICS.CONCUR.2019.7
View
| Files available
| 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 | Journal Article | IST-REx-ID: 7014
Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 2019;41(4):20. doi:10.1145/3339984
View
| DOI
| arXiv
2019 | Journal Article | IST-REx-ID: 7158
Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 2019;41(4):23. doi:10.1145/3363525
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). Association for Computing Machinery; 2019:204-220. doi:10.1145/3314221.3314581
View
| Files available
| DOI
| arXiv
2019 | Conference Paper | IST-REx-ID: 6884
Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:11. doi:10.4230/LIPICS.MFCS.2019.11
View
| Files available
| DOI
| arXiv
2019 | Conference Paper | IST-REx-ID: 6889
Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:6. doi:10.4230/LIPICS.CONCUR.2019.6
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 6942
Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. Strategy representation by decision trees with linear classifiers. In: 16th International Conference on Quantitative Evaluation of Systems. Vol 11785. Springer Nature; 2019:109-128. doi:10.1007/978-3-030-30281-8_7
View
| DOI
| Download (ext.)
| 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; 2019:8751326. doi:10.1109/BLOC.2019.8751326
View
| DOI
| Download (ext.)
| arXiv
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: 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 | 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: 6885
Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:27. doi:10.4230/LIPICS.CONCUR.2019.27
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
2019 | Journal Article | IST-REx-ID: 6836
Hauser OP, Hilbe C, Chatterjee K, Nowak MA. Social dilemmas among unequals. Nature. 2019;572(7770):524-527. doi:10.1038/s41586-019-1488-5
View
| Files available
| DOI
2019 | Journal Article | IST-REx-ID: 6918
Goharshady AK, Mohammadi F. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 2019;193:106665. doi:10.1016/j.ress.2019.106665
View
| DOI
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