Divergence among rice cultivars reveals roles for transposition and epimutation in ongoing evolution of genomic imprinting
J.A. Rodrigues, P.-H. Hsieh, D. Ruan, T. Nishimura, M.K. Sharma, R. Sharma, X. Ye, N.D. Nguyen, S. Nijjar, P.C. Ronald, R.L. Fischer, D. Zilberman, Proceedings of the National Academy of Sciences of the United States of America 118 (2021).

In vitro reconstitution reveals phosphoinositides as cargo-release factors and activators of the AR GAP ADA
C.F. Düllberg, A. Auer, N. Canigova, K. Loibl, M. Loose, Proceedings of the National Academy of Sciences of the United States of America 118 (2021).

Nonlinear computations in spiking neural networks through multiplicative synapses
M. Nardin, J.W. Phillips, W.F. Podlaski, S.W. Keemink, Peer Community Journal 1 (2021).

M-FAC: Efficient matrix-free approximations of second-order information
E. Frantar, E. Kurtic, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 14873–14886.

Towards tight communication lower bounds for distributed optimisation
D.-A. Alistarh, J. Korhonen, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 7254–7266.

On nonlinear problems of parabolic type with implicit constitutive equations involving flux
M. Bulídek, E. Maringová, J. Málek, Mathematical Models and Methods in Applied Sciences 31 (2021).

Bosonic collective excitations in Fermi gases
N.P. Benedikter, Reviews in Mathematical Physics 33 (2021).

The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime
C. Boccato, Reviews in Mathematical Physics 33 (2021).

Impurities in a one-dimensional Bose gas: The flow equation approach
F. Brauneis, H.-W. Hammer, M. Lemeshko, A. Volosniev, SciPost Physics 11 (2021).

Importance sampling scheme for the stochastic simulation of quantum spin dynamics
S. De Nicola, SciPost Physics 11 (2021).

The polaron at strong coupling
D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and Technology Austria, 2021.

Simple, deterministic, constant-round coloring in congested clique and MPC
A. Czumaj, P. Davies, M. Parter, SIAM Journal on Computing 50 (2021) 1603–1626.

On the complexity of intersection non-emptiness for star-free language classes
E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.

A new notion of commutativity for the algorithmic Lovász Local Lemma
D.G. Harris, F. Iliopoulos, V. Kolmogorov, in:, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.

A bit of nondeterminism makes pushdown automata expressive and succinct
S. Guha, I.R. Jecker, K. Lehtinen, M. Zimmermann, in:, 46th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.

Faster algorithms for bounded liveness in graphs and game graphs
K. Chatterjee, M. Henzinger, S.S. Kale, A. Svozil, in:, 48th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.

A Ramsey theorem for finite monoids
I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.

Brief announcement: Sinkless orientation is hard also in the supported LOCAL model
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, J. Suomela, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.

Lower bounds for shared-memory leader election under bounded write contention
D.-A. Alistarh, R. Gelashvili, G. Nadiradze, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.

Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds
B. Chatterjee, S. Peri, M. Sa, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.