T. Okamoto, K. Z. Pietrzak, B. Waters, and D. Wichs, “New realizations of somewhere statistically binding hashing and positional accumulators,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand, 2016, vol. 9452, pp. 121–145.

C. Schilling, S. Bogomolov, T. A. Henzinger, A. Podelski, and J. Ruess, “Adaptive moment closure for parameter inference of biochemical reaction networks,” Biosystems, vol. 149. Elsevier, pp. 15–25, 2016.

S. Bogomolov et al., “Guided search for hybrid systems based on coarse-grained space abstractions,” International Journal on Software Tools for Technology Transfer, vol. 18, no. 4. Springer, pp. 449–467, 2016.

J. Pielorz and C. Lampert, “Optimal geospatial allocation of volunteers for crisis management,” presented at the ICT-DM: Information and Communication Technologies for Disaster Management, Rennes, France, 2016.

A. Klimova and T. Rudas, “On the closure of relational models,” Journal of Multivariate Analysis, vol. 143. Elsevier, pp. 440–452, 2016.

J. Lee and K. Schnelli, “Extremal eigenvalues and eigenvectors of deformed Wigner matrices,” Probability Theory and Related Fields, vol. 164, no. 1–2. Springer, pp. 165–241, 2016.

J. Matousek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” Israel Journal of Mathematics, vol. 212, no. 1. Springer, pp. 37–79, 2016.

S. Krenn, K. Z. Pietrzak, A. Wadia, and D. Wichs, “A counterexample to the chain rule for conditional HILL entropy,” Computational Complexity, vol. 25, no. 3. Springer, pp. 567–605, 2016.

K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.

Y. Jiang et al., “Use runtime verification to improve the quality of medical care practice,” in Proceedings of the 38th International Conference on Software Engineering Companion , Austin, TX, USA, 2016, pp. 112–121.

K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.

B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-manifolds,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 24.1-24.15.

K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with <9-regular objectives,” Journal of Computer and System Sciences, vol. 82, no. 5. Elsevier, pp. 878–911, 2016.

K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” Artificial Intelligence, vol. 234. Elsevier, pp. 26–48, 2016.

K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural analysis. IST Austria, 2016.

K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 2016, vol. 2016, pp. 3225–3232.

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification on undirected population structures: Comets beat stars. IST Austria, 2016.

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.

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

R. Biswas and P. Bhowmick, “On functionality of quadraginta octants of naive sphere with application to circle drawing,” in Discrete Geometry for Computer Imagery, Nantes, France, 2016, vol. 9647, pp. 256–267.