Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.”https://doi.org/10.4230/LIPIcs.MFCS.2020.22__In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.MFCS.2020.22 .

Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.”https://doi.org/10.4230/LIPIcs.MFCS.2020.51__In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.MFCS.2020.51 .

Ashok, Pranav, Krishnendu Chatterjee, Jan Kretinsky, Maximilian Weininger, and Tobias Winkler. “Approximating Values of Generalized-Reachability Stochastic Games.”https://doi.org/10.1145/3373718.3394761__In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , 102–15. Association for Computing Machinery, 2020.https://doi.org/10.1145/3373718.3394761 .

Kaveh, Kamran, Alex McAvoy, Krishnendu Chatterjee, and Martin A. Nowak. “The Moran Process on 2-Chromatic Graphs.”https://doi.org/10.1371/journal.pcbi.1008402__PLOS Computational Biology. Public Library of Science, 2020.https://doi.org/10.1371/journal.pcbi.1008402 .

Kleshnina, Maria, Sabrina Streipert, Jerzy Filar, and Krishnendu Chatterjee. “Prioritised Learning in Snowdrift-Type Games.”https://doi.org/10.3390/math8111945__Mathematics. MDPI, 2020.https://doi.org/10.3390/math8111945 .

Pavlogiannis, Andreas, Nico Schaumberger, Ulrich Schmid, and Krishnendu Chatterjee. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.”https://doi.org/10.1109/TCAD.2020.3012803__IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE, 2020.https://doi.org/10.1109/TCAD.2020.3012803 .

Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.”https://doi.org/10.1609/aaai.v34i02.5546__Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020.https://doi.org/10.1609/aaai.v34i02.5546 .

Milutinovic, Barbara, Miriam Stock, Anna V Grasse, Elisabeth Naderlinger, Christian Hilbe, and Sylvia Cremer. “Social Immunity Modulates Competition between Coinfecting Pathogens.”https://doi.org/10.1111/ele.13458__Ecology Letters. Wiley, 2020.https://doi.org/10.1111/ele.13458 .

Milutinovic, Barbara, Miriam Stock, Anna V Grasse, Elisabeth Naderlinger, Christian Hilbe, and Sylvia Cremer. “Social Immunity Modulates Competition between Coinfecting Pathogens.”https://doi.org/10.5061/DRYAD.CRJDFN318__Dryad, 2020.https://doi.org/10.5061/DRYAD.CRJDFN318 .

Chatterjee, Krishnendu, Martin Chmelik, Deep Karkhanis, Petr Novotný, and Amélie Royer. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” In Proceedings of the 30th International Conference on Automated Planning and Scheduling, 30:48–56. Association for the Advancement of Artificial Intelligence, 2020.

Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.”https://doi.org/10.1007/978-3-030-53291-8_21__In International Conference on Computer Aided Verification, 12225:398–420. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-53291-8_21 .

Shakiba, A., Amir Kafshdar Goharshady, M.R. Hooshmandasl, and M. Alambardar Meybodi. “A Note on Belief Structures and S-Approximation Spaces.”https://doi.org/10.29252/ijmsi.15.2.117__Iranian Journal of Mathematical Sciences and Informatics. Iranian Academic Center for Education, Culture and Research, 2020.https://doi.org/10.29252/ijmsi.15.2.117 .

Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.”https://doi.org/10.1371/journal.pcbi.1007494__PLoS Computational Biology. Public Library of Science, 2020.https://doi.org/10.1371/journal.pcbi.1007494 .

Tkadlec, Josef. “A Role of Graphs in Evolutionary Processes.”https://doi.org/10.15479/AT:ISTA:7196__Institute of Science and Technology Austria, 2020.https://doi.org/10.15479/AT:ISTA:7196 .

Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners.”https://doi.org/10.6084/m9.figshare.5973013.v1__Royal Society, 2020.https://doi.org/10.6084/m9.figshare.5973013.v1 .

Wang, Peixin, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, and Ming Xu. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.”https://doi.org/10.1145/3371093__In Proceedings of the ACM on Programming Languages, Vol. 4. ACM, 2020.https://doi.org/10.1145/3371093 .

Brázdil, Tomás, Krishnendu Chatterjee, Petr Novotný, and Jií Vahala. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.”https://doi.org/10.1609/aaai.v34i06.6531__Proceedings of the 34th AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020.https://doi.org/10.1609/aaai.v34i06.6531 .

Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In 36th European Workshop on Computational Geometry, 2020.

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.”https://doi.org/10.1007/978-3-030-44914-8_5__In European Symposium on Programming, 12075:112–40. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-44914-8_5 .

Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.”https://doi.org/10.1007/978-3-030-59152-6_14__In Automated Technology for Verification and Analysis, 12302:253–70. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-59152-6_14 .

Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.”https://doi.org/10.1145/3385412.3385969__In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, 672–87. Association for Computing Machinery, 2020.https://doi.org/10.1145/3385412.3385969 .

Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.”https://doi.org/10.1016/j.ress.2019.106665__Reliability Engineering and System Safety. Elsevier, 2020.https://doi.org/10.1016/j.ress.2019.106665 .

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.”https://doi.org/10.4230/LIPICS.CONCUR.2019.7__In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.CONCUR.2019.7 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,”https://doi.org/10.4230/LIPICS.CONCUR.2019.27__Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.CONCUR.2019.27 .

Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,”https://doi.org/10.4230/LIPICS.CONCUR.2019.6__Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.CONCUR.2019.6 .

Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in Graph Games,”https://doi.org/10.4230/LIPICS.MFCS.2019.11__Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.MFCS.2019.11 .

Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.”https://doi.org/10.1007/978-3-030-11245-5_22__In International Conference on Verification, Model Checking, and Abstract Interpretation, 11388:468–90. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-11245-5_22 .

Avni, Guy, Roderick Bloem, Krishnendu Chatterjee, Thomas A Henzinger, Bettina Konighofer, and Stefan Pranger. “Run-Time Optimization for Learned Controllers through Quantitative Games.”https://doi.org/10.1007/978-3-030-25540-4_36__In 31st International Conference on Computer-Aided Verification, 11561:630–49. Springer, 2019.https://doi.org/10.1007/978-3-030-25540-4_36 .

Hauser, Oliver P., Christian Hilbe, Krishnendu Chatterjee, and Martin A. Nowak. “Social Dilemmas among Unequals.”https://doi.org/10.1038/s41586-019-1488-5__Nature. Springer Nature, 2019.https://doi.org/10.1038/s41586-019-1488-5 .

Ashok, Pranav, Tomás Brázdil, Krishnendu Chatterjee, Jan Ketínský, Christoph Lampert, and Viktor Toman. “Strategy Representation by Decision Trees with Linear Classifiers.”https://doi.org/10.1007/978-3-030-30281-8_7__In 16th International Conference on Quantitative Evaluation of Systems, 11785:109–28. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-30281-8_7 .

Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, and Dominik Velan. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.”https://doi.org/10.1007/978-3-030-31784-3_27__In International Symposium on Automated Technology for Verification and Analysis, 11781:462–78. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-31784-3_27 .

Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.”https://doi.org/10.1038/s42003-019-0373-y__Communications Biology. Springer Nature, 2019.https://doi.org/10.1038/s42003-019-0373-y .

Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric Dynamic Partial Order Reduction.”https://doi.org/10.1145/3360550__In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vol. 3. ACM, 2019.https://doi.org/10.1145/3360550 .

Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.”https://doi.org/10.1109/lics.2019.8785706__In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. IEEE, 2019.https://doi.org/10.1109/lics.2019.8785706 .

Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token Swapping on Trees.” ArXiv, n.d.

Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.”https://doi.org/10.1145/3360555__In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Vol. 3. ACM, 2019.https://doi.org/10.1145/3360555 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.”https://doi.org/10.1145/3290366__Proceedings of the ACM on Programming Languages. ACM, 2019.https://doi.org/10.1145/3290366 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.”https://doi.org/10.1109/BLOC.2019.8751326__In IEEE International Conference on Blockchain and Cryptocurrency. IEEE, 2019.https://doi.org/10.1109/BLOC.2019.8751326 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.”https://doi.org/10.1145/3297280.3297319__In Proceedings of the 34th ACM Symposium on Applied Computing, Part 7772:374–81. ACM, 2019.https://doi.org/10.1145/3297280.3297319 .

Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.”https://doi.org/10.1145/3314221.3314581__In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 204–20. Association for Computing Machinery, 2019.https://doi.org/10.1145/3314221.3314581 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.”https://doi.org/10.1145/3297280.3297322__In Proceedings of the 34th ACM Symposium on Applied Computing, Part 7772:400–408. ACM, n.d.https://doi.org/10.1145/3297280.3297322 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.”https://doi.org/10.1145/3363525__ACM Transactions on Programming Languages and Systems. ACM, 2019.https://doi.org/10.1145/3363525 .

Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.”https://doi.org/10.1145/3339984__ACM Transactions on Programming Languages and Systems. ACM, 2019.https://doi.org/10.1145/3339984 .

Chatterjee, Krishnendu, Wolfgang Dvoák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.”https://doi.org/10.29007/5z5k__In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018.https://doi.org/10.29007/5z5k .

Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,”https://doi.org/10.1145/3158122__Vol. 2. ACM, 2018.https://doi.org/10.1145/3158122 .

Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.”https://doi.org/10.1007/978-3-319-10575-8_27__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 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.”https://doi.org/10.1007/978-3-319-95246-8_9__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 .

Reiter, Johannes, Christian Hilbe, David Rand, Krishnendu Chatterjee, and Martin Nowak. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.”https://doi.org/10.1038/s41467-017-02721-8__Nature Communications. Nature Publishing Group, 2018.https://doi.org/10.1038/s41467-017-02721-8 .

Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kudera, Petr Novotný, Dominik Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS,”https://doi.org/10.1145/3209108.3209191__8033:185–94. IEEE, 2018.https://doi.org/10.1145/3209108.3209191 .

Hilbe, Christian, Stepán Simsa, Krishnendu Chatterjee, and Martin Nowak. “Evolution of Cooperation in Stochastic Games.”https://doi.org/10.1038/s41586-018-0277-x__Nature. Nature Publishing Group, 2018.https://doi.org/10.1038/s41586-018-0277-x .

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter,”https://doi.org/10.1137/1.9781611975031.151__2341–56. ACM, 2018.https://doi.org/10.1137/1.9781611975031.151 .

Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.”https://doi.org/10.1007/978-3-030-02768-1_11__edited by Sukyoung Ryu, 11275:181–201. Springer, 2018.https://doi.org/10.1007/978-3-030-02768-1_11 .

Hilbe, Christian, Krishnendu Chatterjee, and Martin Nowak. “Partners and Rivals in Direct Reciprocity.”https://doi.org/10.1038/s41562-018-0320-9__Nature Human Behaviour. Nature Publishing Group, 2018.https://doi.org/10.1038/s41562-018-0320-9 .

Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,”https://doi.org/10.1007/978-3-319-99154-2_4__11024:53–70. Springer, 2018.https://doi.org/10.1007/978-3-319-99154-2_4 .

Brázdil, Tomás, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,”https://doi.org/10.1007/978-3-319-89960-2_21__10805:385–407. Springer, 2018.https://doi.org/10.1007/978-3-319-89960-2_21 .

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 .

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 .

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 .

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 .

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 .

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 .

Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018.

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.

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .