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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. Quantitative Interprocedural Analysis. IST Austria, 2016.https://doi.org/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.

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 .

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 .

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 .

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 .

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 .

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 .

Chmelik, Martin. “Algorithms for Partially Observable Markov Decision Processes.” Institute of Science and Technology Austria, 2016.

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

Ibsen-Jensen, Rasmus, Krishnendu Chatterjee, and Martin Nowak. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.”https://doi.org/10.1073/pnas.1511366112__PNAS. National Academy of Sciences, 2015.https://doi.org/10.1073/pnas.1511366112 .

Forejt, Vojtbch, Jan Krdál, and Jan Kretinsky. “Controller Synthesis for MDPs and Frequency LTL\'47U,”https://doi.org/10.1007/978-3-662-48899-7_12__9450:162–77. Springer, 2015.https://doi.org/10.1007/978-3-662-48899-7_12 .

Babiak, Tomás, Frantisek Blahoudek, Alexandre Duret Lutz, Joachim Klein, Jan Kretinsky, Daniel Mueller, David Parker, and Jan Strejdek. “The Hanoi Omega-Automata Format,”https://doi.org/10.1007/978-3-319-21690-4_31__9206:479–86. Springer, 2015.https://doi.org/10.1007/978-3-319-21690-4_31 .

Chatterjee, Krishnendu, Laurent Doyen, and Moshe Vardi. “The Complexity of Synthesis from Probabilistic Components.”https://doi.org/10.1007/978-3-662-47666-6_9__In 42nd International Colloquium, 9135:108–20. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-47666-6_9 .

Pavlogiannis, Andreas, Krishnendu Chatterjee, Ben Adlam, and Martin Nowak. “Cellular Cooperation with Shift Updating and Repulsion.”https://doi.org/10.1038/srep17147__Scientific Reports. Nature Publishing Group, 2015.https://doi.org/10.1038/srep17147 .

Brázdil, Tomás, Stefan Kiefer, Antonín Kudera, and Petr Novotný. “Long-Run Average Behaviour of Probabilistic Vector Addition Systems,”https://doi.org/10.1109/LICS.2015.15__44–55. IEEE, 2015.https://doi.org/10.1109/LICS.2015.15 .

Landau, Dan, Eugen Tausch, Amaro Taylor Weiner, Chip Stewart, Johannes Reiter, Jasmin Bahlo, Sandra Kluth, et al. “Mutations Driving CLL and Their Evolution in Progression and Relapse.”https://doi.org/10.1038/nature15395__Nature. Nature Publishing Group, 2015.https://doi.org/10.1038/nature15395 .

Brázdil, Tomás, L’Ubos Korendiak, Jan Krdál, Petr Novotný, and Vojtbch ehák. “Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis.”https://doi.org/10.1007/978-3-319-22264-6_10__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-319-22264-6_10 .

Adlam, Ben, Krishnendu Chatterjee, and Martin Nowak. “Amplifiers of Selection.”https://doi.org/10.1098/rspa.2015.0114__Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2015.https://doi.org/10.1098/rspa.2015.0114 .

Svoreová, Mária, Martin Chmelik, Kevin Leahy, Hasan Eniser, Krishnendu Chatterjee, Ivana Cbrná, and Celin Belta. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.”https://doi.org/10.1145/2728606.2728617__In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 233–38. ACM, 2015.https://doi.org/10.1145/2728606.2728617 .

Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation and Refinement Distances for Timed Systems.”https://doi.org/10.1109/TAC.2015.2404612__IEEE Transactions on Automatic Control. IEEE, 2015.https://doi.org/10.1109/TAC.2015.2404612 .

Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.”https://doi.org/10.1016/j.ic.2015.03.001__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.03.001 .

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , 5:3496–3502. AAAI Press, 2015.

Bloem, Roderick, Krishnendu Chatterjee, Swen Jacobs, and Robert Könighofer. “Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information,”https://doi.org/10.1007/978-3-662-46681-0_50__9035:517–32. Springer, 2015.https://doi.org/10.1007/978-3-662-46681-0_50 .

Brázdil, Tomás, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.”https://doi.org/10.1007/978-3-662-46681-0_12__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-662-46681-0_12 .

Benes, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert, and Jií Srba. “Refinement Checking on Parametric Modal Transition Systems.”https://doi.org/10.1007/s00236-015-0215-4__Acta Informatica. Springer, 2015.https://doi.org/10.1007/s00236-015-0215-4 .

Priklopil, Tadeas, Eva Kisdi, and Mats Gyllenberg. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.”https://doi.org/10.1111/evo.12618__Evolution. Wiley, 2015.https://doi.org/10.1111/evo.12618 .

Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.”https://doi.org/10.1016/j.artint.2014.12.009__Artificial Intelligence. Elsevier, 2015.https://doi.org/10.1016/j.artint.2014.12.009 .

Fahrenberg, Uli, Jan Kretinsky, Axel Legay, and Louis Traonouez. “Compositionality for Quantitative Specifications,”https://doi.org/10.1007/978-3-319-15317-9_19__8997:306–24. Springer, 2015.https://doi.org/10.1007/978-3-319-15317-9_19 .

Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.”https://doi.org/10.1016/j.ipl.2014.09.001__https://doi.org/10.1016/j.ipl.2014.09.001__Information Processing Letters. Elsevier, 2015.https://doi.org/10.1016/j.ipl.2014.09.001 .

Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.”https://doi.org/10.1016/j.tcs.2015.01.050__Theoretical Computer Science. Elsevier, 2015.https://doi.org/10.1016/j.tcs.2015.01.050 .

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.”https://doi.org/10.1016/j.ic.2015.06.003__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.06.003 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.”https://doi.org/10.1145/2699430__Journal of the ACM. ACM, 2015.https://doi.org/10.1145/2699430 .

Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.”https://doi.org/10.1109/LICS.2015.34__In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015.https://doi.org/10.1109/LICS.2015.34 .

Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.”https://doi.org/10.1016/j.ic.2015.03.010__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.03.010 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.”https://doi.org/10.1016/j.ic.2015.03.009__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.03.009 .

Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52. AAAI Press, 2015.

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,”https://doi.org/10.1109/ICRA.2015.7139019__325–30. IEEE, 2015.https://doi.org/10.1109/ICRA.2015.7139019 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-322-v1-1 .

Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.”https://doi.org/10.1109/LICS.2015.32__LICS. IEEE, 2015.https://doi.org/10.1109/LICS.2015.32 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.”https://doi.org/10.1109/LICS.2015.72__In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015.https://doi.org/10.1109/LICS.2015.72 .

Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-318-v1-1 .

Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-318-v2-1 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-170-v2-2 .

Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.”https://doi.org/10.1007/978-3-662-47666-6_10__In 42nd International Colloquium, 9135:121–33. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-47666-6_10 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-330-v2-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-319-v1-1 .

Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-334-v1-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-323-v2-2 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-323-v1-1 .

Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-399-v1-1 .

Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-325-v2-1 .

Reiter, Johannes, Ayush Kanodia, Raghav Gupta, Martin Nowak, and Krishnendu Chatterjee. “Biological Auctions with Multiple Rewards.”https://doi.org/10.1098/rspb.2015.1041__Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society, 2015.https://doi.org/10.1098/rspb.2015.1041 .

Reiter, Johannes. “The Subclonal Evolution of Cancer.” Institute of Science and Technology Austria, 2015.

Benes, Nikola, Przemyslaw Daca, Thomas A Henzinger, Jan Kretinsky, and Dejan Nickovic. “Complete Composition Operators for IOCO-Testing Theory,”https://doi.org/10.1145/2737166.2737175__101–10. ACM, 2015.https://doi.org/10.1145/2737166.2737175 .

Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.”https://doi.org/10.1007/s10703-015-0235-2__Formal Methods in System Design. Springer, 2015.https://doi.org/10.1007/s10703-015-0235-2 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and Prateesh Goyal. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.”https://doi.org/10.1145/2676726.2676979__ACM SIGPLAN Notices. ACM, 2015.https://doi.org/10.1145/2676726.2676979 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. “Quantitative Interprocedural Analysis.”https://doi.org/10.1145/2676726.2676968__Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . ACM, 2015.https://doi.org/10.1145/2676726.2676968 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs,”https://doi.org/10.1007/978-3-319-21690-4_9__9206:140–57. Springer, 2015.https://doi.org/10.1007/978-3-319-21690-4_9 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.”https://doi.org/10.1109/RTSS.2014.9__In Real-Time Systems Symposium, 2015:118–27. IEEE, 2015.https://doi.org/10.1109/RTSS.2014.9 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-340-v1-1 .

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.1145/2728606.2728608__In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 259–68. ACM, 2015.https://doi.org/10.1145/2728606.2728608 .

Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.”https://doi.org/10.3390/g6040413__Games. MDPI, 2015.https://doi.org/10.3390/g6040413 .

Brázdil, Tomás, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,”https://doi.org/10.1007/978-3-319-21690-4_10__9206:158–77. Springer, 2015.https://doi.org/10.1007/978-3-319-21690-4_10 .

Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.”https://doi.org/10.15479/AT:ISTA:28__Institute of Science and Technology Austria, 2015.https://doi.org/10.15479/AT:ISTA:28 .

Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.”https://doi.org/10.1007/978-3-642-54013-4_15__In Verification, Model Checking, and Abstract Interpretation, 8318:262–81. Springer Nature, 2014.https://doi.org/10.1007/978-3-642-54013-4_15 .

Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.”https://doi.org/10.1016/j.tcs.2014.06.031__Theoretical Computer Science. Elsevier, 2014.https://doi.org/10.1016/j.tcs.2014.06.031 .

Jha, Susmit, Stavros Tripakis, Sanjit Seshia, and Krishnendu Chatterjee. “Game Theoretic Secure Localization in Wireless Sensor Networks,”https://doi.org/10.1109/IOT.2014.7030120__85–90. IEEE, 2014.https://doi.org/10.1109/IOT.2014.7030120 .

Landau, Dan, Chip Stewart, Johannes Reiter, Michael Lawrence, Carrie Sougnez, Jennifer Brown, Armando Lopez Guillermo, et al. “Novel Putative Driver Gene Mutations in Chronic Lymphocytic Leukemia (CLL): Results from a Combined Analysis of Whole Exome Sequencing of 262 Primary CLL Aamples.” Blood. American Society of Hematology, 2014.

Brázdil, Tomás, Krishnendu Chatterjee, Martin Chmelik, Vojtbch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.”https://doi.org/10.1007/978-3-319-11936-6_8__In https://doi.org/10.1007/978-3-319-11936-6_8__Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, 8837:98–114. Society of Industrial and Applied Mathematics, 2014.https://doi.org/10.1007/978-3-319-11936-6_8 .