Schilling, C., Bogomolov, S., Henzinger, T. A., Podelski, A., &; Ruess, J. (2016). Adaptive moment closure for parameter inference of biochemical reaction networks. Biosystems. Elsevier.https://doi.org/10.1016/j.biosystems.2016.07.005 

Bogomolov, S., Donzé, A., Frehse, G., Grosu, R., Johnson, T., Ladan, H.,https://doi.org/10.1007/s10009-015-0393-y__Wehrle, M. (2016). Guided search for hybrid systems based on coarse-grained space abstractions. International Journal on Software Tools for Technology Transfer. Springer.https://doi.org/10.1007/s10009-015-0393-y 

Pielorz, J., &; Lampert, C. (2016). Optimal geospatial allocation of volunteers for crisis management. Presented at the ICT-DM: Information and Communication Technologies for Disaster Management, Rennes, France: IEEE.https://doi.org/10.1109/ICT-DM.2015.7402041 

Klimova, A., &; Rudas, T. (2016). On the closure of relational models. Journal of Multivariate Analysis. Elsevier.https://doi.org/10.1016/j.jmva.2015.10.005 

Lee, J., &; Schnelli, K. (2016). Extremal eigenvalues and eigenvectors of deformed Wigner matrices. Probability Theory and Related Fields. Springer.https://doi.org/10.1007/s00440-014-0610-8 

Matousek, J., Sedgwick, E., Tancer, M., &; Wagner, U. (2016). Untangling two systems of noncrossing curves. Israel Journal of Mathematics. Springer.https://doi.org/10.1007/s11856-016-1294-9 

Krenn, S., Pietrzak, K. Z., Wadia, A., &; Wichs, D. (2016). A counterexample to the chain rule for conditional HILL entropy. Computational Complexity. Springer.https://doi.org/10.1007/s00037-015-0120-9 

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 

Jiang, Y., Liu, H., Kong, H., Wang, R., Hosseini, M., Sun, J., &; Sha, L. (2016). Use runtime verification to improve the quality of medical care practice. In Proceedings of the 38th International Conference on Software Engineering Companion  (pp. 112–121). Austin, TX, USA: IEEE.https://doi.org/10.1145/2889160.2889233 

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 

Burton, B., de Mesmay, A. N., &; Wagner, U. (2016). Finding non-orientable surfaces in 3-manifolds (Vol. 51, p. 24.1-24.15). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.https://doi.org/10.4230/LIPIcs.SoCG.2016.24 

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 

Anonymous, 1, Anonymous, 2, &; Anonymous, 3. (2016). Termination and worst-case analysis of recursive programs. IST Austria.

Anonymous, 1, Anonymous, 2, &; Anonymous, 3. (2016). Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds. IST Austria.

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