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 
LibreCat: https://research-explorer.ista.ac.at/record/480
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1477
DOI: 10.1016/j.jcss.2016.02.009
arXiv: 1309.2802

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 
LibreCat: https://research-explorer.ista.ac.at/record/1529
DOI: 10.1016/j.artint.2016.01.007
arXiv: 1411.3880

Chatterjee, K., Pavlogiannis, A., &; Velner, Y. (2016). Quantitative interprocedural analysis. IST Austria.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, 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.
LibreCat: https://research-explorer.ista.ac.at/record/1166

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 
LibreCat: https://research-explorer.ista.ac.at/record/5449
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5453
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5451
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/9867
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1322
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/9868
DOI: 10.1371/journal.pone.0163867.s009

Chmelik, M. (2016). Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.
LibreCat: https://research-explorer.ista.ac.at/record/1397

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 
LibreCat: https://research-explorer.ista.ac.at/record/1093
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1071
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1438
DOI: 10.1145/2837614.2837639
arXiv: 1510.08517

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 
LibreCat: https://research-explorer.ista.ac.at/record/5452
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1437
DOI: 10.1145/2837614.2837624
arXiv: 1510.07565

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 
LibreCat: https://research-explorer.ista.ac.at/record/1386
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/10796
DOI: 10.1137/1.9781611973730.69
arXiv: 1409.6690

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 
LibreCat: https://research-explorer.ista.ac.at/record/1499
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1559
DOI: 10.1073/pnas.1511366112
PMID: 26644569

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 
LibreCat: https://research-explorer.ista.ac.at/record/1594
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1601
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1609
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1624
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1660
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1665
DOI: 10.1038/nature15395
PMID: 26466571

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 
LibreCat: https://research-explorer.ista.ac.at/record/1667
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1673
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1691
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1694
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1698
DOI: 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.
LibreCat: https://research-explorer.ista.ac.at/record/1820
arXiv: 1411.3880

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 
LibreCat: https://research-explorer.ista.ac.at/record/1838
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1839
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1846
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1851
DOI: 10.1111/evo.12618
PMID: 25662095

Chatterjee, K., &; Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence. Elsevier.https://doi.org/10.1016/j.artint.2014.12.009 
LibreCat: https://research-explorer.ista.ac.at/record/1873
DOI: 10.1016/j.artint.2014.12.009
arXiv: 1408.2058

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 
LibreCat: https://research-explorer.ista.ac.at/record/1882
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2034
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1598
DOI: 10.1016/j.tcs.2015.01.050
arXiv: 1202.4175

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 
LibreCat: https://research-explorer.ista.ac.at/record/1731
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1856
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1661
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/523
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/524
DOI: 10.1016/j.ic.2015.03.009
arXiv: 1409.5306

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.
LibreCat: https://research-explorer.ista.ac.at/record/1481

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 
LibreCat: https://research-explorer.ista.ac.at/record/1732
DOI: 10.1109/ICRA.2015.7139019
arXiv: 1409.3360

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 
LibreCat: https://research-explorer.ista.ac.at/record/5431
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1657
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1656
DOI: 10.1109/LICS.2015.72
arXiv: 1606.03598

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 
LibreCat: https://research-explorer.ista.ac.at/record/5429
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5435
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5436
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1610
DOI: 10.1007/978-3-662-47666-6_10
arXiv: 1504.08259

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 
LibreCat: https://research-explorer.ista.ac.at/record/5437
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5430
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5438
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5440
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5432
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5444
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5443
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1709
DOI: 10.1098/rspb.2015.1041
PMID: 26180069

Reiter, J. (2015). The subclonal evolution of cancer. Institute of Science and Technology Austria.
LibreCat: https://research-explorer.ista.ac.at/record/1400

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 
LibreCat: https://research-explorer.ista.ac.at/record/1502
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1501
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1602
DOI: 10.1145/2676726.2676979
arXiv: 1410.7724

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 
LibreCat: https://research-explorer.ista.ac.at/record/1604
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1607
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1714
DOI: 10.1109/RTSS.2014.9

Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., &; Pavlogiannis, A. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria.https://doi.org/10.15479/AT:IST-2015-340-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5441
DOI: 10.15479/AT:IST-2015-340-v1-1

Svoreová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cbrná, I., &; Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 259–268). Seattle, WA, United States: ACM.https://doi.org/10.1145/2728606.2728608 
LibreCat: https://research-explorer.ista.ac.at/record/1689
DOI: 10.1145/2728606.2728608

Priklopil, T., &; Chatterjee, K. (2015). Evolution of decisions in population games with sequentially searching individuals. Games. MDPI.https://doi.org/10.3390/g6040413 
LibreCat: https://research-explorer.ista.ac.at/record/1681
DOI: 10.3390/g6040413

Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., &; Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer.https://doi.org/10.1007/978-3-319-21690-4_10 
LibreCat: https://research-explorer.ista.ac.at/record/1603
DOI: 10.1007/978-3-319-21690-4_10

Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:28 
LibreCat: https://research-explorer.ista.ac.at/record/5549
DOI: 10.15479/AT:ISTA:28

Aminof, B., Jacobs, S., Khalimov, A., &; Rubin, S. (2014). Parameterized model checking of token-passing systems. In Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-642-54013-4_15 
LibreCat: https://research-explorer.ista.ac.at/record/10884
DOI: 10.1007/978-3-642-54013-4_15
arXiv: 1311.4425

Chatterjee, K., Henzinger, M. H., Krinninger, S., Loitzenbauer, V., &; Raskin, M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2014.06.031 
LibreCat: https://research-explorer.ista.ac.at/record/1375
DOI: 10.1016/j.tcs.2014.06.031
arXiv: 1307.4473

Jha, S., Tripakis, S., Seshia, S., &; Chatterjee, K. (2014). Game theoretic secure localization in wireless sensor networks (pp. 85–90). Presented at the IOT: Internet of Things, Cambridge, USA: IEEE.https://doi.org/10.1109/IOT.2014.7030120 
LibreCat: https://research-explorer.ista.ac.at/record/1853
DOI: 10.1109/IOT.2014.7030120

Landau, D., Stewart, C., Reiter, J., Lawrence, M., Sougnez, C., Brown, J.,  Wu, C. (2014). 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.
LibreCat: https://research-explorer.ista.ac.at/record/1884

Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M.,https://doi.org/10.1007/978-3-319-11936-6_8__Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez &; J.-F. Raskin (Eds.), 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) (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics.https://doi.org/10.1007/978-3-319-11936-6_8 
LibreCat: https://research-explorer.ista.ac.at/record/2027
DOI: 10.1007/978-3-319-11936-6_8

Hermanns, H., Krdál, J., &; Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan &; D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-662-44584-6_18 
LibreCat: https://research-explorer.ista.ac.at/record/2053
DOI: 10.1007/978-3-662-44584-6_18

Aminof, B., Kotek, T., Rubin, S., Spegni, F., &; Veith, H. (2014). Parameterized model checking of rendezvous systems. In P. Baldan &; D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 109–124). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-662-44584-6_9 
LibreCat: https://research-explorer.ista.ac.at/record/2052
DOI: 10.1007/978-3-662-44584-6_9

Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B.,https://doi.org/10.1007/s00236-013-0191-5__Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica. Springer.https://doi.org/10.1007/s00236-013-0191-5 
LibreCat: https://research-explorer.ista.ac.at/record/2187
DOI: 10.1007/s00236-013-0191-5

Esparza, J., &; Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer.https://doi.org/10.1007/978-3-319-08867-9_13 
LibreCat: https://research-explorer.ista.ac.at/record/2190
DOI: 10.1007/978-3-319-08867-9_13

Brázdil, T., Broeek, V., Chatterjee, K., Forejt, V., &; Kudera, A. (2014). Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-10(1:13)2014 
LibreCat: https://research-explorer.ista.ac.at/record/2234
DOI: 10.2168/LMCS-10(1:13)2014

Grinshpun, A., Phalitnonkiat, P., Rubin, S., &; Tarfulea, A. (2014). Alternating traps in Muller and parity games. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2013.11.032 
LibreCat: https://research-explorer.ista.ac.at/record/2246
DOI: 10.1016/j.tcs.2013.11.032

Chatterjee, K., Randour, M., &; Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. Springer.https://doi.org/10.1007/s00236-013-0182-6 
LibreCat: https://research-explorer.ista.ac.at/record/2716
DOI: 10.1007/s00236-013-0182-6
arXiv: 1201.5073

Cerny, P., Chmelik, M., Henzinger, T. A., &; Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2014.08.019 
LibreCat: https://research-explorer.ista.ac.at/record/1733
DOI: 10.1016/j.tcs.2014.08.019

Chatterjee, K., &; Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. ACM.https://doi.org/10.1145/2597631 
LibreCat: https://research-explorer.ista.ac.at/record/2141
DOI: 10.1145/2597631

Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan &; D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-662-44584-6_37 
LibreCat: https://research-explorer.ista.ac.at/record/2054
DOI: 10.1007/978-3-662-44584-6_37

Aminof, B., &; Rubin, S. (2014). First cycle games. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association.https://doi.org/10.4204/EPTCS.146.11 
LibreCat: https://research-explorer.ista.ac.at/record/475
DOI: 10.4204/EPTCS.146.11

Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer.https://doi.org/10.1007/978-3-662-44522-8_1 
LibreCat: https://research-explorer.ista.ac.at/record/1903
DOI: 10.1007/978-3-662-44522-8_1

Chatterjee, K., &; Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2579821 
LibreCat: https://research-explorer.ista.ac.at/record/2211
DOI: 10.1145/2579821
arXiv: 1107.2141

Boker, U., Chatterjee, K., Henzinger, T. A., &; Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2629686 
LibreCat: https://research-explorer.ista.ac.at/record/2038
DOI: 10.1145/2629686

Chatterjee, K., &; Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer.https://doi.org/10.1007/978-3-662-43951-7_11 
LibreCat: https://research-explorer.ista.ac.at/record/2162
DOI: 10.1007/978-3-662-43951-7_11
arXiv: 1404.5734

Chatterjee, K., Doyen, L., Nain, S., &; Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer.https://doi.org/10.1007/978-3-642-54830-7_16 
LibreCat: https://research-explorer.ista.ac.at/record/2213
DOI: 10.1007/978-3-642-54830-7_16
arXiv: 1401.3289

Chatterjee, K., Doyen, L., Gimbert, H., &; Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer.https://doi.org/10.1007/978-3-642-54830-7_14 
LibreCat: https://research-explorer.ista.ac.at/record/2212
DOI: 10.1007/978-3-642-54830-7_14

Chatterjee, K., Ibsen-Jensen, R., &; Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer.https://doi.org/10.1145/2562059.2562141 
LibreCat: https://research-explorer.ista.ac.at/record/2216
DOI: 10.1145/2562059.2562141

Chatterjee, K., Daca, P., &; Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria.https://doi.org/10.15479/AT:IST-2014-153-v2-2 
LibreCat: https://research-explorer.ista.ac.at/record/5413
DOI: 10.15479/AT:IST-2014-153-v2-2

Chatterjee, K., Daca, P., &; Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria.https://doi.org/10.15479/AT:IST-2014-153-v3-1 
LibreCat: https://research-explorer.ista.ac.at/record/5414
DOI: 10.15479/AT:IST-2014-153-v3-1