Please note that IST 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.

350 Publications


2018 | Conference Paper | IST-REx-ID: 5679 | OA
Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.” edited by Sukyoung Ryu, 11275:181–201. Springer, 2018. https://doi.org/10.1007/978-3-030-02768-1_11.
View | DOI | Download Preprint (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 5751 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology 1, no. 1 (2018). https://doi.org/10.1038/s42003-018-0078-7.
View | Files available | DOI
 

2018 | Book Chapter | IST-REx-ID: 59
Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In Handbook of Model Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_27.
View | DOI
 

2018 | Conference Paper | IST-REx-ID: 5967 | OA
Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, 149–50. ACM Press, 2018. https://doi.org/10.1145/3219166.3219198.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee, Krishnendu, Hongfei Fu, Amir Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018:4700–4707. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/653.
View | DOI | Download Preprint (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 5993 | OA
Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems 40, no. 2 (2018): 7. https://doi.org/10.1145/3174800.
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems 40, no. 3 (2018): 9. https://doi.org/10.1145/3210257.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 293 | OA
Hoffman, Moshe, Christian Hilbe, and Martin Nowak. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.” Nature Human Behaviour 2 (2018): 397–404. https://doi.org/10.1038/s41562-018-0354-z.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 297 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 310 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety and Diameter,” 2341–56. ACM, 2018. https://doi.org/10.1137/1.9781611975031.151.
View | DOI | Download Preprint (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 311 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,” 10801:739–67. Springer, 2018. https://doi.org/10.1007/978-3-319-89884-1_26.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 6340 | OA
Goharshady, Amir Kafshdar, Ali Behrouz, and Krishnendu Chatterjee. “Secure Credit Reporting on the Blockchain.” In Proceedings of the IEEE International Conference on Blockchain, 1343–48. IEEE, 2018. https://doi.org/10.1109/Cybermatics_2018.2018.00231.
View | Files available | DOI | arXiv
 

2018 | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies.,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11.
View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 157 | OA
Hilbe, Christian, Štepán Šimsa, Krishnendu Chatterjee, and Martin Nowak. “Evolution of Cooperation in Stochastic Games.” Nature 559, no. 7713 (2018): 246–49. https://doi.org/10.1038/s41586-018-0277-x.
View | Files available | DOI
 

2018 | Journal Article | IST-REx-ID: 198 | OA
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface 15, no. 140 (2018). https://doi.org/10.1098/rsif.2018.0073.
View | Files available | DOI
 

2018 | Book Chapter | IST-REx-ID: 86 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 141 | OA
Chatterjee, Krishnendu, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 143 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotny, Dominik Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS,” F138033:185–94. IEEE, 2018. https://doi.org/10.1145/3209108.3209191.
View | DOI | Download Preprint (ext.)
 

2018 | Conference Paper | IST-REx-ID: 325 | OA
Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotny. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.
View | DOI | Download Preprint (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 34 | OA
Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018.
View | Download Preprint (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 35 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling . AAAI Press, 2018.
View | Download None (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 25 | OA
Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/662.
View | DOI | Download Published Version (ext.)
 

2017 | Journal Article | IST-REx-ID: 716 | OA
Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” Journal of the ACM 64, no. 5 (2017): 34. https://doi.org/10.1145/3121408.
View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 717 | OA
Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences 88 (2017): 236–59. https://doi.org/10.1016/j.jcss.2017.04.005.
View | Files available | DOI | Download Preprint (ext.)
 

2017 | Journal Article | IST-REx-ID: 719
Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.” Acta Informatica 54, no. 6 (2017): 543–44. https://doi.org/10.1007/s00236-017-0299-0.
View | DOI
 

2017 | Journal Article | IST-REx-ID: 744 | OA
Priklopil, Tadeas, Krishnendu Chatterjee, and Martin Nowak. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” Journal of Theoretical Biology 433 (2017): 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: 464 | OA
Chatterjee, Krishnendu, Monika Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science 13, no. 3 (2017). https://doi.org/10.23638/LMCS-13(3:26)2017.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 465 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science 13, no. 3 (2017). https://doi.org/10.23638/LMCS-13(3:23)2017.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 466 | OA
Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science 13, no. 2 (2017). https://doi.org/10.23638/LMCS-13(2:15)2017.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 467 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL) 18, no. 4 (2017). https://doi.org/10.1145/3152769.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 512 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports 7, no. 1 (2017). https://doi.org/10.1038/s41598-017-00107-w.
View | Files available | DOI
 

2017 | Technical Report | IST-REx-ID: 5455 | OA
Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-870-v1-1.
View | Files available | DOI
 

2017 | Technical Report | IST-REx-ID: 5456 | OA
Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee, Krishnendu, Monika Henzinger, and Alexander Svozil. “Faster Algorithms for Mean Payoff Parity Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.
View | Files available | DOI | Download Published Version (ext.)
 

2017 | Research Data | IST-REx-ID: 5559 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak . Strong Amplifiers of Natural Selection. IST Austria, 2017. https://doi.org/10.15479/AT:ISTA:51.
View | Files available | DOI
 

2017 | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.” In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer, 2017. https://doi.org/10.1007/978-3-319-63121-9_18.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 628 | OA
Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.” edited by Rupak Majumdar and Viktor Kunčak, 10426:118–39. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_6.
View | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 645 | OA
Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_10.
View | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 6519 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 653 | OA
Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics 49, no. 3 (2017): 358–66. https://doi.org/10.1038/ng.3764.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 671 | OA
Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.” PNAS 114, no. 18 (2017): 4715–20. https://doi.org/10.1073/pnas.1621239114.
View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 

2017 | Journal Article | IST-REx-ID: 681 | OA
Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean Raskin. “Doomsday Equilibria for Omega-Regular Games.” Information and Computation 254 (2017): 296–315. https://doi.org/10.1016/j.ic.2016.10.012.
View | DOI | Download Submitted Version (ext.)
 

2017 | Journal Article | IST-REx-ID: 684 | OA
Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic 82, no. 2 (2017): 420–52. https://doi.org/10.1017/jsl.2016.71.
View | DOI | Download Submitted Version (ext.)
 

2017 | Journal Article | IST-REx-ID: 699 | OA
Veller, Carl, Laura Hayward, Martin Nowak, and Christian Hilbe. “The Red Queen and King in Finite Populations.” PNAS 114, no. 27 (2017): E5396–5405. https://doi.org/10.1073/pnas.1702020114.
View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 

2017 | Conference Paper | IST-REx-ID: 711 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5.
View | Files available | DOI
 

2017 | Thesis | IST-REx-ID: 821 | OA
Pavlogiannis, Andreas. Algorithmic Advances in Program Analysis and Their Applications. IST Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_854.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 949 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “JTDec: A Tool for Tree Decompositions in Soot.” edited by Deepak D’Souza, 10482:59–66. Springer, 2017. https://doi.org/10.1007/978-3-319-68167-2_4.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 950 | OA
Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration Bidding Games,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21.
View | Files available | DOI | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications