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, Krishnendu, et al. “The Treewidth of Smart Contracts.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, pp. 400–08, doi:10.1145/3297280.3297322.
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 6887   OA
Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 7, doi:10.4230/LIPICS.CONCUR.2019.7.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 5948
Fu, Hongfei, and Krishnendu Chatterjee. Termination of Nondeterministic Probabilistic Programs. Edited by Constantin Enea and Ruzica Piskac, vol. 11388, Springer, 2019, pp. 468–90, doi:10.1007/978-3-030-11245-5_22.
View | DOI
 
2019 | Journal Article | IST-REx-ID: 7014
Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, ACM, 2019, p. 20, doi:10.1145/3339984.
View | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019), Association for Computing Machinery, 2019, pp. 204–20, doi:10.1145/3314221.3314581.
View | Files available | DOI | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed