Barton, Nicholas H., et al. “The Infinitesimal Model: Definition Derivation and Implications.”10.1016/j.tpb.2017.06.001__Theoretical Population Biology, vol. 118, Academic Press, 2017, pp. 50–73, doi:10.1016/j.tpb.2017.06.001.
LibreCat: https://research-explorer.ista.ac.at/record/626
DOI: 10.1016/j.tpb.2017.06.001

Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.”10.1007/978-3-319-63121-9_18__Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.
LibreCat: https://research-explorer.ista.ac.at/record/625
DOI: 10.1007/978-3-319-63121-9_18

Nikolic, Nela, et al. “MazF Activation Promotes Translational Heterogeneity of the GrcA MRNA in Escherichia Coli Populations.”10.7717/peerj.3830__PeerJ, vol. 2017, no. 9, 3830, PeerJ, 2017, doi:10.7717/peerj.3830.
LibreCat: https://research-explorer.ista.ac.at/record/624
DOI: 10.7717/peerj.3830

Chatterjee, Krishnendu, et al. Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds. Edited by Rupak Majumdar and Viktor Kundak, vol. 10426, Springer, 2017, pp. 118–39, doi:10.1007/978-3-319-63387-9_6.
LibreCat: https://research-explorer.ista.ac.at/record/628
DOI: 10.1007/978-3-319-63387-9_6

Sauermann, Stefan, et al. Biosignals Standards and FHIR: The Way to Go. Vol. 236, IOS Press, 2017, pp. 356–62, doi:10.3233/978-1-61499-759-7-356.
LibreCat: https://research-explorer.ista.ac.at/record/630
DOI: 10.3233/978-1-61499-759-7-356

Lewin, Mathieu, et al. “A Note on 2D Focusing Many Boson Systems.”10.1090/proc/13468__Proceedings of the American Mathematical Society, vol. 145, no. 6, American Mathematical Society, 2017, pp. 2441–54, doi:10.1090/proc/13468.
LibreCat: https://research-explorer.ista.ac.at/record/632
DOI: 10.1090/proc/13468

Alwen, Joel F., et al. Scrypt Is Maximally Memory Hard. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:10.1007/978-3-319-56617-7_2.
LibreCat: https://research-explorer.ista.ac.at/record/635
DOI: 10.1007/978-3-319-56617-7_2

Bakhirkin, Alexey, et al. On the Quantitative Semantics of Regular Expressions over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi:10.1007/978-3-319-65765-3_11.
LibreCat: https://research-explorer.ista.ac.at/record/636
DOI: 10.1007/978-3-319-65765-3_11

Alwen, Joel F., et al. Depth-Robust Graphs and Their Cumulative Memory Complexity. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 3–32, doi:10.1007/978-3-319-56617-7_1.
LibreCat: https://research-explorer.ista.ac.at/record/640
DOI: 10.1007/978-3-319-56617-7_1

Henzinger, Thomas A., et al. Synchronizing the Asynchronous. IST Austria, 2017, doi:10.15479/AT:IST-2018-853-v2-2.
LibreCat: https://research-explorer.ista.ac.at/record/6426
DOI: 10.15479/AT:IST-2018-853-v2-2

Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.”10.1090/mcom/3201__Mathematics of Computation, vol. 86, no. 307, American Mathematical Society, 2017, pp. 2373–97, doi:10.1090/mcom/3201.
LibreCat: https://research-explorer.ista.ac.at/record/642
DOI: 10.1090/mcom/3201

Ashok, Pranav, et al. Value Iteration for Long Run Average Reward in Markov Decision Processes. Edited by Rupak Majumdar and Viktor Kundak, vol. 10426, Springer, 2017, pp. 201–21, doi:10.1007/978-3-319-63387-9_10.
LibreCat: https://research-explorer.ista.ac.at/record/645
DOI: 10.1007/978-3-319-63387-9_10

Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.”10.1137/16M1091836__SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
LibreCat: https://research-explorer.ista.ac.at/record/644
DOI: 10.1137/16M1091836

Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.
LibreCat: https://research-explorer.ista.ac.at/record/646
DOI: 10.1007/978-3-319-58771-4_19

Skórski, Maciej. On the Complexity of Breaking Pseudoentropy. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:10.1007/978-3-319-55911-7_43.
LibreCat: https://research-explorer.ista.ac.at/record/648
DOI: 10.1007/978-3-319-55911-7_43

Skórski, Maciej. A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:10.1007/978-3-319-55911-7_42.
LibreCat: https://research-explorer.ista.ac.at/record/650
DOI: 10.1007/978-3-319-55911-7_42

Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for Parity Games. Vol. 82, 18, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, doi:10.4230/LIPICS.CSL.2017.18.
LibreCat: https://research-explorer.ista.ac.at/record/6519
DOI: 10.4230/LIPICS.CSL.2017.18

Fulek, Radoslav. Embedding Graphs into Embedded Graphs. Vol. 92, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ISAAC.2017.34.
LibreCat: https://research-explorer.ista.ac.at/record/6517
DOI: 10.4230/LIPICS.ISAAC.2017.34

Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.”10.1038/ng.3764__Nature Genetics, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:10.1038/ng.3764.
LibreCat: https://research-explorer.ista.ac.at/record/653
DOI: 10.1038/ng.3764
PMID: 28092682

Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.”10.1145/3133956.3134031__Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–17, doi:10.1145/3133956.3134031.
LibreCat: https://research-explorer.ista.ac.at/record/6527
DOI: 10.1145/3133956.3134031