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.




340 Publications

2020 | Thesis | IST-REx-ID: 7196
Tkadlec, J. (2020). A role of graphs in evolutionary processes. IST Austria. https://doi.org/10.15479/AT:ISTA:7196
View | Files available | DOI
 
2020 | Journal Article | IST-REx-ID: 7343   OA
Milutinovic, B., Stock, M., Grasse, A. V., Naderlinger, E., Hilbe, C., & Cremer, S. (2020). Social immunity modulates competition between coinfecting pathogens. Ecology Letters. https://doi.org/10.1111/ele.13458
View | Files available | DOI
 
2020 | Journal Article | IST-REx-ID: 7212   OA
Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2020). Limits on amplifiers of natural selection under death-Birth updating. PLoS Computational Biology, 16, e1007494. https://doi.org/10.1371/journal.pcbi.1007494
View | Files available | DOI | arXiv
 
2020 | Journal Article | IST-REx-ID: 6918
Goharshady, A. K., & Mohammadi, F. (2020). An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety, 193. https://doi.org/10.1016/j.ress.2019.106665
View | DOI
 
2020 | Conference Paper | IST-REx-ID: 7346
Schmid, L., Chatterjee, K., & Schmid, S. (n.d.). The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In Proceedings of the 23rd International Conference on Principles of Distributed Systems (Vol. 153, p. 21). Neuchâtel, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21
View | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6490
Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 6887   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 7183   OA
Brázdil, T., Chatterjee, K., Kucera, A., Novotný, P., & Velan, D. (2019). Deciding fast termination for probabilistic VASS with nondeterminism. In International Symposium on Automated Technology for Verification and Analysis (Vol. 11781, pp. 462–478). Taipei, Taiwan: Springer Nature. https://doi.org/10.1007/978-3-030-31784-3_27
View | DOI | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 7210
Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2019). Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology, 2. https://doi.org/10.1038/s42003-019-0373-y
View | Files available | DOI | PubMed | Europe PMC
 
2019 | Conference Paper | IST-REx-ID: 5948
Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. In International Conference on Verification, Model Checking, and Abstract Interpretation (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer Nature. https://doi.org/10.1007/978-3-030-11245-5_22
View | DOI
 
2019 | Journal Article | IST-REx-ID: 7158
Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems, 41(4). https://doi.org/10.1145/3363525
View | DOI
 
2019 | Journal Article | IST-REx-ID: 7014
Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems, 41(4). https://doi.org/10.1145/3339984
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6884   OA
Avni, G., Henzinger, T. A., & Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.11
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6889   OA
Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6942   OA
Ashok, P., Brázdil, T., Chatterjee, K., Křetínský, J., Lampert, C., & Toman, V. (2019). Strategy representation by decision trees with linear classifiers. In 16th International Conference on Quantitative Evaluation of Systems (Vol. 11785, pp. 109–128). Glasgow, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-30281-8_7
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 7402   OA
Chatterjee, K., & Doyen, L. (2019). Graph planning with expected finite horizon. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Vancouver, BC, Canada: IEEE. https://doi.org/10.1109/lics.2019.8785706
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3314221.3314581
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 6380   OA
Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages, 3(POPL). https://doi.org/10.1145/3290366
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6462   OA
Avni, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., & Pranger, S. (2019). Run-time optimization for learned controllers through quantitative games. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 630–649). New York, NY, United States: Springer. https://doi.org/10.1007/978-3-030-25540-4_36
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6056   OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6885   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6378   OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6780   OA
Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (n.d.). Modular verification for almost-sure termination of probabilistic programs. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . Athens, Greece: ACM.
View | Files available | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6836
Hauser, O. P., Hilbe, C., Chatterjee, K., & Nowak, M. A. (2019). Social dilemmas among unequals. Nature, 572(7770), 524–527. https://doi.org/10.1038/s41586-019-1488-5
View | Files available | DOI
 
2018 | Book Chapter | IST-REx-ID: 59
Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 143   OA
Brázdil, T., Chatterjee, K., Kučera, A., Novotny, P., Velan, D., & Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191
View | DOI | Download (ext.)
 
2018 | Journal Article | IST-REx-ID: 198   OA
Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Language acquisition with communication between learners. Journal of the Royal Society Interface, 15(140). https://doi.org/10.1098/rsif.2018.0073
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 35   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.
View | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 66   OA
Chatterjee, K., Goharshady, A., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 5967   OA
Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM Press. https://doi.org/10.1145/3219166.3219198
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 79   OA
Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-319-99154-2_4
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 24   OA
Chatterjee, K., Elgyütt, A., Novotny, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 310   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, USA: ACM. https://doi.org/10.1137/1.9781611975031.151
View | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 454   OA
Reiter, J., Hilbe, C., Rand, D., Chatterjee, K., & Nowak, M. (2018). Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications, 9(1). https://doi.org/10.1038/s41467-017-02721-8
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 738   OA
Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems, 54(1), 166–207. https://doi.org/10.1007/s11241-017-9293-4
View | Files available | DOI
 
2018 | Book Chapter | IST-REx-ID: 86   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 5993   OA
Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems, 40(2), 7. https://doi.org/10.1145/3174800
View | Files available | DOI | Download (ext.) | 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, 40(3), 9. https://doi.org/10.1145/3210257
View | Files available | DOI | Download (ext.) | arXiv
 
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
View | Files available | DOI | arXiv
 
2018 | Journal Article | IST-REx-ID: 157   OA
Hilbe, C., Šimsa, Š., Chatterjee, K., & Nowak, M. (2018). Evolution of cooperation in stochastic games. Nature, 559(7713), 246–249. https://doi.org/10.1038/s41586-018-0277-x
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 311   OA
Chatterjee, K., Goharshady, A., & 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
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 25
Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 141   OA
Chatterjee, K., Henzinger, M., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13
View | Files available | DOI
 
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, 115(48), 12241–12246. https://doi.org/10.1073/pnas.1810565115
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
2018 | Conference Paper | IST-REx-ID: 297   OA
Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 293   OA
Hoffman, M., Hilbe, C., & Nowak, M. (2018). The signal-burying game can explain why we obscure positive traits and good deeds. Nature Human Behaviour, 2, 397–404. https://doi.org/10.1038/s41562-018-0354-z
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 325   OA
Agrawal, S., Chatterjee, K., & Novotny, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122
View | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 419   OA
Hilbe, C., Chatterjee, K., & Nowak, M. (2018). Partners and rivals in direct reciprocity. Nature Human Behaviour, 2, 469–477. https://doi.org/10.1038/s41562-018-0320-9
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 34   OA
Chatterjee, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.
View | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 5679   OA
Huang, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. https://doi.org/10.1007/978-3-030-02768-1_11
View | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5751
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology, 1(1). https://doi.org/10.1038/s42003-018-0078-7
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 5977   OA
Chatterjee, K., Fu, H., Goharshady, A., & 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
View | DOI | Download (ext.) | arXiv
 
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, 433, 64–72. https://doi.org/10.1016/j.jtbi.2017.08.025
View | Files available | DOI | PubMed | Europe PMC
 
2017 | Journal Article | IST-REx-ID: 1065   OA
Chatterjee, K., & Osang, G. F. (2017). Pushdown reachability with constant treewidth. Information Processing Letters, 122, 25–29. https://doi.org/10.1016/j.ipl.2017.02.003
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1407
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, 23(2), 230–253. https://doi.org/10.1016/j.nahs.2016.04.006
View | Files available | DOI | Download (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, 13(3). https://doi.org/10.23638/LMCS-13(3:23)2017
View | Files available | DOI
 
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, 254, 296–315. https://doi.org/10.1016/j.ic.2016.10.012
View | DOI | Download (ext.)
 
2017 | Thesis | IST-REx-ID: 821   OA
Pavlogiannis, A. (2017). Algorithmic advances in program analysis and their applications. IST Austria. https://doi.org/10.15479/AT:ISTA:th_854
View | Files available | DOI
 
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
View | Files available | DOI
 
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, 114(27), E5396–E5405. https://doi.org/10.1073/pnas.1702020114
View | DOI | Download (ext.) | PubMed | Europe PMC
 
2017 | Journal Article | IST-REx-ID: 719
Chatterjee, K., & Ehlers, R. (2017). Special issue: Synthesis and SYNT 2014. Acta Informatica, 54(6), 543–544. https://doi.org/10.1007/s00236-017-0299-0
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 1009   OA
Chatterjee, K., Novotny, 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.
View | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 1066
Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2017). Quantitative fair simulation games. Information and Computation, 254(2), 143–166. https://doi.org/10.1016/j.ic.2016.10.006
View | Files available | DOI
 
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, 8. https://doi.org/10.1038/ncomms14114
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1294
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, 84, 144–170. https://doi.org/10.1016/j.jcss.2016.09.009
View | Files available | DOI
 
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, 13(2). https://doi.org/10.23638/LMCS-13(2:15)2017
View | Files available | DOI
 
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
View | Files available | DOI
 
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
View | DOI | Download (ext.)
 
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, 7(1), 82. https://doi.org/10.1038/s41598-017-00107-w
View | Files available | DOI
 
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
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
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1194   OA
Chatterjee, K., Novotny, 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
View | DOI | Download (ext.)
 
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), 18(4). https://doi.org/10.1145/3152769
View | Files available | DOI | Download (ext.) | arXiv
 
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
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 671   OA
Hilbe, C., Martinez, V., Chatterjee, K., & Nowak, M. (2017). Memory-n strategies of direct reciprocity. PNAS, 114(18), 4715–4720. https://doi.org/10.1073/pnas.1621239114
View | DOI | Download (ext.) | PubMed | Europe PMC
 
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
View | Files available | DOI | arXiv
 
2017 | Journal Article | IST-REx-ID: 684   OA
Chatterjee, K., & Piterman, N. (2017). Obligation blackwell games and p-automata. Journal of Symbolic Logic, 82(2), 420–452. https://doi.org/10.1017/jsl.2016.71
View | DOI | Download (ext.)
 
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
View | Files available | DOI
 
2017 | 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
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, 49(3), 358–366. https://doi.org/10.1038/ng.3764
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, 64(5), 34. https://doi.org/10.1145/3121408
View | DOI | Download (ext.) | arXiv
 
2017 | Conference Paper | IST-REx-ID: 949   OA
Chatterjee, K., Goharshady, A., & 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
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 639   OA
Chatterjee, K., Fu, H., & Goharshady, A. (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
View | Files available | DOI | Download (ext.) | arXiv
 
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
View | Files available | DOI | Download (ext.)
 
2017 | 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, 13(3). https://doi.org/10.23638/LMCS-13(3:26)2017
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
View | DOI | Download (ext.)
 
2017 | 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 fuer Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18
View | Files available | DOI
 
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, 88, 236–259. https://doi.org/10.1016/j.jcss.2017.04.005
View | Files available | DOI | Download (ext.)
 
2017 | Research Data | IST-REx-ID: 5559
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak , M. (2017). Strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:ISTA:51
View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1200   OA
Hilbe, C., & Traulsen, A. (2016). Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze. Physics of Life Reviews, 19, 29–31. https://doi.org/10.1016/j.plrev.2016.10.004
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1325   OA
Brázdil, T., Forejt, V., Kučera, A., & Novotny, P. (2016). Stability in graphs and games (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2016.10
View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1426   OA
Chakra, M., Hilbe, C., & Traulsen, A. (2016). Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites. Royal Society Open Science, 3(5). https://doi.org/10.1098/rsos.160036
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.
View | Files available
 
2016 | Conference Paper | IST-REx-ID: 1438
Chatterjee, K., Fu, H., Novotny, P., & Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837639
View | Files available | DOI | Download (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1326   OA
Brázdil, T., Kučera, A., & Novotny, P. (2016). Optimizing the expected mean payoff in Energy Markov Decision Processes (Vol. 9938, pp. 32–49). Presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan: Springer. https://doi.org/10.1007/978-3-319-46520-3_3
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1333   OA
Milinski, M., Hilbe, C., Semmann, D., Sommerfeld, R., & Marotzke, J. (2016). Humans choose representatives who enforce cooperation in social dilemmas through extortion. Nature Communications, 7. https://doi.org/10.1038/ncomms10915
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 478   OA
Chatterjee, K., & Ibsen-Jensen, R. (2016). The complexity of deciding legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands: IOS Press. https://doi.org/10.3233/978-1-61499-672-9-1432
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1340   OA
Hansen, K., Ibsen-Jensen, R., & Koucký, M. (2016). The big match in small space (Vol. 9928, pp. 64–76). Presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-53354-3_6
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1477
Chatterjee, K., Chmelik, M., & Tracol, M. (2016). What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences, 82(5), 878–911. https://doi.org/10.1016/j.jcss.2016.02.009
View | Files available | DOI | Download (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 480   OA
Chatterjee, K., & Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934513
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed