Amplification on undirected population structures: Comets beat stars
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected Population Structures: Comets Beat Stars, IST Austria, 2016.

Arbitrarily strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.

Strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of Natural Selection, IST Austria, 2016.

Experimental game instructions
C. Hilbe, K. Hagel, M. Milinski, (2016).

Asymmetric power boosts extortion in an economic experiment
C. Hilbe, K. Hagel, M. Milinski, PLoS One 11 (2016).

Experimental data
C. Hilbe, K. Hagel, M. Milinski, (2016).

Algorithms for partially observable markov decision processes
M. Chmelik, Algorithms for Partially Observable Markov Decision Processes, Institute of Science and Technology Austria, 2016.

Linear distances between Markov chains
P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.

Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.

Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342.

Arbitrarily strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.

Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.

Termination analysis of probabilistic programs through Positivstellensatz's
K. Chatterjee, H. Fu, A.K. Goharshady, in:, Springer, 2016, pp. 3–22.

The value 1 problem under finite-memory strategies for concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, in:, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2015, pp. 1018–1029.

Polynomial time decidability of weighted synchronization under partial observability
J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–154.

Computational complexity of ecological and evolutionary spatial dynamics
R. Ibsen-Jensen, K. Chatterjee, M. Nowak, PNAS 112 (2015) 15636–15641.

Controller synthesis for MDPs and frequency LTL\'47U
V. Forejt, J. Krdál, J. Kretinsky, in:, Springer, 2015, pp. 162–177.

The Hanoi omega-automata format
T. Babiak, F. Blahoudek, A. Duret Lutz, J. Klein, J. Kretinsky, D. Mueller, D. Parker, J. Strejdek, in:, Springer, 2015, pp. 479–486.

The complexity of synthesis from probabilistic components
K. Chatterjee, L. Doyen, M. Vardi, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 108–120.

Cellular cooperation with shift updating and repulsion
A. Pavlogiannis, K. Chatterjee, B. Adlam, M. Nowak, Scientific Reports 5 (2015).