Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” Deliberate Ignorance: Choosing Not To Know, edited by Ralph Hertwig and Christoph Engel, vol. 29, MIT Press, 2021, pp. 139–52.
LibreCat: https://research-explorer.ista.ac.at/record/9403

Bansal, Suguman, et al. “On Satisficing in Quantitative Games.”10.1007/978-3-030-72016-2__27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12651, Springer Nature, 2021, pp. 20–37, doi:10.1007/978-3-030-72016-2.
LibreCat: https://research-explorer.ista.ac.at/record/12767
DOI: 10.1007/978-3-030-72016-2
arXiv: 2101.02594

Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.”10.48550/arXiv.2111.03165__35th Conference on Neural Information Processing Systems, 2021, doi:10.48550/arXiv.2111.03165.
LibreCat: https://research-explorer.ista.ac.at/record/10667
DOI: 10.48550/arXiv.2111.03165
arXiv: 2111.03165

Zeiner, Martin, et al. “Optimal Strategies for Selecting Coordinators.”10.1016/j.dam.2020.10.022__Discrete Applied Mathematics, vol. 289, no. 1, Elsevier, 2021, pp. 392–415, doi:10.1016/j.dam.2020.10.022.
LibreCat: https://research-explorer.ista.ac.at/record/8793
DOI: 10.1016/j.dam.2020.10.022
WoS: 000596823800035

Kleshnina, Maria, et al. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.”10.1371/journal.pcbi.1008523__PLoS Computational Biology, vol. 17, no. 4, e1008523, Public Library of Science, 2021, doi:10.1371/journal.pcbi.1008523.
LibreCat: https://research-explorer.ista.ac.at/record/9381
DOI: 10.1371/journal.pcbi.1008523
WoS: 000639711200001

Tkadlec, Josef, et al. “Fast and Strong Amplifiers of Natural Selection.”10.1038/s41467-021-24271-w__Nature Communications, vol. 12, no. 1, 4009, Springer Nature, 2021, doi:10.1038/s41467-021-24271-w.
LibreCat: https://research-explorer.ista.ac.at/record/9640
DOI: 10.1038/s41467-021-24271-w
WoS: 000671752100003
PMID: 34188036

Wang, Jinyi, et al. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.”10.1145/3453483.3454102__Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1171–86, doi:10.1145/3453483.3454102.
LibreCat: https://research-explorer.ista.ac.at/record/9646
DOI: 10.1145/3453483.3454102
WoS: 000723661700076
arXiv: 2011.14617

Asadi, Ali, et al. “Polynomial Reachability Witnesses via Stellensätze.”10.1145/3453483.3454076__Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 772–87, doi:10.1145/3453483.3454076.
LibreCat: https://research-explorer.ista.ac.at/record/9645
DOI: 10.1145/3453483.3454076
WoS: 000723661700050

Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.”10.1109/LICS52264.2021.9470739__Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470739.
LibreCat: https://research-explorer.ista.ac.at/record/10002
DOI: 10.1109/LICS52264.2021.9470739
WoS: 000947350400089
arXiv: 2104.07466

Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.”10.1109/LICS52264.2021.9470595__Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470595.
LibreCat: https://research-explorer.ista.ac.at/record/10004
DOI: 10.1109/LICS52264.2021.9470595
WoS: 000947350400036
arXiv: 2104.07278

Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.”10.4230/LIPIcs.STACS.2021.44__38th International Symposium on Theoretical Aspects of Computer Science, vol. 187, 44, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.STACS.2021.44.
LibreCat: https://research-explorer.ista.ac.at/record/10055
DOI: 10.4230/LIPIcs.STACS.2021.44
WoS: 000635691700044

Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.”10.1007/978-3-030-81685-8_16__33rd International Conference on Computer-Aided Verification , vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16.
LibreCat: https://research-explorer.ista.ac.at/record/9987
DOI: 10.1007/978-3-030-81685-8_16
WoS: 000698732400016
arXiv: 2105.06424

Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.”10.1145/3485541__Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:10.1145/3485541.
LibreCat: https://research-explorer.ista.ac.at/record/10191
DOI: 10.1145/3485541
arXiv: 2011.11763

Toman, Viktor. Improved Verification Techniques for Concurrent Systems. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199.
LibreCat: https://research-explorer.ista.ac.at/record/10199
DOI: 10.15479/at:ista:10199

Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.”10.1016/j.artint.2021.103499__Artificial Intelligence, vol. 297, no. 8, 103499, Elsevier, 2021, doi:10.1016/j.artint.2021.103499.
LibreCat: https://research-explorer.ista.ac.at/record/9293
DOI: 10.1016/j.artint.2021.103499
WoS: 000657537500003
arXiv: 1804.07031

Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.”10.1007/s10703-021-00373-5__Formal Methods in System Design, vol. 57, Springer, 2021, pp. 401–28, doi:10.1007/s10703-021-00373-5.
LibreCat: https://research-explorer.ista.ac.at/record/9393
DOI: 10.1007/s10703-021-00373-5
WoS: 000645490300001
arXiv: 1504.07384

Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.”10.1145/3453483.3454093__Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–48, doi:10.1145/3453483.3454093.
LibreCat: https://research-explorer.ista.ac.at/record/9644
DOI: 10.1145/3453483.3454093
WoS: 000723661700067
arXiv: 2104.01189

Chatterjee, Krishnendu, et al. RevTerm. Association for Computing Machinery, 2021, doi:10.1145/3410304.
LibreCat: https://research-explorer.ista.ac.at/record/15284
DOI: 10.1145/3410304

Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.”10.1007/978-3-030-90870-6_33__24th International Symposium on Formal Methods, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33.
LibreCat: https://research-explorer.ista.ac.at/record/10414
DOI: 10.1007/978-3-030-90870-6_33
WoS: 000758218600033
arXiv: 2108.02188

Goharshady, Amir Kafshdar. Parameterized and Algebro-Geometric Advances in Static Program Analysis. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:8934.
LibreCat: https://research-explorer.ista.ac.at/record/8934
DOI: 10.15479/AT:ISTA:8934