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.
527 Publications
2017 |
Published |
Book Chapter |
IST-REx-ID: 625 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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: 1080 |
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
2017 |
Published |
Thesis | PhD |
IST-REx-ID: 821 |
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
earlier version | 2017 |
Published |
Conference Paper |
IST-REx-ID: 950 |
Avni, G., Henzinger, T. A., & Chonev, V. K. (2017). Infinite-duration bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21
[Published Version]
View
| Files available
| DOI
| arXiv
2017 |
Published |
Conference Paper |
IST-REx-ID: 645 |
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.)
| WoS
| arXiv
2017 |
Published |
Conference Paper |
IST-REx-ID: 6519 |
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 |
Journal Article |
IST-REx-ID: 653 |
Makohon Moore, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. Nature Publishing Group. https://doi.org/10.1038/ng.3764
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2017 |
Published |
Journal Article |
IST-REx-ID: 671 |
Hilbe, C., Martinez, V., Chatterjee, K., & Nowak, M. (2017). Memory-n strategies of direct reciprocity. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1621239114
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| PubMed | Europe PMC
2017 |
Published |
Journal Article |
IST-REx-ID: 681 |
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.)
| WoS
| arXiv
2017 |
Published |
Journal Article |
IST-REx-ID: 684 |
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.)
| WoS
| arXiv
2017 |
Published |
Journal Article |
IST-REx-ID: 699 |
Veller, C., Hayward, L., Nowak, M., & Hilbe, C. (2017). The red queen and king in finite populations. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1702020114
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| PubMed | Europe PMC
2017 |
Published |
Conference Paper |
IST-REx-ID: 711 |
Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Journal Article |
IST-REx-ID: 716 |
Chatterjee, K., & Velner, Y. (2017). The complexity of mean-payoff pushdown games. Journal of the ACM. ACM. https://doi.org/10.1145/3121408
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv