Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

332 Publications

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.
View | DOI
2019 | Conference Paper | IST-REx-ID: 6887   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140, p. 7). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
View | Files available | DOI
2019 | Conference Paper | IST-REx-ID: 5948
Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. (C. Enea & R. Piskac, Eds.). Presented at the Verification, Model Checking, and Abstract Interpretation, VMCAI, Cascais, Portugal: Springer.
View | DOI
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, 41(4), 20.
View | DOI | arXiv
2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019) (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery.
View | Files available | DOI | arXiv


Filter Publications

Display / Sort

Citation Style: APA

Export / Embed