Please note that ISTA 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.
459 Publications
2019 | Conference Paper | IST-REx-ID: 6780 |
Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (2019). 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 (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360555
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Journal Article | IST-REx-ID: 6380 |
Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3290366
[Published Version]
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 6056 |
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Conference Paper | IST-REx-ID: 6378 |
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 | Conference Paper | IST-REx-ID: 6175 |
Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3314221.3314581
[Submitted Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 6490 |
Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 | Journal Article | IST-REx-ID: 7158 |
Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3363525
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 | Journal Article | IST-REx-ID: 7014 |
Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3339984
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 10883 |
Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k
[Published Version]
View
| Files available
| DOI
| arXiv
2018 | Conference Paper | IST-REx-ID: 325 |
Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv