Bloem, R., Chatterjee, K., &; Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, &; R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer.https://doi.org/10.1007/978-3-319-10575-8_27 
LibreCat: https://research-explorer.ista.ac.at/record/59
DOI: 10.1007/978-3-319-10575-8_27

Clarke, E., Henzinger, T. A., &; Veith, H. (2018). Introduction to model checking. In T. A. Henzinger (Ed.), Handbook of Model Checking (pp. 1–26). Springer.https://doi.org/10.1007/978-3-319-10575-8_1 
LibreCat: https://research-explorer.ista.ac.at/record/60
DOI: 10.1007/978-3-319-10575-8_1

Bondarenko, A., Mellit, A., Prymak, A., Radchenko, D., &; Viazovska, M. (2018). There is no strongly regular graph with parameters (460; 153; 32; 60). In Contemporary Computational Mathematics (pp. 131–134). Springer.https://doi.org/10.1007/978-3-319-72456-0_7 
LibreCat: https://research-explorer.ista.ac.at/record/61
DOI: 10.1007/978-3-319-72456-0_7
arXiv: 1509.06286

Fan, S., Lorenz, M., Massberg, S., &; Gärtner, F. R. (2018). Platelet migration and bacterial trapping assay under flow. Bio-Protocol. Bio-Protocol.https://doi.org/10.21769/bioprotoc.3018 
LibreCat: https://research-explorer.ista.ac.at/record/6354
DOI: 10.21769/bioprotoc.3018

Petritsch, B. (2018). Open Access at IST Austria 2009-2017. Presented at the Open-Access-Tage, Graz, Austria: IST Austria.https://doi.org/10.5281/zenodo.1410279 
LibreCat: https://research-explorer.ista.ac.at/record/6459
DOI: 10.5281/zenodo.1410279

Hausel, T., Mellit, A., &; Pei, D. (2018). Mirror symmetry with branes by equivariant verlinde formulas. In Geometry and Physics: Volume I (pp. 189–218). Oxford University Press.https://doi.org/10.1093/oso/9780198802013.003.0009 
LibreCat: https://research-explorer.ista.ac.at/record/6525
DOI: 10.1093/oso/9780198802013.003.0009

Lee, J., &; Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. Springer.https://doi.org/10.1007/s00440-017-0787-8 
LibreCat: https://research-explorer.ista.ac.at/record/690
DOI: 10.1007/s00440-017-0787-8
arXiv: 1605.08767

Shekhovtsov, A., Swoboda, P., &; Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE.https://doi.org/10.1109/TPAMI.2017.2730884 
LibreCat: https://research-explorer.ista.ac.at/record/703
DOI: 10.1109/TPAMI.2017.2730884
arXiv: 1508.07902

Grubic, D., Tam, L., Alistarh, D.-A., &; Zhang, C. (2018). Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In Proceedings of the 21st International Conference on Extending Database Technology (pp. 145–156). Vienna, Austria: OpenProceedings.https://doi.org/10.5441/002/EDBT.2018.14 
LibreCat: https://research-explorer.ista.ac.at/record/7116
DOI: 10.5441/002/EDBT.2018.14

Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ITCS.2019.59 
LibreCat: https://research-explorer.ista.ac.at/record/7407
DOI: 10.4230/LIPICS.ITCS.2019.59

Alistarh, D.-A., Leiserson, W., Matveev, A., &; Shavit, N. (2018). ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. Association for Computing Machinery.https://doi.org/10.1145/3201897 
LibreCat: https://research-explorer.ista.ac.at/record/6001
DOI: 10.1145/3201897

Polino, A., Pascanu, R., &; Alistarh, D.-A. (2018). Model compression via distillation and quantization. In 6th International Conference on Learning Representations. Vancouver, Canada.
LibreCat: https://research-explorer.ista.ac.at/record/7812
arXiv: 1802.05668

Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou, E.,https://doi.org/10.1101/494088__Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv. Cold Spring Harbor Laboratory.https://doi.org/10.1101/494088 
LibreCat: https://research-explorer.ista.ac.at/record/8547
DOI: 10.1101/494088

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, &; M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer.https://doi.org/10.1007/978-3-319-95246-8_9 
LibreCat: https://research-explorer.ista.ac.at/record/86
DOI: 10.1007/978-3-319-95246-8_9

Danzl, J. G. (2018). Diffraction-unlimited optical imaging for synaptic physiology. Opera Medica et Physiologica. Lobachevsky State University of Nizhny Novgorod.https://doi.org/10.20388/omp2018.00s1.001 
LibreCat: https://research-explorer.ista.ac.at/record/9229
DOI: 10.20388/omp2018.00s1.001

Avni, G., Guha, S., &; Kupferman, O. (2018). Timed network games with clocks (Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.MFCS.2018.23 
LibreCat: https://research-explorer.ista.ac.at/record/6005
DOI: 10.4230/LIPICS.MFCS.2018.23

Polechova, J. (2018). Is the sky the limit? On the expansion threshold of a species’ range. PLoS Biology. Public Library of Science.https://doi.org/10.1371/journal.pbio.2005372 
LibreCat: https://research-explorer.ista.ac.at/record/315
DOI: 10.1371/journal.pbio.2005372

Frost, J. M., Kim, M. Y., Park, G. T., Hsieh, P.-H., Nakamura, M., Lin, S. J. H.,https://doi.org/10.1073/pnas.1713333115__Fischer, R. L. (2018). FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. Proceedings of the National Academy of Sciences. National Academy of Sciences.https://doi.org/10.1073/pnas.1713333115 
LibreCat: https://research-explorer.ista.ac.at/record/9471
DOI: 10.1073/pnas.1713333115
PMID: 29712855

Fulek, R., &; Kyndl, J. (2018). The 2-Genus of Kuratowski minors (Vol. 99, p. 40.1-40.14). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2018.40 
LibreCat: https://research-explorer.ista.ac.at/record/186
DOI: 10.4230/LIPIcs.SoCG.2018.40
arXiv: 1803.05085

Fulek, R., &; Pach, J. (2018). Thrackles: An improved upper bound (Vol. 10692, pp. 160–166). Presented at the GD 2017: Graph Drawing and Network Visualization, Boston, MA, United States: Springer.https://doi.org/10.1007/978-3-319-73915-1_14 
LibreCat: https://research-explorer.ista.ac.at/record/433
DOI: 10.1007/978-3-319-73915-1_14
arXiv: 1708.08037