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.

457 Publications


2018 | Conference Paper | IST-REx-ID: 311 | OA
Chatterjee, K., Goharshady, A. K., & Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89884-1_26
[Published Version] View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 6340 | OA
Goharshady, A. K., Behrouz, A., & Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE. https://doi.org/10.1109/Cybermatics_2018.2018.00231
[Submitted Version] View | Files available | DOI | WoS | arXiv
 

2018 | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). https://doi.org/10.1145/3210257
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

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

2018 | Journal Article | IST-REx-ID: 2 | OA
Hilbe, C., Schmid, L., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Indirect reciprocity with private, noisy, and incomplete information. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1810565115
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | PubMed | Europe PMC
 

2017 | 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 | Journal Article | IST-REx-ID: 464 | OA
Chatterjee, K., Henzinger, M. H., & 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 | Journal Article | IST-REx-ID: 466 | OA
Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017
[Published Version] View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 467 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 465 | OA
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017
[Published Version] View | Files available | DOI
 

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

2017 | 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 | 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 | Journal Article | IST-REx-ID: 10417 | OA
Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158119
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2017 | 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 | 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 | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee, K., Henzinger, M. H., & 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 | 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.)
 

2017 | 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 | 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.)
 

2017 | 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.)
 

2017 | Conference Paper | IST-REx-ID: 6519 | OA
Chatterjee, K., Dvorák, W., Henzinger, M. H., & 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 fuer Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18
[Published Version] View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 653 | OA
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 | PubMed | Europe PMC
 

2017 | Journal Article | IST-REx-ID: 671 | OA
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.) | PubMed | Europe PMC
 

2017 | 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 | 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.)
 

2017 | Journal Article | IST-REx-ID: 699 | OA
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.) | PubMed | Europe PMC
 

2017 | Conference Paper | IST-REx-ID: 711 | OA
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 | Journal Article | IST-REx-ID: 716 | OA
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.) | arXiv
 

2017 | 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.)
 

2017 | Journal Article | IST-REx-ID: 719
Chatterjee, K., & Ehlers, R. (2017). Special issue: Synthesis and SYNT 2014. Acta Informatica. Springer. https://doi.org/10.1007/s00236-017-0299-0
View | DOI
 

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

2017 | Conference Paper | IST-REx-ID: 950 | OA
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 | 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 | 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 | 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 | 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
 

2017 | 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 | 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
View | Files available | DOI | WoS
 

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

2017 | 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 | Journal Article | IST-REx-ID: 744 | OA
Priklopil, T., Chatterjee, K., & Nowak, M. (2017). Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2017.08.025
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

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

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 | Conference Paper | IST-REx-ID: 639 | OA
Chatterjee, K., Fu, H., & Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63390-9_3
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 949 | OA
Chatterjee, K., Goharshady, A. K., & Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer. https://doi.org/10.1007/978-3-319-68167-2_4
[Submitted Version] View | Files available | DOI | WoS
 

2016 | Conference Paper | IST-REx-ID: 1068 | OA
Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.25
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1069 | OA
Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On the skolem problem for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.100
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1070 | OA
Chatterjee, K., & Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.98
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1090 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.24
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications