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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.

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 .

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 .

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 .

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.

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.

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 .

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 .

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 .

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 .

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 .

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 .