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.
459 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.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 | Journal Article | IST-REx-ID: 7158 |
Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525.
[Submitted Version]
View
| Files available
| DOI
| WoS
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, 20, ACM, 2019, doi:10.1145/3339984.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 10883 |
Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53, doi:10.29007/5z5k.
[Published Version]
View
| Files available
| DOI
| arXiv
2018 | Conference Paper | IST-REx-ID: 325 |
Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM, 2018, doi:10.1145/3158122.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Book Chapter | IST-REx-ID: 59
Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” Handbook of Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:10.1007/978-3-319-10575-8_27.
View
| DOI
2018 | Book Chapter | IST-REx-ID: 86 |
Chatterjee, Krishnendu, et al. “Computing Average Response Time.” Principles of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:10.1007/978-3-319-95246-8_9.
[Submitted Version]
View
| Files available
| DOI
2018 | Journal Article | IST-REx-ID: 454 |
Reiter, Johannes, et al. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications, vol. 9, no. 1, 555, Nature Publishing Group, 2018, doi:10.1038/s41467-017-02721-8.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Conference Paper | IST-REx-ID: 143 |
Brázdil, Tomáš, et al. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. Vol. F138033, IEEE, 2018, pp. 185–94, doi:10.1145/3209108.3209191.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2018 | Journal Article | IST-REx-ID: 157 |
Hilbe, Christian, et al. “Evolution of Cooperation in Stochastic Games.” Nature, vol. 559, no. 7713, Nature Publishing Group, 2018, pp. 246–49, doi:10.1038/s41586-018-0277-x.
[Submitted Version]
View
| Files available
| DOI
| WoS