Frantar, Elias, et al. “M-FAC: Efficient Matrix-Free Approximations of Second-Order Information.” 35th Conference on Neural Information Processing Systems, vol. 34, Curran Associates, 2021, pp. 14873–86.

Alistarh, Dan-Adrian, and Janne Korhonen. “Towards Tight Communication Lower Bounds for Distributed Optimisation.” 35th Conference on Neural Information Processing Systems, vol. 34, Curran Associates, 2021, pp. 7254–66.

Shute, Alec L. “Sums of Four Squareful Numbers.”10.48550/arXiv.2104.06966__ArXiv, 2104.06966, doi:10.48550/arXiv.2104.06966.

Truckenbrodt, Sven M., and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution by10.1016/bs.mcb.2020.04.016__Microscopy.”10.1016/bs.mcb.2020.04.016__Methods in Cell Biology, vol. 161, Elsevier, 2021, pp. 33–56, doi:10.1016/bs.mcb.2020.04.016.

Pandey, Rakesh, et al. “Role of Subnetworks Mediated by TNF ;1, IL-23/IL-17 and IL-15 in a Network Involved in the Pathogenesis of Psoriasis.”10.1038/s41598-020-80507-7__Scientific Reports, vol. 11, 2204, Springer Nature, 2021, doi:10.1038/s41598-020-80507-7.

Xia, Peng, and Carl-Philipp J. Heisenberg. “Quantifying Tissue Tension in the Granulosa Layer after Laser Surgery.”10.1007/978-1-0716-0970-5_10__Germline Development in the Zebrafish, edited by Roland Dosch, vol. 2218, Humana, 2021, pp. 117–28, doi:10.1007/978-1-0716-0970-5_10.

Aichholzer, Oswin, et al. “On Compatible Matchings.”10.1007/978-3-030-68211-8_18__15th International Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021, pp. 221–33, doi:10.1007/978-3-030-68211-8_18.

Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” Deliberate Ignorance: Choosing Not To Know, edited by Ralph Hertwig and Christoph Engel, vol. 29, MIT Press, 2021, pp. 139–52.

Walter, Michael. “The Convergence of Slide-Type Reductions.”10.1007/978-3-030-75245-3_3__Public-Key Cryptography – PKC 2021, vol. 12710, Springer Nature, 2021, pp. 45–67, doi:10.1007/978-3-030-75245-3_3.

Edelsbrunner, Herbert, et al. “A Step in the Delaunay Mosaic of Order K.”10.1007/s00022-021-00577-4__Journal of Geometry, vol. 112, no. 1, 15, Springer Nature, 2021, doi:10.1007/s00022-021-00577-4.

Davies, Peter, et al. “New Bounds for Distributed Mean Estimation and Variance Reduction.” 9th International Conference on Learning Representations, 2021.

Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” Proceedings of the 33rd Canadian Conference on Computational Geometry.

Anderson, Donovan J., et al. “Simultaneous Identification of Brain Cell Type and Lineage via Single Cell RNA Sequencing.”10.1101/2020.12.31.425016__BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.12.31.425016.

Volhejn, Vaclav, and Christoph Lampert. “Does SGD Implicitly Optimize for Smoothness?”10.1007/978-3-030-71278-5_18__42nd German Conference on Pattern Recognition, vol. 12544, Springer, 2021, pp. 246–59, doi:10.1007/978-3-030-71278-5_18.

Edelsbrunner, Herbert, et al. “The Density Fingerprint of a Periodic Point Set.”10.4230/LIPIcs.SoCG.2021.32__37th International Symposium on Computational Geometry (SoCG 2021), vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 32:1-32:16, doi:10.4230/LIPIcs.SoCG.2021.32.

Kaloshin, Vadim, and Edmond Koudjinan. Non Co-Preservation of the 1/2 and  1/(2l+1)-Rational Caustics along Deformations of Circles. 2021.

Biswas, Ranita, et al. “Counting Cells of Order-k Voronoi Tessellations in d<sup>3</sup> with Morse Theory.”10.4230/LIPIcs.SoCG.2021.16__Leibniz International Proceedings in Informatics, vol. 189, 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.16.

Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.”10.1007/978-3-030-79527-6_1__Structural Information and Communication Complexity, vol. 12810, Springer Nature, 2021, pp. 3–12, doi:10.1007/978-3-030-79527-6_1.

Auerbach, Benedikt, et al. “Inverse-Sybil Attacks in Automated Contact Tracing.”10.1007/978-3-030-75539-3_17__Topics in Cryptology – CT-RSA 2021, vol. 12704, Springer Nature, 2021, pp. 399–421, doi:10.1007/978-3-030-75539-3_17.

Laarhoven, Thijs, and Michael Walter. “Dual Lattice Attacks for Closest Vector Problems (with Preprocessing).”10.1007/978-3-030-75539-3_20__Topics in Cryptology – CT-RSA 2021, vol. 12704, Springer Nature, 2021, pp. 478–502, doi:10.1007/978-3-030-75539-3_20.