Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

498 Publications


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 | 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 | 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 | 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
 

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 | Journal Article | IST-REx-ID: 464 | OA
Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017
[Published Version] View | Files available | DOI | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 6519 | OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18
[Published Version] View | Files available | DOI
 

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: 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 | 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 | 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.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 717 | OA
Chatterjee, K., & Velner, Y. (2017). Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. Academic Press. https://doi.org/10.1016/j.jcss.2017.04.005
[Preprint] View | Files available | DOI | Download Preprint (ext.) | 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 | Thesis | IST-REx-ID: 821 | OA
Pavlogiannis, A. (2017). Algorithmic advances in program analysis and their applications. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_854
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 645 | OA
Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., & Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_10
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 684 | OA
Chatterjee, K., & Piterman, N. (2017). Obligation blackwell games and p-automata. Journal of Symbolic Logic. Cambridge University Press. https://doi.org/10.1017/jsl.2016.71
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 

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
 

2017 | Published | Journal Article | IST-REx-ID: 681 | OA
Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J. (2017). Doomsday equilibria for omega-regular games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2016.10.012
[Submitted Version] View | Files available | DOI | Download Submitted 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: 1080 | OA
Reiter, J., Makohon Moore, A., Gerold, J., Božić, I., Chatterjee, K., Iacobuzio Donahue, C., … Nowak, M. (2017). Reconstructing metastatic seeding patterns of human cancers. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14114
[Published Version] View | Files available | DOI | WoS
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed