Mühlböck F, Tate R. Transitioning from structural to nominal code with efficient gradual typing. Proceedings of the ACM on Programming Languages. 2021;5. doi:10.1145/3485504

Degraen D, Piovarci M, Bickel B, Kruger A. Capturing tactile properties of real surfaces for haptic reproduction. In: 34th Annual ACM Symposium. Association for Computing Machinery; 2021:954-971. doi:10.1145/3472749.3474798

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

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

Alistarh D-A, Gelashvili R, Rybicki J. Brief announcement: Fast graphical population protocols. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.43

Alistarh D-A, Gelashvili R, Nadiradze G. Lower bounds for shared-memory leader election under bounded write contention. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.4

Chatterjee B, Peri S, Sa M. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.52

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

Zhang Y, Li L, Friml J. Evaluation of gravitropism in non-seed plants. In: Blancaflor EB, ed. Plant Gravitropism. Vol 2368. MIMB. Springer Nature; 2021:43-51. doi:10.1007/978-1-0716-1677-2_2

Hörmayer L, Friml J, Glanc M. Automated time-lapse imaging and manipulation of cell divisions in Arabidopsis roots by vertical-stage confocal microscopy. In: Plant Cell Division. Vol 2382. MIMB. Humana Press; 2021:105-114. doi:10.1007/978-1-0716-1744-1_6

Dubach G. On eigenvector statistics in the spherical and truncated unitary ensembles. Electronic Journal of Probability. 2021;26. doi:10.1214/21-EJP686

Ilharco C, Shirazi A, Gopalan A, 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. Association for Computational Linguistics; 2021:29-30. doi:10.18653/v1/2021.acl-tutorials.6

Browning TD. Cubic Forms and the Circle Method. Vol 343. Cham: Springer Nature; 2021. doi:10.1007/978-3-030-86872-7

Bodova K, Szep E, Barton NH. Dynamic maximum entropy provides accurate approximation of structured population dynamics. PLoS Computational Biology. 2021;17(12). doi:10.1371/journal.pcbi.1009661

Kolmogorov V, Pock T. One-sided Frank-Wolfe algorithms for saddle problems. In: 38th International Conference on Machine Learning. ; 2021.

Nguyen Q, Mondelli M, Montufar GF. Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks. In: Meila M, Zhang T, eds. Proceedings of the 38th International Conference on Machine Learning. Vol 139. ML Research Press; 2021:8119-8129.

Hashemi SA, Mondelli M, Cioffi J, Goldsmith A. Successive syndrome-check decoding of polar codes. In: Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers. Vol 2021-October. Institute of Electrical and Electronics Engineers; 2021:943-947. doi:10.1109/IEEECONF53345.2021.9723394

Chen JP, Sau F. Higher-order hydrodynamics and equilibrium fluctuations of interacting particle systems. Markov Processes And Related Fields. 2021;27(3):339-380.

Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection non-emptiness for star-free language classes. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 213. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.34

Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on product graphs of small treewidth. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.42