Chatterjee, K., Henzinger, T. A., Otop, J., &; Velner, Y. (2017). Quantitative fair simulation games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2016.10.006 

Chatterjee, K., Kragl, B., Mishra, S., &; Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer.https://doi.org/10.1007/978-3-662-54434-1_11 

Chatterjee, K., Novotný, P., Pérez, G., Raskin, J., &; Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.

Priklopil, T., Chatterjee, K., &; Nowak, M. (2017). Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. https://doi.org/10.1016/j.jtbi.2017.08.025__Journal of Theoretical Biology. Elsevier.https://doi.org/10.1016/j.jtbi.2017.08.025 

Chatterjee, K., Novotný, P., &; Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM.https://doi.org/10.1145/3009837.3009873 

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak , M. (2017). Strong amplifiers of natural selection. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:51 

Chatterjee, K., Fu, H., &; Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar &; V. Kundak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer.https://doi.org/10.1007/978-3-319-63390-9_3 

Chatterjee, K., Goharshady, A. K., &; Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer.https://doi.org/10.1007/978-3-319-68167-2_4 

Chatterjee, K., Dvorák, W., Henzinger, M. H., &; Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2016.25 

Chonev, V. K., Ouaknine, J., &; Worrell, J. (2016). On the skolem problem for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2016.100 

Chatterjee, K., &; Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2016.98 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2016.24 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2016). Quantitative automata under probabilistic semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium (pp. 76–85). New York, NY, USA: IEEE.https://doi.org/10.1145/2933575.2933588 

Chatterjee, K., Dvoák, W., Henzinger, M. H., &; Loitzenbauer, V. (2016). Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 197–206). New York, NY, USA: IEEE.https://doi.org/10.1145/2933575.2935304 

Chatterjee, K., Ibsen-Jensen, R., &; Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.

Hilbe, C., &; Traulsen, A. (2016). 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”https://doi.org/10.1016/j.plrev.2016.10.004__by C. Adami, J. Schossau and A. Hintze. Physics of Life Reviews. Elsevier.https://doi.org/10.1016/j.plrev.2016.10.004 

Pandey, V., &; Chatterjee, K. (2016). Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (Vol. 26, pp. 365–368). San Francisco, CA, USA: ACM.https://doi.org/10.1145/2818052.2869122 

Brázdil, T., Forejt, V., Kudera, A., &; Novotný, P. (2016). Stability in graphs and games (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2016.10 

Chatterjee, K., &; Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.

Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., &; Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.

Brázdil, T., Kudera, A., &; Novotný, P. (2016). Optimizing the expected mean payoff in Energy Markov Decision Processes (Vol. 9938, pp. 32–49). Presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan: Springer.https://doi.org/10.1007/978-3-319-46520-3_3 

Milinski, M., Hilbe, C., Semmann, D., Sommerfeld, R., &; Marotzke, J. (2016). Humans choose representatives who enforce cooperation in social dilemmas through extortion. Nature Communications. Nature Publishing Group.https://doi.org/10.1038/ncomms10915 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2016). Quantitative monitor automata (Vol. 9837, pp. 23–38). Presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-53413-7_2 

Hansen, K., Ibsen-Jensen, R., &; Koucký, M. (2016). The big match in small space (Vol. 9928, pp. 64–76). Presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-53354-3_6 

Chonev, V. K., Ouaknine, J., &; Worrell, J. (2016). On the complexity of the orbit problem. Journal of the ACM. ACM.https://doi.org/10.1145/2857050 

Chonev, V. K., Ouaknine, J., &; Worrell, J. (2016). On recurrent reachability for continuous linear dynamical systems. In LICS ’16 (pp. 515–524). New York, NY, USA: IEEE.https://doi.org/10.1145/2933575.2934548 

Chakra, M., Hilbe, C., &; Traulsen, A. (2016). Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites. Royal Society Open Science. Royal Society, The.https://doi.org/10.1098/rsos.160036 

Baek, S., Jeong, H., Hilbe, C., &; Nowak, M. (2016). Comparing reactive and memory-one strategies of direct reciprocity. Scientific Reports. Nature Publishing Group.https://doi.org/10.1038/srep25676 

Lohse, K., Chmelik, M., Martin, S., &; Barton, N. H. (2016). Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. Genetics Society of America.https://doi.org/10.1534/genetics.115.183814 

Chatterjee, K., &; Ibsen-Jensen, R. (2016). The complexity of deciding legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands: IOS Press.https://doi.org/10.3233/978-1-61499-672-9-1432 

Chatterjee, K., &; Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE.https://doi.org/10.1145/2933575.2934513 

Chatterjee, K., Chmelik, M., &; Tracol, M. (2016). What is decidable about partially observable Markov decision processes with <9-regular objectives. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2016.02.009 

Chatterjee, K., Chmelik, M., Gupta, R., &; Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. Elsevier.https://doi.org/10.1016/j.artint.2016.01.007 

Chatterjee, K., Pavlogiannis, A., &; Velner, Y. (2016). Quantitative interprocedural analysis. IST Austria.https://doi.org/10.15479/AT:IST-2016-523-v1-1 

Chatterjee, K., Chmelik, M., &; Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2016). Amplification on undirected population structures: Comets beat stars. IST Austria.https://doi.org/10.15479/AT:IST-2016-648-v1-1 

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria.https://doi.org/10.15479/AT:IST-2017-749-v3-1 

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2016). Strong amplifiers of natural selection. IST Austria.https://doi.org/10.15479/AT:IST-2016-728-v1-1 

Hilbe, C., Hagel, K., &; Milinski, M. (2016). Experimental game instructions. Public Library of Science.https://doi.org/10.1371/journal.pone.0163867.s008 

Hilbe, C., Hagel, K., &; Milinski, M. (2016). Asymmetric power boosts extortion in an economic experiment. PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0163867 

Hilbe, C., Hagel, K., &; Milinski, M. (2016). Experimental data. Public Library of Science.https://doi.org/10.1371/journal.pone.0163867.s009 

Chmelik, M. (2016). Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.

Daca, P., Henzinger, T. A., Kretinsky, J., &; Petrov, T. (2016). Linear distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2016.20 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik.https://doi.org/10.4230/LIPIcs.ESA.2016.28 

Chatterjee, K., Fu, H., Novotný, P., &; Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM.https://doi.org/10.1145/2837614.2837639 

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria.https://doi.org/10.15479/AT:IST-2017-728-v2-1 

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM.https://doi.org/10.1145/2837614.2837624 

Chatterjee, K., Fu, H., &; Goharshady, A. K. (2016). Termination analysis of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer.https://doi.org/10.1007/978-3-319-41528-4_1 

Chatterjee, K., &; Ibsen-Jensen, R. (2015). The value 1 problem under finite-memory strategies for concurrent mean-payoff games. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2015, pp. 1018–1029). San Diego, CA, United States: SIAM.https://doi.org/10.1137/1.9781611973730.69 

Kretinsky, J., Larsen, K., Laursen, S., &; Srba, J. (2015). Polynomial time decidability of weighted synchronization under partial observability (Vol. 42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2015.142 

Ibsen-Jensen, R., Chatterjee, K., &; Nowak, M. (2015). Computational complexity of ecological and evolutionary spatial dynamics. PNAS. National Academy of Sciences.https://doi.org/10.1073/pnas.1511366112 

Forejt, V., Krdál, J., &; Kretinsky, J. (2015). Controller synthesis for MDPs and frequency LTL\'47U (Vol. 9450, pp. 162–177). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Suva, Fiji: Springer.https://doi.org/10.1007/978-3-662-48899-7_12 

Babiak, T., Blahoudek, F., Duret Lutz, A., Klein, J., Kretinsky, J., Mueller, D.,https://doi.org/10.1007/978-3-319-21690-4_31__Strejdek, J. (2015). The Hanoi omega-automata format (Vol. 9206, pp. 479–486). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer.https://doi.org/10.1007/978-3-319-21690-4_31 

Chatterjee, K., Doyen, L., &; Vardi, M. (2015). The complexity of synthesis from probabilistic components. In 42nd International Colloquium (Vol. 9135, pp. 108–120). Kyoto, Japan: Springer Nature.https://doi.org/10.1007/978-3-662-47666-6_9 

Pavlogiannis, A., Chatterjee, K., Adlam, B., &; Nowak, M. (2015). Cellular cooperation with shift updating and repulsion. Scientific Reports. Nature Publishing Group.https://doi.org/10.1038/srep17147 

Brázdil, T., Kiefer, S., Kudera, A., &; Novotný, P. (2015). Long-run average behaviour of probabilistic vector addition systems (pp. 44–55). Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.15 

Landau, D., Tausch, E., Taylor Weiner, A., Stewart, C., Reiter, J., Bahlo, J.,https://doi.org/10.1038/nature15395__Wu, C. (2015). Mutations driving CLL and their evolution in progression and relapse. Nature. Nature Publishing Group.https://doi.org/10.1038/nature15395 

Brázdil, T., Korendiak, L., Krdál, J., Novotný, P., &; ehák, V. (2015). Optimizing performance of continuous-time stochastic systems using timeout synthesis. Presented at the QEST: Quantitative Evaluation of Systems, Madrid, Spain: Springer.https://doi.org/10.1007/978-3-319-22264-6_10 

Adlam, B., Chatterjee, K., &; Nowak, M. (2015). Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London.https://doi.org/10.1098/rspa.2015.0114 

Svoreová, M., Chmelik, M., Leahy, K., Eniser, H., Chatterjee, K., Cbrná, I., &; Belta, C. (2015). Temporal logic motion planning using POMDPs with parity objectives: Case study paper. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 233–238). Seattle, WA, United States: ACM.https://doi.org/10.1145/2728606.2728617 

Chatterjee, K., &; Prabhu, V. (2015). Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. IEEE.https://doi.org/10.1109/TAC.2015.2404612 

Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., &; Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.03.001 

Chatterjee, K., Chmelik, M., Gupta, R., &; Kanodia, A. (2015). Optimal cost almost-sure reachability in POMDPs. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence  (Vol. 5, pp. 3496–3502). Austin, TX, USA: AAAI Press.

Bloem, R., Chatterjee, K., Jacobs, S., &; Könighofer, R. (2015). Assume-guarantee synthesis for concurrent reactive programs with partial information (Vol. 9035, pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-46681-0_50 

Brázdil, T., Chatterjee, K., Forejt, V., &; Kudera, A. (2015). Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-46681-0_12 

Benes, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., &; Srba, J. (2015). Refinement checking on parametric modal transition systems. Acta Informatica. Springer.https://doi.org/10.1007/s00236-015-0215-4 

Priklopil, T., Kisdi, E., &; Gyllenberg, M. (2015). Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. Wiley.https://doi.org/10.1111/evo.12618 

Chatterjee, K., &; Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence. Elsevier.https://doi.org/10.1016/j.artint.2014.12.009 

Fahrenberg, U., Kretinsky, J., Legay, A., &; Traonouez, L. (2015). Compositionality for quantitative specifications (Vol. 8997, pp. 306–324). Presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy: Springer.https://doi.org/10.1007/978-3-319-15317-9_19 

Bérard, B., Chatterjee, K., &; Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. https://doi.org/10.1016/j.ipl.2014.09.001__Information Processing Letters. Elsevier.https://doi.org/10.1016/j.ipl.2014.09.001 

Chatterjee, K., Joglekar, M., &; Shah, N. (2015). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2015.01.050 

Chatterjee, K., Doyen, L., Gimbert, H., &; Henzinger, T. A. (2015). Randomness for free. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.06.003 

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. ACM.https://doi.org/10.1145/2699430 

Chatterjee, K., Henzinger, M. H., &; Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.34 

Chatterjee, K., Doyen, L., Randour, M., &; Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.03.010 

Chatterjee, K., &; Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.03.009 

Ahmed, U., Chatterjee, K., &; Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp. 745–752). Austin, TX, USA: AAAI Press.

Chatterjee, K., Chmelik, M., Gupta, R., &; Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE.https://doi.org/10.1109/ICRA.2015.7139019 

Chatterjee, K., Ibsen-Jensen, R., &; Hansen, K. (2015). The patience of concurrent stochastic games with safety and reachability objectives. IST Austria.https://doi.org/10.15479/AT:IST-2015-322-v1-1 

Chatterjee, K., Komárková, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.32 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.72 

Chatterjee, K., Komarkova, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2015-318-v1-1 

Chatterjee, K., Komarkova, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2015-318-v2-1 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2015). Nested weighted automata. IST Austria.https://doi.org/10.15479/AT:IST-2015-170-v2-2 

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2015). Edit distance for pushdown automata. In 42nd International Colloquium (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature.https://doi.org/10.1007/978-3-662-47666-6_10 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-330-v2-1 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-319-v1-1 

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2015). Edit distance for pushdown automata. IST Austria.https://doi.org/10.15479/AT:IST-2015-334-v1-1 

Chatterjee, K., Ibsen-Jensen, R., &; Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-323-v2-2 

Chatterjee, K., Ibsen-Jensen, R., &; Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-323-v1-1 

Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C.,https://doi.org/10.15479/AT:IST-2015-399-v1-1__Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers. IST Austria.https://doi.org/10.15479/AT:IST-2015-399-v1-1 

Chatterjee, K., Chmelik, M., &; Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria.https://doi.org/10.15479/AT:IST-2015-325-v2-1 

Reiter, J., Kanodia, A., Gupta, R., Nowak, M., &; Chatterjee, K. (2015). Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society.https://doi.org/10.1098/rspb.2015.1041 

Reiter, J. (2015). The subclonal evolution of cancer. Institute of Science and Technology Austria.

Benes, N., Daca, P., Henzinger, T. A., Kretinsky, J., &; Nickovic, D. (2015). Complete composition operators for IOCO-testing theory (pp. 101–110). Presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada: ACM.https://doi.org/10.1145/2737166.2737175 

Chatterjee, K., Chmelik, M., &; Daca, P. (2015). CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-015-0235-2 

Chatterjee, K., Ibsen-Jensen, R., Pavlogiannis, A., &; Goyal, P. (2015). Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. Mumbai, India: ACM.https://doi.org/10.1145/2676726.2676979 

Chatterjee, K., Pavlogiannis, A., &; Velner, Y. (2015). Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . Mumbai, India: ACM.https://doi.org/10.1145/2676726.2676968 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs (Vol. 9206, pp. 140–157). Presented at the CAV: Computer Aided Verification, San Francisco, CA, USA: Springer.https://doi.org/10.1007/978-3-319-21690-4_9 

Chatterjee, K., Pavlogiannis, A., Kößler, A., &; Schmid, U. (2015). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In Real-Time Systems Symposium (Vol. 2015, pp. 118–127). Rome, Italy: IEEE.https://doi.org/10.1109/RTSS.2014.9