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.
470 Publications
2022 |Submitted| Preprint | IST-REx-ID: 14601 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Zikelic, Dorde, et al. “Learning Stabilizing Policies in Stochastic Control Systems.” ArXiv, doi:10.48550/arXiv.2205.11991.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2022 |Submitted| Preprint | IST-REx-ID: 14600 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” ArXiv, doi:10.48550/ARXIV.2210.05308.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2022 |Published| Journal Article | IST-REx-ID: 17061 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
McAvoy, Alex, et al. “Evolutionary Instability of Selfish Learning in Repeated Games.” PNAS Nexus, vol. 1, no. 4, pgac141, Oxford University Press, 2022, doi:10.1093/pnasnexus/pgac141.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10052 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Jecker, Ismael R., et al. “Decomposing Permutation Automata.” 32nd International Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10054 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” 48th International Colloquium on Automata, Languages, and Programming, vol. 198, 124, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.ICALP.2021.124.
[Published Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 10075 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” 46th International Symposium on Mathematical Foundations of Computer Science, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.MFCS.2021.53.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10630 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10629 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.” 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.
[Published Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 10694 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10847 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Tomášek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.” 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:10.24963/ijcai.2021/575.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2021 |Published| Conference Paper | IST-REx-ID: 9296 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Aichholzer, Oswin, et al. “On Compatible Matchings.” 15th International Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021, pp. 221–33, doi:10.1007/978-3-030-68211-8_18.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Book Chapter | IST-REx-ID: 9403 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Download Published Version (ext.)
2021 |Published| Conference Paper | IST-REx-ID: 12767 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bansal, Suguman, et al. “On Satisficing in Quantitative Games.” 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.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10667 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” 35th Conference on Neural Information Processing Systems, 2021, doi:10.48550/arXiv.2111.03165.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 8793 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Zeiner, Martin, et al. “Optimal Strategies for Selecting Coordinators.” Discrete Applied Mathematics, vol. 289, no. 1, Elsevier, 2021, pp. 392–415, doi:10.1016/j.dam.2020.10.022.
[Published Version]
View
| Files available
| DOI
| WoS
2021 |Published| Journal Article | IST-REx-ID: 9381 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kleshnina, Maria, et al. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.” PLoS Computational Biology, vol. 17, no. 4, e1008523, Public Library of Science, 2021, doi:10.1371/journal.pcbi.1008523.
[Published Version]
View
| Files available
| DOI
| WoS
2021 |Published| Journal Article | IST-REx-ID: 9640 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Tkadlec, Josef, et al. “Fast and Strong Amplifiers of Natural Selection.” Nature Communications, vol. 12, no. 1, 4009, Springer Nature, 2021, doi:10.1038/s41467-021-24271-w.
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2021 |Published| Conference Paper | IST-REx-ID: 9646 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Wang, Jinyi, et al. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.” 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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 9645 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Asadi, Ali, et al. “Polynomial Reachability Witnesses via Stellensätze.” 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.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 |Published| Conference Paper | IST-REx-ID: 10002 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” 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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv