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.

Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.”10.1007/978-3-030-79527-6_6__Structural Information and Communication Complexity, vol. 12810, Springer Nature, 2021, pp. 87–105, doi:10.1007/978-3-030-79527-6_6.