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.




500 Publications

2022 | Submitted | Preprint | IST-REx-ID: 12677 | OA
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: 9311 | OA
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: 10602 | OA
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: 11938 | OA
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 | Journal Article | IST-REx-ID: 17061 | OA
A. McAvoy, J. Kates-Harbeck, K. Chatterjee, and C. Hilbe, “Evolutionary instability of selfish learning in repeated games,” PNAS Nexus, vol. 1, no. 4. Oxford University Press, 2022.
[Published Version] View | Files available | DOI | PubMed | Europe PMC | arXiv
 
2022 | Published | Conference Paper | IST-REx-ID: 12102 | OA
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: 12000 | OA
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 | OA
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 | Draft | Preprint | IST-REx-ID: 14600 | OA
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
 
2022 | Draft | Preprint | IST-REx-ID: 14601 | OA
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 | Published | Journal Article | IST-REx-ID: 11402 | OA
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: 12101 | OA
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 | Journal Article | IST-REx-ID: 12257 | OA
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 | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10629 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
[Published Version] View | Files available | DOI
 
2021 | Book Chapter | IST-REx-ID: 9403 | OA
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 | Research Data Reference | IST-REx-ID: 15284 | OA
K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “RevTerm.” Association for Computing Machinery, 2021.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Virtual, 2021, pp. 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10667 | OA
M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in 35th Conference on Neural Information Processing Systems, Virtual, 2021.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 9646 | OA
J. Wang, Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Quantitative analysis of assertion violations in probabilistic programs,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1171–1186.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 9296 | OA
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
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed