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.
454 Publications
2022 |
Published |
Journal Article |
IST-REx-ID: 10602 |
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 |
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 |
Journal Article |
IST-REx-ID: 11402 |
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: 11459 |
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: 11938 |
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 |
Published |
Conference Paper |
IST-REx-ID: 12000 |
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 |
Conference Paper |
IST-REx-ID: 12101 |
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: 12102 |
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
2021 |
Published |
Conference Paper |
IST-REx-ID: 12767 |
S. Bansal, K. Chatterjee, and M. Y. Vardi, “On satisficing in quantitative games,” in 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2021, vol. 12651, pp. 20–37.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |
Published |
Journal Article |
IST-REx-ID: 8793 |
M. Zeiner, U. Schmid, and K. Chatterjee, “Optimal strategies for selecting coordinators,” Discrete Applied Mathematics, vol. 289, no. 1. Elsevier, pp. 392–415, 2021.
[Published Version]
View
| Files available
| DOI
| WoS
2021 |
Published |
Thesis | PhD |
IST-REx-ID: 8934 |
A. K. Goharshady, “Parameterized and algebro-geometric advances in static program analysis,” Institute of Science and Technology Austria, 2021.
[Published Version]
View
| Files available
| DOI
2021 |
Published |
Journal Article |
IST-REx-ID: 9293 |
K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” Artificial Intelligence, vol. 297, no. 8. Elsevier, 2021.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 9296 |
O. Aichholzer et al., “On compatible matchings,” in 15th International Conference on Algorithms and Computation, Yangon, Myanmar, 2021, vol. 12635, pp. 221–233.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 |
Published |
Journal Article |
IST-REx-ID: 9381 |
M. Kleshnina, S. S. Streipert, J. A. Filar, and K. Chatterjee, “Mistakes can stabilise the dynamics of rock-paper-scissors games,” PLoS Computational Biology, vol. 17, no. 4. Public Library of Science, 2021.
[Published Version]
View
| Files available
| DOI
| WoS
2021 |
Published |
Journal Article |
IST-REx-ID: 9393 |
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” Formal Methods in System Design, vol. 57. Springer, pp. 401–428, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |
Published |
Journal Article |
IST-REx-ID: 9402 |
L. Schmid, K. Chatterjee, C. Hilbe, and M. A. Nowak, “A unified framework of direct and indirect reciprocity,” Nature Human Behaviour, vol. 5, no. 10. Springer Nature, pp. 1292–1302, 2021.
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2021 |
Book Chapter |
IST-REx-ID: 9403 |
L. Schmid and C. Hilbe, “The evolution of strategic ignorance in strategic interaction,” in Deliberate Ignorance: Choosing Not To Know, vol. 29, R. Hertwig and C. Engel, Eds. MIT Press, 2021, pp. 139–152.
[Published Version]
View
| Download Published Version (ext.)
2021 |
Published |
Conference Paper |
IST-REx-ID: 10002 |
K. Chatterjee, W. Dvorak, M. H. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 10004 |
K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 10052 |
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