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