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.
470 Publications
2019 |Published| Conference Paper | IST-REx-ID: 6942 |
Ashok, Pranav, et al. “Strategy Representation by Decision Trees with Linear Classifiers.” 16th International Conference on Quantitative Evaluation of Systems, vol. 11785, Springer Nature, 2019, pp. 109–28, doi:10.1007/978-3-030-30281-8_7.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 7183 |
Brázdil, Tomás, et al. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” International Symposium on Automated Technology for Verification and Analysis, vol. 11781, Springer Nature, 2019, pp. 462–78, doi:10.1007/978-3-030-31784-3_27.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 7210 |
Tkadlec, Josef, et al. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” Communications Biology, vol. 2, 138, Springer Nature, 2019, doi:10.1038/s42003-019-0373-y.
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2019 |Published| Conference Paper | IST-REx-ID: 10190 |
Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 7402 |
Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” 34th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2019, pp. 1–13, doi:10.1109/lics.2019.8785706.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Submitted| Preprint | IST-REx-ID: 7950 |
Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6780 |
Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , vol. 3, 129, ACM, 2019, doi:10.1145/3360555.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 6380 |
Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, 53, ACM, 2019, doi:10.1145/3290366.
[Published Version]
View
| Files available
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 6056 |
Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” IEEE International Conference on Blockchain and Cryptocurrency, 8751326, IEEE, 2019, doi:10.1109/BLOC.2019.8751326.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6378 |
Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, 2019, pp. 374–81, doi:10.1145/3297280.3297319.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |Published| Conference Paper | IST-REx-ID: 6175 |
Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–20, doi:10.1145/3314221.3314581.
[Submitted Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 |Published| 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 |Published| 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
2019 |Published| 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, 2019, pp. 400–08, doi:10.1145/3297280.3297322.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 |Published| 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 |Published| 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 |Published| 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 |Published| 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 |Published| 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 |Published| 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