Quantum groups as hidden symmetries of quantum impurities
E. Yakaboylu, M. Shkolnikov, M. Lemeshko, Physical Review Letters 121 (2018).

Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data
S. Hross, F.J. Theis, M.K. Sixt, J. Hasenauer, Journal of the Royal Society Interface 15 (2018).

Chromatic transitions in the emergence of syntax networks
B. Corominas-Murtra, M.S. Fibla, S. Valverde, R. Solé, Royal Society Open Science 5 (2018).

Zipf's Law, unbounded complexity and open-ended evolution
B. Corominas-Murtra, L.F. Seoane, R. Solé, Journal of the Royal Society Interface 15 (2018).

The cell sets the tone
J.H. Alanko, M.K. Sixt, ELife 7 (2018).

Genomics in neurodevelopmental disorders: an avenue to personalized medicine
D.-C. Tarlungeanu, G. Novarino, Experimental &; Molecular Medicine 50 (2018).

Graph games and reactive synthesis
R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Model Checking, 1st ed., Springer, 2018, pp. 921–962.

Keynote: The first-order logic of signals
A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10.

Proving the existence of loops in robot trajectories
S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516.

A brief tutorial on distributed and concurrent machine learning
D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM, 2018, pp. 487–488.

The convergence of stochastic gradient descent in asynchronous shared memory
D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM, 2018, pp. 169–178.

Relaxed schedulers can efficiently parallelize iterative algorithms
D.-A. Alistarh, T.A. Brown, J. Kopinsky, G. Nadiradze, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM, 2018, pp. 377–386.

Brief Announcement: Performance prediction for coarse-grained locking
V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM, 2018, pp. 411–413.

Distributionally linearizable data structures
D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM, 2018, pp. 133–142.

The transactional conflict problem
D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM, 2018, pp. 383–392.

The Big Match with a clock and a bit of memory
K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM, 2018, pp. 149–150.

Bounds on the norm of Wigner-type random matrices
L. Erdös, P. Mühlbacher, Random Matrices: Theory and Applications (2018).

Commutativity in the algorithmic Lovász local lemma
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.

FlexMaps: Computational design of flat flexible shells for shaping 3D objects
L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni, B. Bickel, ACM Transactions on Graphics 37 (2018).

Exact MAP-inference by confining combinatorial search with LP relaxation
S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588.