Establishment in a new habitat by polygenic adaptation
N.H. Barton, A. Etheridge, Theoretical Population Biology 122 (2018) 110–127.

Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering
T. Ellis, D. Field, N.H. Barton, Molecular Ecology Resources 18 (2018) 988–999.

Data and Python scripts supporting Python package FAPS
T. Ellis, (2018).

Evolutionary pathways for the generation of new self-incompatibility haplotypes in a non-self recognition system
K. Bodova, T. Priklopil, D. Field, N.H. Barton, M. Pickup, Genetics 209 (2018) 861–883.

Supplemental material for Bodova et al., 2018
K. Bodova, T. Priklopil, D. Field, N.H. Barton, M. Pickup, (2018).

Strategy representation by decision trees in reactive synthesis
T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp. 385–407.

Inferring recent demography from spatial genetic structure
H. Ringbauer, Inferring Recent Demography from Spatial Genetic Structure, Institute of Science and Technology Austria, 2018.

Quantitative analysis of smart contracts
K. Chatterjee, A.K. Goharshady, Y. Velner, in:, Springer, 2018, pp. 739–767.

Goal-HSVI: Heuristic search value iteration for goal-POMDPs
K. Horák, B. Bosanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770.

Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter
K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, ACM, 2018, pp. 2341–2356.

New approaches for almost-sure termination of probabilistic programs
M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201.

Computing average response time
K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.

Computational approaches for stochastic shortest path on succinct MDPs
K. Chatterjee, H. Fu, A.K. Goharshady, N. Okati, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4700–4707.

Cost analysis of nondeterministic probabilistic programs
1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, 5 Anonymous, 6 Anonymous, Cost Analysis of Nondeterministic Probabilistic Programs, IST Austria, 2018.

Ergodic mean-payoff games for the analysis of attacks in crypto-currencies
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

Secure Credit Reporting on the Blockchain
A.K. Goharshady, A. Behrouz, K. Chatterjee, in:, Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–1348.

Efficient algorithms for asymptotic bounds on termination time in VASS
T. Brázdil, K. Chatterjee, A. Kudera, P. Novotný, D. Velan, F. Zuleger, in:, IEEE, 2018, pp. 185–194.

Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives
K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.

Indirect reciprocity with private, noisy, and incomplete information
C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, M. Nowak, PNAS 115 (2018) 12241–12246.

Symbolic algorithms for graphs and Markov decision processes with fairness objectives
K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer, 2018, pp. 178–197.