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

2022 | Preprint | IST-REx-ID: 14601 | OA
Zikelic, D., Lechner, M., Chatterjee, K., & Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. arXiv. https://doi.org/10.48550/arXiv.2205.11991
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2022 | Preprint | IST-REx-ID: 14600 | OA
Zikelic, D., Lechner, M., Henzinger, T. A., & Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. arXiv. https://doi.org/10.48550/ARXIV.2210.05308
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10052 | OA
Jecker, I. R., Mazzocchi, N., & Wolf, P. (2021). Decomposing permutation automata. In 32nd International Conference on Concurrency Theory (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18
[Published Version] View | Files available | DOI | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10054 | OA
Chatterjee, K., Henzinger, M. H., Kale, S. S., & Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In 48th International Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2021.124
[Published Version] View | Files available | DOI
 
2021 | Conference Paper | IST-REx-ID: 10075 | OA
Guha, S., Jecker, I. R., Lehtinen, K., & Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In 46th International Symposium on Mathematical Foundations of Computer Science (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2021.53
[Published Version] View | Files available | DOI | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10630 | OA
Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., & Wolf, P. (2021). On the complexity of intersection non-emptiness for star-free language classes. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34
[Published Version] View | Files available | DOI | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10629 | OA
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42
[Published Version] View | Files available | DOI
 
2021 | Conference Paper | IST-REx-ID: 10694 | OA
Avni, G., Jecker, I. R., & Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.38
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10847 | OA
Tomášek, P., Horák, K., Aradhye, A., Bošanský, B., & Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In 30th International Joint Conference on Artificial Intelligence (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/575
[Published Version] View | DOI | Download Published Version (ext.)
 
2021 | Conference Paper | IST-REx-ID: 9296 | OA
Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2021). On compatible matchings. In 15th International Conference on Algorithms and Computation (Vol. 12635, pp. 221–233). Yangon, Myanmar: Springer Nature. https://doi.org/10.1007/978-3-030-68211-8_18
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications