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.

Krishnendu Chatterjee

Ali Asadi

Ehsan Kafshdar Goharshadi

Mehrdad Karrabi

Pavol Kebis

Ruichen Luo

David Lurie

Satya Nayak

Ali Shafiee

Martin Chmelik

Ventsislav Chonev

Benjamin Aminof

Hongfei Fu

Amir Goharshady

Christian Hilbe

Florian Horn

Mingzhang Huang

Valentin Hübner

Rasmus Ibsen-Jensen

Ismael Jecker

Joost Katoen

Maria Kleshnina

Jan Kretinsky

John Lazarsfeld

Tobias Meggendorfer

Petr Novotny

Andreas Pavlogiannis

Tadeas Priklopil

Johannes Reiter

Sasha Rubin

Raimundo Saona Urmeneta

Laura Schmid

Jakub Svoboda

Pepa Tkadlec

Viktor Toman

Mathieu Tracol

Maximilian Weininger

Djordje Zikelic



528 Publications

2018 | Published | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee, K., Fu, H., Goharshady, A. K., & Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/653
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 1194 | OA
Chatterjee, K., Novotný, P., & Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM. https://doi.org/10.1145/3009837.3009873
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 1294 | OA
Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2017). Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2016.09.009
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 13160 | OA
Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2017). Index appearance record for transforming Rabin automata into parity automata. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 10205, pp. 443–460). Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_26
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier. https://doi.org/10.1016/j.nahs.2016.04.006
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 512 | OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-017-00107-w
[Published Version] View | Files available | DOI | WoS
 
earlier version | 2017 | Published | Technical Report | IST-REx-ID: 5455 | OA
Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1
[Published Version] View | Files available | DOI
 
earlier version | 2017 | Published | Technical Report | IST-REx-ID: 5456 | OA
Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria. https://doi.org/10.15479/AT:IST-2017-872-v1-1
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.61
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee, K., Henzinger, M., & Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.39
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.55
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
2017 | Research Data | IST-REx-ID: 5559 | OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak , M. (2017). Strong amplifiers of natural selection. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:51
[Published Version] View | Files available | DOI
 
2017 | Published | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, & R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer. https://doi.org/10.1007/978-3-319-63121-9_18
[Submitted Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 628 | OA
Chatterjee, K., Fu, H., & Murhekar, A. (2017). Automated recurrence analysis for almost linear expected runtime bounds. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_6
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 1009 | OA
Chatterjee, K., Novotný, P., Pérez, G., Raskin, J., & Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 1011 | OA
Chatterjee, K., Kragl, B., Mishra, S., & Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54434-1_11
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 10416 | OA
Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158118
[Published Version] View | Files available | DOI | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 10418 | OA
Mciver, A., Morgan, C., Kaminski, B. L., & Katoen, J. P. (2017). A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158121
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 1065 | OA
Chatterjee, K., & Osang, G. F. (2017). Pushdown reachability with constant treewidth. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2017.02.003
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1066 | OA
Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2017). Quantitative fair simulation games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2016.10.006
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed