Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., &; Wagner, U. (2017). On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. Springer.https://doi.org/10.1007/s11856-017-1607-7 

Chait, R. P., Ruess, J., Bergmiller, T., Tkadik, G., &; Guet, C. C. (2017). Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. Nature Publishing Group.https://doi.org/10.1038/s41467-017-01683-1 

Erdös, L., &; Schnelli, K. (2017). Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute of Mathematical Statistics.https://doi.org/10.1214/16-AIHP765 

Barton, N. H., Etheridge, A., &; Véber, A. (2017). The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. Academic Press.https://doi.org/10.1016/j.tpb.2017.06.001 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, &; R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer.https://doi.org/10.1007/978-3-319-63121-9_18 

Nikolic, N., Didara, Z., &; Moll, I. (2017). MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. PeerJ.https://doi.org/10.7717/peerj.3830 

Chatterjee, K., Fu, H., &; Murhekar, A. (2017). Automated recurrence analysis for almost linear expected runtime bounds. In R. Majumdar &; V. Kundak (Eds.) (Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer.https://doi.org/10.1007/978-3-319-63387-9_6 

Sauermann, S., David, V., Schlögl, A., Egelkraut, R., Frohner, M., Pohn, B.,https://doi.org/10.3233/978-1-61499-759-7-356__Mense, A. (2017). Biosignals standards and FHIR: The way to go (Vol. 236, pp. 356–362). Presented at the eHealth: Health Informatics Meets eHealth, Vienna, Austria: IOS Press.https://doi.org/10.3233/978-1-61499-759-7-356 

Lewin, M., Nam, P., &; Rougerie, N. (2017). A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. American Mathematical Society.https://doi.org/10.1090/proc/13468 

Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., &; Tessaro, S. (2017). Scrypt is maximally memory hard. In J.-S. Coron &; J. Buus Nielsen (Eds.) (Vol. 10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer.https://doi.org/10.1007/978-3-319-56617-7_2 

Bakhirkin, A., Ferrere, T., Maler, O., &; Ulus, D. (2017). On the quantitative semantics of regular expressions over real-valued signals. In A. Abate &; G. Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer.https://doi.org/10.1007/978-3-319-65765-3_11 

Alwen, J. F., Blocki, J., &; Pietrzak, K. Z. (2017). Depth-robust graphs and their cumulative memory complexity. In J.-S. Coron &; J. Buus Nielsen (Eds.) (Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer.https://doi.org/10.1007/978-3-319-56617-7_1 

Henzinger, T. A., Kragl, B., &; Qadeer, S. (2017). Synchronizing the asynchronous. IST Austria.https://doi.org/10.15479/AT:IST-2018-853-v2-2 

Gerencser, M., &; Gyöngy, I. (2017). Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. American Mathematical Society.https://doi.org/10.1090/mcom/3201 

Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., &; Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar &; V. Kundak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer.https://doi.org/10.1007/978-3-319-63387-9_10 

Kolmogorov, V., Krokhin, A., &; Rolinek, M. (2017). The complexity of general-valued CSPs. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/16M1091836 

Kuske, J., Swoboda, P., &; Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, &; A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer.https://doi.org/10.1007/978-3-319-58771-4_19 

Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger &; S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer.https://doi.org/10.1007/978-3-319-55911-7_43 

Skórski, M. (2017). A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In G. Jäger &; S. Steila (Eds.) (Vol. 10185, pp. 586–599). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer.https://doi.org/10.1007/978-3-319-55911-7_42 

Chatterjee, K., Dvorák, W., Henzinger, M. H., &; Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik.https://doi.org/10.4230/LIPICS.CSL.2017.18