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 | OA
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 . Vol 3. ACM; 2019. doi:10.1145/3360555
[Published Version] View | Files available | DOI | arXiv
 

2019 | Journal Article | IST-REx-ID: 6380 | OA
Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 2019;3(POPL). doi:10.1145/3290366
[Published Version] View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 6056 | OA
Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts: Secure randomness on the blockchain. In: IEEE International Conference on Blockchain and Cryptocurrency. IEEE; 2019. doi:10.1109/BLOC.2019.8751326
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6378 | OA
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; 2019:374-381. doi:10.1145/3297280.3297319
[Submitted Version] View | Files available | DOI | WoS
 

2019 | Conference Paper | IST-REx-ID: 6175 | OA
Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. In: PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2019:204-220. doi:10.1145/3314221.3314581
[Submitted Version] View | Files available | DOI | WoS | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6490 | OA
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
[Submitted Version] View | Files available | DOI | WoS
 

2019 | Journal Article | IST-REx-ID: 7158 | OA
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). doi:10.1145/3363525
[Submitted Version] View | Files available | DOI | WoS
 

2019 | Journal Article | IST-REx-ID: 7014 | OA
Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3339984
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Conference Paper | IST-REx-ID: 10883 | OA
Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Quasipolynomial set-based symbolic algorithms for parity games. In: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Vol 57. EasyChair; 2018:233-253. doi:10.29007/5z5k
[Published Version] View | Files available | DOI | arXiv
 

2018 | Conference Paper | IST-REx-ID: 325 | OA
Agrawal S, Chatterjee K, Novotný P. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. In: Vol 2. ACM; 2018. doi:10.1145/3158122
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications