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.
463 Publications
2022 |Published| Conference Paper | IST-REx-ID: 12102 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
[Published Version]
View
| Files available
| DOI
2022 |Published| Conference Paper | IST-REx-ID: 12101 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Complexity of spatial games,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
[Published Version]
View
| Files available
| DOI
2022 |Published| Conference Paper | IST-REx-ID: 12568 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
T. Meggendorfer, “Risk-aware stochastic shortest path,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual, 2022, vol. 36, no. 9, pp. 9858–9867.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 |Published| Journal Article | IST-REx-ID: 11938 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
O. Aichholzer et al., “On compatible matchings,” Journal of Graph Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240, 2022.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 |Submitted| Preprint | IST-REx-ID: 12677 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, M. Mohammadi, and R. J. Saona Urmeneta, “Repeated prophet inequality with near-optimal bounds,” arXiv. .
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 |Published| Journal Article | IST-REx-ID: 10602 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” Acta Informatica, vol. 59. Springer Nature, pp. 585–618, 2022.
[Published Version]
View
| Files available
| DOI
| WoS
2022 |Published| Journal Article | IST-REx-ID: 10731 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Infection dynamics of COVID-19 virus under lockdown and reopening,” Scientific Reports, vol. 12, no. 1. Springer Nature, 2022.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 |Published| Conference Paper | IST-REx-ID: 11459 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
D. Zikelic, B.-Y. E. Chang, P. Bolignano, and F. Raimondi, “Differential cost analysis with simultaneous potentials and anti-potentials,” in Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, United States, 2022, pp. 442–457.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 |Published| Journal Article | IST-REx-ID: 12257 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, and J. Tkadlec, “Social balance on networks: Local minima and best-edge dynamics,” Physical Review E, vol. 106, no. 3. American Physical Society, 2022.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 |Published| Journal Article | IST-REx-ID: 12280 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
L. Schmid, C. Hilbe, K. Chatterjee, and M. Nowak, “Direct reciprocity between individuals that use different strategy spaces,” PLOS Computational Biology, vol. 18, no. 6. Public Library of Science, 2022.
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2022 |Published| Journal Article | IST-REx-ID: 9311 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies in POMDPs with long-run average objectives,” Mathematics of Operations Research, vol. 47, no. 1. Institute for Operations Research and the Management Sciences, pp. 100–119, 2022.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 |Published| Journal Article | IST-REx-ID: 11402 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” Journal of Computer and System Sciences, vol. 129. Elsevier, pp. 1–21, 2022.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 |Published| Conference Paper | IST-REx-ID: 12775 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Grover, J. Kretinsky, T. Meggendorfer, and M. Weininger, “Anytime guarantees for reachability in uncountable Markov decision processes,” in 33rd International Conference on Concurrency Theory , Warsaw, Poland, 2022, vol. 243.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 |Published| Conference Paper | IST-REx-ID: 12000 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete certificates for auantitative termination analysis of probabilistic programs,” in Proceedings of the 34th International Conference on Computer Aided Verification, Haifa, Israel, 2022, vol. 13371, pp. 55–78.
[Published Version]
View
| Files available
| DOI
| WoS
2022 |Published| Journal Article | IST-REx-ID: 12511 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification in stochastic control systems via neural network supermartingales,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7. Association for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2022 |Submitted| Preprint | IST-REx-ID: 14601 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
D. Zikelic, M. Lechner, K. Chatterjee, and T. A. Henzinger, “Learning stabilizing policies in stochastic control systems,” arXiv. .
[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)
D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” arXiv. .
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10052 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in 32nd International Conference on Concurrency Theory, Paris, France, 2021, vol. 203.
[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)
K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in 48th International Colloquium on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.
[Published Version]
View
| Files available
| DOI