Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,”https://doi.org/10.1007/978-3-319-96142-2_13__10982:178–97. Springer, 2018.https://doi.org/10.1007/978-3-319-96142-2_13 .
LibreCat: https://research-explorer.ista.ac.at/record/141
DOI: 10.1007/978-3-319-96142-2_13
WoS: 000491469700013

Hoffman, Moshe, Christian Hilbe, and Martin Nowak. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.”https://doi.org/10.1038/s41562-018-0354-z__Nature Human Behaviour. Nature Publishing Group, 2018.https://doi.org/10.1038/s41562-018-0354-z .
LibreCat: https://research-explorer.ista.ac.at/record/293
DOI: 10.1038/s41562-018-0354-z
WoS: 000435551300009

Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.”https://doi.org/10.1145/3219166.3219198__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 .
LibreCat: https://research-explorer.ista.ac.at/record/5967
DOI: 10.1145/3219166.3219198
WoS: 000492755100020

Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.”https://doi.org/10.1145/3174800__ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018.https://doi.org/10.1145/3174800 .
LibreCat: https://research-explorer.ista.ac.at/record/5993
DOI: 10.1145/3174800
WoS: 000434634500003
arXiv: 1510.08517

Horák, Karel, Branislav Bosanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.”https://doi.org/10.24963/ijcai.2018/662__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 .
LibreCat: https://research-explorer.ista.ac.at/record/25
DOI: 10.24963/ijcai.2018/662
WoS: 000764175404127

Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,”https://doi.org/10.24963/ijcai.2018/652__2018:4692–99. IJCAI, 2018.https://doi.org/10.24963/ijcai.2018/652 .
LibreCat: https://research-explorer.ista.ac.at/record/24
DOI: 10.24963/ijcai.2018/652
WoS: 000764175404117
arXiv: 1804.10601

Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/34
WoS: 000492986200006
arXiv: 1710.00675

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling . AAAI Press, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/35
WoS: 000492986200007
arXiv: 1804.07031

Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.”https://doi.org/10.1007/s11241-017-9293-4__Real-Time Systems. Springer, 2018.https://doi.org/10.1007/s11241-017-9293-4 .
LibreCat: https://research-explorer.ista.ac.at/record/738
DOI: 10.1007/s11241-017-9293-4
WoS: 000419955500006

Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.”https://doi.org/10.1098/rsif.2018.0073__Journal of the Royal Society Interface. The Royal Society, 2018.https://doi.org/10.1098/rsif.2018.0073 .
LibreCat: https://research-explorer.ista.ac.at/record/198
DOI: 10.1098/rsif.2018.0073
WoS: 000428576200023
PMID: 29593089

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.”https://doi.org/10.1038/s42003-018-0078-7__Communications Biology. Springer Nature, 2018.https://doi.org/10.1038/s42003-018-0078-7 .
LibreCat: https://research-explorer.ista.ac.at/record/5751
DOI: 10.1038/s42003-018-0078-7
WoS: 000461126500071

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,”https://doi.org/10.4230/LIPIcs.CONCUR.2018.11__Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPIcs.CONCUR.2018.11 .
LibreCat: https://research-explorer.ista.ac.at/record/66
DOI: 10.4230/LIPIcs.CONCUR.2018.11
arXiv: 1806.03108

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,”https://doi.org/10.1007/978-3-319-89884-1_26__10801:739–67. Springer, 2018.https://doi.org/10.1007/978-3-319-89884-1_26 .
LibreCat: https://research-explorer.ista.ac.at/record/311
DOI: 10.1007/978-3-319-89884-1_26

Goharshady, Amir Kafshdar, Ali Behrouz, and Krishnendu Chatterjee. “Secure Credit Reporting on the Blockchain.”https://doi.org/10.1109/Cybermatics_2018.2018.00231__In Proceedings of the IEEE International Conference on Blockchain, 1343–48. IEEE, 2018.https://doi.org/10.1109/Cybermatics_2018.2018.00231 .
LibreCat: https://research-explorer.ista.ac.at/record/6340
DOI: 10.1109/Cybermatics_2018.2018.00231
WoS: 000481634500196
arXiv: 1805.09104

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.”https://doi.org/10.1145/3210257__ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018.https://doi.org/10.1145/3210257 .
LibreCat: https://research-explorer.ista.ac.at/record/6009
DOI: 10.1145/3210257
WoS: 000444694800001
arXiv: 1510.07565

Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.”https://doi.org/10.24963/ijcai.2018/653__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 .
LibreCat: https://research-explorer.ista.ac.at/record/5977
DOI: 10.24963/ijcai.2018/653
WoS: 000764175404118
arXiv: 1804.08984

Hilbe, Christian, Laura Schmid, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.”https://doi.org/10.1073/pnas.1810565115__PNAS. National Academy of Sciences, 2018.https://doi.org/10.1073/pnas.1810565115 .
LibreCat: https://research-explorer.ista.ac.at/record/2
DOI: 10.1073/pnas.1810565115
WoS: 000451351000063
PMID: 30429320

Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost P Katoen. “A New Proof Rule for Almost-Sure Termination.”https://doi.org/10.1145/3158121__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017.https://doi.org/10.1145/3158121 .
LibreCat: https://research-explorer.ista.ac.at/record/10418
DOI: 10.1145/3158121
arXiv: 1711.03588

Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.”https://doi.org/10.23638/LMCS-13(3:26)2017__Logical Methods in Computer Science. International Federation of Computational Logic, 2017.https://doi.org/10.23638/LMCS-13(3:26)2017 .
LibreCat: https://research-explorer.ista.ac.at/record/464
DOI: 10.23638/LMCS-13(3:26)2017
arXiv: 1410.0833

Chatterjee, Krishnendu, Zuzana Ketínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.”https://doi.org/10.23638/LMCS-13(2:15)2017__Logical Methods in Computer Science. International Federation of Computational Logic, 2017.https://doi.org/10.23638/LMCS-13(2:15)2017 .
LibreCat: https://research-explorer.ista.ac.at/record/466
DOI: 10.23638/LMCS-13(2:15)2017

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.”https://doi.org/10.1145/3152769__ACM Transactions on Computational Logic (TOCL). ACM, 2017.https://doi.org/10.1145/3152769 .
LibreCat: https://research-explorer.ista.ac.at/record/467
DOI: 10.1145/3152769
arXiv: 1606.03598

Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.”https://doi.org/10.23638/LMCS-13(3:23)2017__Logical Methods in Computer Science. International Federation of Computational Logic, 2017.https://doi.org/10.23638/LMCS-13(3:23)2017 .
LibreCat: https://research-explorer.ista.ac.at/record/465
DOI: 10.23638/LMCS-13(3:23)2017

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.”https://doi.org/10.1038/s41598-017-00107-w__Scientific Reports. Nature Publishing Group, 2017.https://doi.org/10.1038/s41598-017-00107-w .
LibreCat: https://research-explorer.ista.ac.at/record/512
DOI: 10.1038/s41598-017-00107-w

Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.”https://doi.org/10.1145/3158118__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017.https://doi.org/10.1145/3158118 .
LibreCat: https://research-explorer.ista.ac.at/record/10416
DOI: 10.1145/3158118
arXiv: 1910.00241

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 .
LibreCat: https://research-explorer.ista.ac.at/record/5455
DOI: 10.15479/AT:IST-2017-870-v1-1

Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.”https://doi.org/10.1145/3158119__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017.https://doi.org/10.1145/3158119 .
LibreCat: https://research-explorer.ista.ac.at/record/10417
DOI: 10.1145/3158119
arXiv: 1610.01188

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 .
LibreCat: https://research-explorer.ista.ac.at/record/5456
DOI: 10.15479/AT:IST-2017-872-v1-1

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.”https://doi.org/10.4230/LIPIcs.MFCS.2017.61__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 .
LibreCat: https://research-explorer.ista.ac.at/record/551
DOI: 10.4230/LIPIcs.MFCS.2017.61

Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.”https://doi.org/10.4230/LIPIcs.MFCS.2017.39__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 .
LibreCat: https://research-explorer.ista.ac.at/record/552
DOI: 10.4230/LIPIcs.MFCS.2017.39

Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.”https://doi.org/10.4230/LIPIcs.MFCS.2017.55__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 .
LibreCat: https://research-explorer.ista.ac.at/record/553
DOI: 10.4230/LIPIcs.MFCS.2017.55

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.”https://doi.org/10.1007/978-3-319-63121-9_18__In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017.https://doi.org/10.1007/978-3-319-63121-9_18 .
LibreCat: https://research-explorer.ista.ac.at/record/625
DOI: 10.1007/978-3-319-63121-9_18

Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.”https://doi.org/10.1007/978-3-319-63387-9_6__edited by Rupak Majumdar and Viktor Kundak, 10426:118–39. Springer, 2017.https://doi.org/10.1007/978-3-319-63387-9_6 .
LibreCat: https://research-explorer.ista.ac.at/record/628
DOI: 10.1007/978-3-319-63387-9_6

Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.”https://doi.org/10.1007/978-3-319-63387-9_10__edited by Rupak Majumdar and Viktor Kundak, 10426:201–21. Springer, 2017.https://doi.org/10.1007/978-3-319-63387-9_10 .
LibreCat: https://research-explorer.ista.ac.at/record/645
DOI: 10.1007/978-3-319-63387-9_10

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,”https://doi.org/10.4230/LIPICS.CSL.2017.18__Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017.https://doi.org/10.4230/LIPICS.CSL.2017.18 .
LibreCat: https://research-explorer.ista.ac.at/record/6519
DOI: 10.4230/LIPICS.CSL.2017.18

Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Boei, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.”https://doi.org/10.1038/ng.3764__Nature Genetics. Nature Publishing Group, 2017.https://doi.org/10.1038/ng.3764 .
LibreCat: https://research-explorer.ista.ac.at/record/653
DOI: 10.1038/ng.3764
PMID: 28092682

Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.”https://doi.org/10.1073/pnas.1621239114__PNAS. National Academy of Sciences, 2017.https://doi.org/10.1073/pnas.1621239114 .
LibreCat: https://research-explorer.ista.ac.at/record/671
DOI: 10.1073/pnas.1621239114
PMID: 28420786

Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean Raskin. “Doomsday Equilibria for Omega-Regular Games.”https://doi.org/10.1016/j.ic.2016.10.012__Information and Computation. Elsevier, 2017.https://doi.org/10.1016/j.ic.2016.10.012 .
LibreCat: https://research-explorer.ista.ac.at/record/681
DOI: 10.1016/j.ic.2016.10.012
arXiv: 1311.3238

Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.”https://doi.org/10.1017/jsl.2016.71__Journal of Symbolic Logic. Cambridge University Press, 2017.https://doi.org/10.1017/jsl.2016.71 .
LibreCat: https://research-explorer.ista.ac.at/record/684
DOI: 10.1017/jsl.2016.71

Veller, Carl, Laura Hayward, Martin Nowak, and Christian Hilbe. “The Red Queen and King in Finite Populations.”https://doi.org/10.1073/pnas.1702020114__PNAS. National Academy of Sciences, 2017.https://doi.org/10.1073/pnas.1702020114 .
LibreCat: https://research-explorer.ista.ac.at/record/699
DOI: 10.1073/pnas.1702020114
PMID: 28630336

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,”https://doi.org/10.4230/LIPIcs.CONCUR.2017.5__Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.CONCUR.2017.5 .
LibreCat: https://research-explorer.ista.ac.at/record/711
DOI: 10.4230/LIPIcs.CONCUR.2017.5

Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.”https://doi.org/10.1145/3121408__Journal of the ACM. ACM, 2017.https://doi.org/10.1145/3121408 .
LibreCat: https://research-explorer.ista.ac.at/record/716
DOI: 10.1145/3121408
arXiv: 1201.2829

Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.”https://doi.org/10.1016/j.jcss.2017.04.005__Journal of Computer and System Sciences. Academic Press, 2017.https://doi.org/10.1016/j.jcss.2017.04.005 .
LibreCat: https://research-explorer.ista.ac.at/record/717
DOI: 10.1016/j.jcss.2017.04.005

Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.”https://doi.org/10.1007/s00236-017-0299-0__Acta Informatica. Springer, 2017.https://doi.org/10.1007/s00236-017-0299-0 .
LibreCat: https://research-explorer.ista.ac.at/record/719
DOI: 10.1007/s00236-017-0299-0

Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.”https://doi.org/10.1007/978-3-662-54577-5_26__In Tools and Algorithms for the Construction and Analysis of Systems, 10205:443–60. Springer, 2017.https://doi.org/10.1007/978-3-662-54577-5_26 .
LibreCat: https://research-explorer.ista.ac.at/record/13160
DOI: 10.1007/978-3-662-54577-5_26
arXiv: 1701.05738

Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration Bidding Games,”https://doi.org/10.4230/LIPIcs.CONCUR.2017.21__Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.CONCUR.2017.21 .
LibreCat: https://research-explorer.ista.ac.at/record/950
DOI: 10.4230/LIPIcs.CONCUR.2017.21
arXiv: 1705.01433

Pavlogiannis, Andreas. “Algorithmic Advances in Program Analysis and Their Applications.”https://doi.org/10.15479/AT:ISTA:th_854__Institute of Science and Technology Austria, 2017.https://doi.org/10.15479/AT:ISTA:th_854 .
LibreCat: https://research-explorer.ista.ac.at/record/821
DOI: 10.15479/AT:ISTA:th_854

Svoreová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cbrná, and Celin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”https://doi.org/10.1016/j.nahs.2016.04.006__Nonlinear Analysis: Hybrid Systems. Elsevier, 2017.https://doi.org/10.1016/j.nahs.2016.04.006 .
LibreCat: https://research-explorer.ista.ac.at/record/1407
DOI: 10.1016/j.nahs.2016.04.006
WoS: 000390637000014
arXiv: 1410.5387

Brázdil, Tomás, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Trading Performance for Stability in Markov Decision Processes.”https://doi.org/10.1016/j.jcss.2016.09.009__Journal of Computer and System Sciences. Elsevier, 2017.https://doi.org/10.1016/j.jcss.2016.09.009 .
LibreCat: https://research-explorer.ista.ac.at/record/1294
DOI: 10.1016/j.jcss.2016.09.009
WoS: 000388430000011

Reiter, Johannes, Alvin Makohon Moore, Jeffrey Gerold, Ivana Boei, Krishnendu Chatterjee, Christine Iacobuzio Donahue, Bert Vogelstein, and Martin Nowak. “Reconstructing Metastatic Seeding Patterns of Human Cancers.”https://doi.org/10.1038/ncomms14114__Nature Communications. Nature Publishing Group, 2017.https://doi.org/10.1038/ncomms14114 .
LibreCat: https://research-explorer.ista.ac.at/record/1080
DOI: 10.1038/ncomms14114
WoS: 000393096600001

Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with Constant Treewidth.”https://doi.org/10.1016/j.ipl.2017.02.003__Information Processing Letters. Elsevier, 2017.https://doi.org/10.1016/j.ipl.2017.02.003 .
LibreCat: https://research-explorer.ista.ac.at/record/1065
DOI: 10.1016/j.ipl.2017.02.003
WoS: 000399506600005

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. “Quantitative Fair Simulation Games.”https://doi.org/10.1016/j.ic.2016.10.006__Information and Computation. Elsevier, 2017.https://doi.org/10.1016/j.ic.2016.10.006 .
LibreCat: https://research-explorer.ista.ac.at/record/1066
DOI: 10.1016/j.ic.2016.10.006
WoS: 000402025600002

Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.”https://doi.org/10.1007/978-3-662-54434-1_11__edited by Hongseok Yang, 10201:287–313. Springer, 2017.https://doi.org/10.1007/978-3-662-54434-1_11 .
LibreCat: https://research-explorer.ista.ac.at/record/1011
DOI: 10.1007/978-3-662-54434-1_11
WoS: 000681702400011

Chatterjee, Krishnendu, Petr Novotný, Guillermo Pérez, Jean Raskin, and Djordje Zikelic. “Optimizing Expectation with Guarantees in POMDPs.” In Proceedings of the 31st AAAI Conference on Artificial Intelligence, 5:3725–32. AAAI Press, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/1009
WoS: 000485630703107

Priklopil, Tadeas, Krishnendu Chatterjee, and Martin Nowak. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.”https://doi.org/10.1016/j.jtbi.2017.08.025__https://doi.org/10.1016/j.jtbi.2017.08.025__Journal of Theoretical Biology. Elsevier, 2017.https://doi.org/10.1016/j.jtbi.2017.08.025 .
LibreCat: https://research-explorer.ista.ac.at/record/744
DOI: 10.1016/j.jtbi.2017.08.025
WoS: 000412039800007
PMID: 28867224

Chatterjee, Krishnendu, Petr Novotný, and Djordje Zikelic. “Stochastic Invariants for Probabilistic Termination,”https://doi.org/10.1145/3009837.3009873__52:145–60. ACM, 2017.https://doi.org/10.1145/3009837.3009873 .
LibreCat: https://research-explorer.ista.ac.at/record/1194
DOI: 10.1145/3009837.3009873
WoS: 000408311200013

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak . “Strong Amplifiers of Natural Selection.”https://doi.org/10.15479/AT:ISTA:51__Institute of Science and Technology Austria, 2017.https://doi.org/10.15479/AT:ISTA:51 .
LibreCat: https://research-explorer.ista.ac.at/record/5559
DOI: 10.15479/AT:ISTA:51

Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst Case Analysis of Recursive Programs.”https://doi.org/10.1007/978-3-319-63390-9_3__edited by Rupak Majumdar and Viktor Kundak, 10427:41–63. Springer, 2017.https://doi.org/10.1007/978-3-319-63390-9_3 .
LibreCat: https://research-explorer.ista.ac.at/record/639
DOI: 10.1007/978-3-319-63390-9_3
arXiv: 1705.00317

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “JTDec: A Tool for Tree Decompositions in Soot.”https://doi.org/10.1007/978-3-319-68167-2_4__edited by Deepak D’Souza, 10482:59–66. Springer, 2017.https://doi.org/10.1007/978-3-319-68167-2_4 .
LibreCat: https://research-explorer.ista.ac.at/record/949
DOI: 10.1007/978-3-319-68167-2_4
WoS: 000723567800004

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,”https://doi.org/10.4230/LIPIcs.MFCS.2016.25__Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.https://doi.org/10.4230/LIPIcs.MFCS.2016.25 .
LibreCat: https://research-explorer.ista.ac.at/record/1068
DOI: 10.4230/LIPIcs.MFCS.2016.25

Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem Problem for Continuous Linear Dynamical Systems,”https://doi.org/10.4230/LIPIcs.ICALP.2016.100__Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.https://doi.org/10.4230/LIPIcs.ICALP.2016.100 .
LibreCat: https://research-explorer.ista.ac.at/record/1069
DOI: 10.4230/LIPIcs.ICALP.2016.100

Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for Synchronization Properties,”https://doi.org/10.4230/LIPIcs.ICALP.2016.98__Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.https://doi.org/10.4230/LIPIcs.ICALP.2016.98 .
LibreCat: https://research-explorer.ista.ac.at/record/1070
DOI: 10.4230/LIPIcs.ICALP.2016.98

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Limit-Average Automata of Bounded Width,”https://doi.org/10.4230/LIPIcs.MFCS.2016.24__Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.https://doi.org/10.4230/LIPIcs.MFCS.2016.24 .
LibreCat: https://research-explorer.ista.ac.at/record/1090
DOI: 10.4230/LIPIcs.MFCS.2016.24

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Automata under Probabilistic Semantics.”https://doi.org/10.1145/2933575.2933588__In Proceedings of the 31st Annual ACM/IEEE Symposium, 76–85. IEEE, 2016.https://doi.org/10.1145/2933575.2933588 .
LibreCat: https://research-explorer.ista.ac.at/record/1138
DOI: 10.1145/2933575.2933588
arXiv: 1604.06764

Chatterjee, Krishnendu, Wolfgang Dvoák, Monika H Henzinger, and Veronika Loitzenbauer. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.”https://doi.org/10.1145/2933575.2935304__In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 197–206. IEEE, 2016.https://doi.org/10.1145/2933575.2935304 .
LibreCat: https://research-explorer.ista.ac.at/record/1140
DOI: 10.1145/2933575.2935304
arXiv: 1602.02670

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1182

Hilbe, Christian, and Arne Traulsen. “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.”https://doi.org/10.1016/j.plrev.2016.10.004__Physics of Life Reviews. Elsevier, 2016.https://doi.org/10.1016/j.plrev.2016.10.004 .
LibreCat: https://research-explorer.ista.ac.at/record/1200
DOI: 10.1016/j.plrev.2016.10.004

Pandey, Vineet, and Krishnendu Chatterjee. “Game-Theoretic Models Identify Useful Principles for Peer Collaboration in Online Learning Platforms.”https://doi.org/10.1145/2818052.2869122__In Proceedings of the ACM Conference on Computer Supported Cooperative Work, 26:365–68. ACM, 2016.https://doi.org/10.1145/2818052.2869122 .
LibreCat: https://research-explorer.ista.ac.at/record/1245
DOI: 10.1145/2818052.2869122

Brázdil, Tomás, Vojtbch Forejt, Antonín Kudera, and Petr Novotný. “Stability in Graphs and Games,”https://doi.org/10.4230/LIPIcs.CONCUR.2016.10__Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.https://doi.org/10.4230/LIPIcs.CONCUR.2016.10 .
LibreCat: https://research-explorer.ista.ac.at/record/1325
DOI: 10.4230/LIPIcs.CONCUR.2016.10

Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, 2016–January:88–96. AAAI Press, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1324

Brázdil, Tomás, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, and Petr Novotný. “Stochastic Shortest Path with Energy Constraints in POMDPs.” In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, 1465–66. ACM, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1327

Brázdil, Tomás, Antonín Kudera, and Petr Novotný. “Optimizing the Expected Mean Payoff in Energy Markov Decision Processes,”https://doi.org/10.1007/978-3-319-46520-3_3__9938:32–49. Springer, 2016.https://doi.org/10.1007/978-3-319-46520-3_3 .
LibreCat: https://research-explorer.ista.ac.at/record/1326
DOI: 10.1007/978-3-319-46520-3_3

Milinski, Manfred, Christian Hilbe, Dirk Semmann, Ralf Sommerfeld, and Jochem Marotzke. “Humans Choose Representatives Who Enforce Cooperation in Social Dilemmas through Extortion.”https://doi.org/10.1038/ncomms10915__Nature Communications. Nature Publishing Group, 2016.https://doi.org/10.1038/ncomms10915 .
LibreCat: https://research-explorer.ista.ac.at/record/1333
DOI: 10.1038/ncomms10915

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Monitor Automata,”https://doi.org/10.1007/978-3-662-53413-7_2__9837:23–38. Springer, 2016.https://doi.org/10.1007/978-3-662-53413-7_2 .
LibreCat: https://research-explorer.ista.ac.at/record/1335
DOI: 10.1007/978-3-662-53413-7_2

Hansen, Kristoffer, Rasmus Ibsen-Jensen, and Michal Koucký. “The Big Match in Small Space,”https://doi.org/10.1007/978-3-662-53354-3_6__9928:64–76. Springer, 2016.https://doi.org/10.1007/978-3-662-53354-3_6 .
LibreCat: https://research-explorer.ista.ac.at/record/1340
DOI: 10.1007/978-3-662-53354-3_6

Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Complexity of the Orbit Problem.”https://doi.org/10.1145/2857050__Journal of the ACM. ACM, 2016.https://doi.org/10.1145/2857050 .
LibreCat: https://research-explorer.ista.ac.at/record/1380
DOI: 10.1145/2857050

Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On Recurrent Reachability for Continuous Linear Dynamical Systems.”https://doi.org/10.1145/2933575.2934548__In LICS ’16, 515–24. IEEE, 2016.https://doi.org/10.1145/2933575.2934548 .
LibreCat: https://research-explorer.ista.ac.at/record/1389
DOI: 10.1145/2933575.2934548

Chakra, Maria, Christian Hilbe, and Arne Traulsen. “Coevolutionary Interactions between Farmers and Mafia Induce Host Acceptance of Avian Brood Parasites.”https://doi.org/10.1098/rsos.160036__Royal Society Open Science. Royal Society, The, 2016.https://doi.org/10.1098/rsos.160036 .
LibreCat: https://research-explorer.ista.ac.at/record/1426
DOI: 10.1098/rsos.160036

Baek, Seung, Hyeongchai Jeong, Christian Hilbe, and Martin Nowak. “Comparing Reactive and Memory-One Strategies of Direct Reciprocity.”https://doi.org/10.1038/srep25676__Scientific Reports. Nature Publishing Group, 2016.https://doi.org/10.1038/srep25676 .
LibreCat: https://research-explorer.ista.ac.at/record/1423
DOI: 10.1038/srep25676

Lohse, Konrad, Martin Chmelik, Simon Martin, and Nicholas H Barton. “Efficient Strategies for Calculating Blockwise Likelihoods under the Coalescent.”https://doi.org/10.1534/genetics.115.183814__Genetics. Genetics Society of America, 2016.https://doi.org/10.1534/genetics.115.183814 .
LibreCat: https://research-explorer.ista.ac.at/record/1518
DOI: 10.1534/genetics.115.183814
PMID: 26715666

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding Legality of a Single Step of Magic: The Gathering,”https://doi.org/10.3233/978-1-61499-672-9-1432__285:1432–39. IOS Press, 2016.https://doi.org/10.3233/978-1-61499-672-9-1432 .
LibreCat: https://research-explorer.ista.ac.at/record/478
DOI: 10.3233/978-1-61499-672-9-1432

Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives,”https://doi.org/10.1145/2933575.2934513__05-08-July-2016:247–56. IEEE, 2016.https://doi.org/10.1145/2933575.2934513 .
LibreCat: https://research-explorer.ista.ac.at/record/480
DOI: 10.1145/2933575.2934513

Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with <9-Regular Objectives.”https://doi.org/10.1016/j.jcss.2016.02.009__Journal of Computer and System Sciences. Elsevier, 2016.https://doi.org/10.1016/j.jcss.2016.02.009 .
LibreCat: https://research-explorer.ista.ac.at/record/1477
DOI: 10.1016/j.jcss.2016.02.009
arXiv: 1309.2802

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.”https://doi.org/10.1016/j.artint.2016.01.007__Artificial Intelligence. Elsevier, 2016.https://doi.org/10.1016/j.artint.2016.01.007 .
LibreCat: https://research-explorer.ista.ac.at/record/1529
DOI: 10.1016/j.artint.2016.01.007
arXiv: 1411.3880

Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. Quantitative Interprocedural Analysis. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2016-523-v1-1 .
LibreCat: https://research-explorer.ista.ac.at/record/5445
DOI: 10.15479/AT:IST-2016-523-v1-1

Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016:3225–32. AAAI Press, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1166

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Amplification on Undirected Population Structures: Comets Beat Stars. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2016-648-v1-1 .
LibreCat: https://research-explorer.ista.ac.at/record/5449
DOI: 10.15479/AT:IST-2016-648-v1-1

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2017-749-v3-1 .
LibreCat: https://research-explorer.ista.ac.at/record/5453
DOI: 10.15479/AT:IST-2017-749-v3-1

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Strong Amplifiers of Natural Selection. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2016-728-v1-1 .
LibreCat: https://research-explorer.ista.ac.at/record/5451
DOI: 10.15479/AT:IST-2016-728-v1-1

Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Experimental Game Instructions.”https://doi.org/10.1371/journal.pone.0163867.s008__Public Library of Science, 2016.https://doi.org/10.1371/journal.pone.0163867.s008 .
LibreCat: https://research-explorer.ista.ac.at/record/9867
DOI: 10.1371/journal.pone.0163867.s008

Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Asymmetric Power Boosts Extortion in an Economic Experiment.”https://doi.org/10.1371/journal.pone.0163867__PLoS One. Public Library of Science, 2016.https://doi.org/10.1371/journal.pone.0163867 .
LibreCat: https://research-explorer.ista.ac.at/record/1322
DOI: 10.1371/journal.pone.0163867

Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Experimental Data.”https://doi.org/10.1371/journal.pone.0163867.s009__Public Library of Science, 2016.https://doi.org/10.1371/journal.pone.0163867.s009 .
LibreCat: https://research-explorer.ista.ac.at/record/9868
DOI: 10.1371/journal.pone.0163867.s009

Chmelik, Martin. “Algorithms for Partially Observable Markov Decision Processes.” Institute of Science and Technology Austria, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1397

Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Linear Distances between Markov Chains,”https://doi.org/10.4230/LIPIcs.CONCUR.2016.20__Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.https://doi.org/10.4230/LIPIcs.CONCUR.2016.20 .
LibreCat: https://research-explorer.ista.ac.at/record/1093
DOI: 10.4230/LIPIcs.CONCUR.2016.20

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,”https://doi.org/10.4230/LIPIcs.ESA.2016.28__Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.https://doi.org/10.4230/LIPIcs.ESA.2016.28 .
LibreCat: https://research-explorer.ista.ac.at/record/1071
DOI: 10.4230/LIPIcs.ESA.2016.28

Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs,”https://doi.org/10.1145/2837614.2837639__20–22:327–42. ACM, 2016.https://doi.org/10.1145/2837614.2837639 .
LibreCat: https://research-explorer.ista.ac.at/record/1438
DOI: 10.1145/2837614.2837639
arXiv: 1510.08517

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2017-728-v2-1 .
LibreCat: https://research-explorer.ista.ac.at/record/5452
DOI: 10.15479/AT:IST-2017-728-v2-1

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,”https://doi.org/10.1145/2837614.2837624__20–22:733–47. ACM, 2016.https://doi.org/10.1145/2837614.2837624 .
LibreCat: https://research-explorer.ista.ac.at/record/1437
DOI: 10.1145/2837614.2837624
arXiv: 1510.07565

Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Termination Analysis of Probabilistic Programs through Positivstellensatz’s,”https://doi.org/10.1007/978-3-319-41528-4_1__9779:3–22. Springer, 2016.https://doi.org/10.1007/978-3-319-41528-4_1 .
LibreCat: https://research-explorer.ista.ac.at/record/1386
DOI: 10.1007/978-3-319-41528-4_1

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.”https://doi.org/10.1137/1.9781611973730.69__In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015:1018–29. SIAM, 2015.https://doi.org/10.1137/1.9781611973730.69 .
LibreCat: https://research-explorer.ista.ac.at/record/10796
DOI: 10.1137/1.9781611973730.69
arXiv: 1409.6690

Kretinsky, Jan, Kim Larsen, Simon Laursen, and Jií Srba. “Polynomial Time Decidability of Weighted Synchronization under Partial Observability,”https://doi.org/10.4230/LIPIcs.CONCUR.2015.142__42:142–54. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015.https://doi.org/10.4230/LIPIcs.CONCUR.2015.142 .
LibreCat: https://research-explorer.ista.ac.at/record/1499
DOI: 10.4230/LIPIcs.CONCUR.2015.142