K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in 48th International Colloquium on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.

H. Adams, H. Kourimska, T. Heiss, S. Percival, and L. Ziegelmeier, “How to tutorial-a-thon,” Notices of the American Mathematical Society, vol. 68, no. 9. American Mathematical Society, pp. 1511–1514, 2021.

D. G. Harris, F. Iliopoulos, and V. Kolmogorov, “A new notion of commutativity for the algorithmic Lovász Local Lemma,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Virtual, 2021, vol. 207.

S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 2021, vol. 202.

M. Nardin, K. Käfer, and J. L. Csicsvari, “The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus,” bioRxiv. Cold Spring Harbor Laboratory.

F. Mühlböck and R. Tate, “Transitioning from structural to nominal code with efficient gradual typing,” Proceedings of the ACM on Programming Languages, vol. 5. Association for Computing Machinery, 2021.

D. Degraen, M. Piovarci, B. Bickel, and A. Kruger, “Capturing tactile properties of real surfaces for haptic reproduction,” in 34th Annual ACM Symposium, Virtual, 2021, pp. 954–971.

N. Clozeau and A. Gloria, “Quantitative nonlinear homogenization: control of oscillations,” arXiv. .

T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, and E.-A. Peste, “Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks,” Journal of Machine Learning Research, vol. 22, no. 241. Journal of Machine Learning Research, pp. 1–124, 2021.

D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Brief announcement: Fast graphical population protocols,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.

D.-A. Alistarh, R. Gelashvili, and G. Nadiradze, “Lower bounds for shared-memory leader election under bounded write contention,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.

B. Chatterjee, S. Peri, and M. Sa, “Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.

J. Korhonen, A. Paz, J. Rybicki, S. Schmid, and J. Suomela, “Brief announcement: Sinkless orientation is hard also in the supported LOCAL model,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.

Y. Zhang, L. Li, and J. Friml, “Evaluation of gravitropism in non-seed plants,” in Plant Gravitropism, vol. 2368, E. B. Blancaflor, Ed. Springer Nature, 2021, pp. 43–51.

L. Hörmayer, J. Friml, and M. Glanc, “Automated time-lapse imaging and manipulation of cell divisions in Arabidopsis roots by vertical-stage confocal microscopy,” in Plant Cell Division, vol. 2382, Humana Press, 2021, pp. 105–114.

G. Dubach, “On eigenvector statistics in the spherical and truncated unitary ensembles,” Electronic Journal of Probability, vol. 26. Institute of Mathematical Statistics, 2021.

C. Ilharco et al., “Recognizing multimodal entailment,” in 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts, Bangkok, Thailand, 2021, pp. 29–30.

T. D. Browning, Cubic Forms and the Circle Method, vol. 343. Cham: Springer Nature, 2021.

K. Bodova, E. Szep, and N. H. Barton, “Dynamic maximum entropy provides accurate approximation of structured population dynamics,” PLoS Computational Biology, vol. 17, no. 12. Public Library of Science, 2021.

V. Kolmogorov and T. Pock, “One-sided Frank-Wolfe algorithms for saddle problems,” in 38th International Conference on Machine Learning, Virtual, 2021.