Gallego SG, Cantalupo S, Sarpas S, Duboeuf B, Lilly S, Pezzulli G, Marino RA, Matthee JJ, Wisotzki L, Schaye J, Richard J, Kusakabe H, Mauerhofer V. 2021. Constraining the cosmic UV background at z &; 3 with MUSE Lyman-;1 emission observations. Monthly Notices of the Royal Astronomical Society. 504(1), 16–32.
LibreCat: https://research-explorer.ista.ac.at/record/11525
DOI: 10.1093/mnras/stab796
arXiv: 2103.09250

Gronke M, Ocvirk P, Mason C, Matthee JJ, Bosman SEI, Sorce JG, Lewis J, Ahn K, Aubert D, Dawoodbhoy T, Iliev IT, Shapiro PR, Yepes G. 2021. Lyman-;1 transmission properties of the intergalactic medium in the CoDaII simulation. Monthly Notices of the Royal Astronomical Society. 508(3), 3697–3709.
LibreCat: https://research-explorer.ista.ac.at/record/11522
DOI: 10.1093/mnras/stab2762
arXiv: 2004.14496

Santos S, Sobral D, Butterworth J, Paulino-Afonso A, Ribeiro B, da Cunha E, Calhau J, Khostovan AA, Matthee JJ, Arrabal Haro P. 2021. The evolution of the UV luminosity and stellar mass functions of Lyman-;1 emitters from z c 2 to z c 6. Monthly Notices of the Royal Astronomical Society. 505(1), 1117–1134.
LibreCat: https://research-explorer.ista.ac.at/record/11524
DOI: 10.1093/mnras/stab1218
arXiv: 2105.00007

Bernstein A, Forster S, Henzinger MH. 2021. A deamortization approach for dynamic spanner and dynamic maximal matching. ACM Transactions on Algorithms. 17(4), 29.
LibreCat: https://research-explorer.ista.ac.at/record/11663
DOI: 10.1145/3469833
arXiv: 1810.10932

Henzinger MH, Peng P. 2021. Constant-time dynamic weight approximation for minimum spanning forest. Information and Computation. 281(12), 104805.
LibreCat: https://research-explorer.ista.ac.at/record/11756
DOI: 10.1016/j.ic.2021.104805
arXiv: 2011.00977

Henzinger MH, Wu X. 2021. Upper and lower bounds for fully retroactive graph problems. 17th International Symposium on Algorithms and Data Structures. WADS: Workshop on Algorithms and Data Structures, LNCS, vol. 12808, 471–484.
LibreCat: https://research-explorer.ista.ac.at/record/11771
DOI: 10.1007/978-3-030-83508-8_34
arXiv: 1910.03332

Fichtenberger H, Henzinger MH, Ost W. 2021. Differentially private algorithms for graphs under continual observation. 29th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 204, 42.
LibreCat: https://research-explorer.ista.ac.at/record/11814
DOI: 10.4230/LIPIcs.ESA.2021.42
arXiv: 2106.14756

Henzinger MH, Krinninger S, Nanongkai D. 2021. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. SIAM Journal on Computing. 50(3), STO-98-STO-137.
LibreCat: https://research-explorer.ista.ac.at/record/11886
DOI: 10.1137/16m1097808
arXiv: 1504.07056

Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. 2021. Dynamic set cover: Improved amortized and worst-case update time. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2537–2549.
LibreCat: https://research-explorer.ista.ac.at/record/11920
DOI: 10.1137/1.9781611976465.150
arXiv: 2002.11171

Truckenbrodt SM, Rizzoli SO. 2021.Simple multi-color super-resolution by  microscopy. In: Methods in Cell Biology. vol. 161, 33–56.
LibreCat: https://research-explorer.ista.ac.at/record/7941
DOI: 10.1016/bs.mcb.2020.04.016
PMID: 33478696

Nauman M, Kiem DH, Lee S, Son S, Park J-G, Kang W, Han MJ, Jo YJ. 2021. Complete mapping of magnetic anisotropy for prototype Ising van der Waals FeP. 2D Materials. 8(3), 035011.
LibreCat: https://research-explorer.ista.ac.at/record/9282
DOI: 10.1088/2053-1583/abeed3
arXiv: 2103.09029

Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2021. On compatible matchings. 15th International Conference on Algorithms and Computation. WALCOM: Algorithms and Computation, LNCS, vol. 12635, 221–233.
LibreCat: https://research-explorer.ista.ac.at/record/9296
DOI: 10.1007/978-3-030-68211-8_18
arXiv: 2101.03928

Walter M. 2021. The convergence of slide-type reductions. Public-Key Cryptography – PKC 2021. PKC: IACR International Conference on Practice and Theory of Public Key Cryptography, LNCS, vol. 12710, 45–67.
LibreCat: https://research-explorer.ista.ac.at/record/9466
DOI: 10.1007/978-3-030-75245-3_3

Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing game on the plane. Proceedings of the 33rd Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry.
LibreCat: https://research-explorer.ista.ac.at/record/9592
arXiv: 2106.11247

Volhejn V, Lampert C. 2021. Does SGD implicitly optimize for smoothness? 42nd German Conference on Pattern Recognition. DAGM GCPR: German Conference on Pattern Recognition LNCS vol. 12544, 246–259.
LibreCat: https://research-explorer.ista.ac.at/record/9210
DOI: 10.1007/978-3-030-71278-5_18

Edelsbrunner H, Heiss T,  Kurlin  V, Smith P, Wintraecken M. 2021. The density fingerprint of a periodic point set. 37th International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 189, 32:1-32:16.
LibreCat: https://research-explorer.ista.ac.at/record/9345
DOI: 10.4230/LIPIcs.SoCG.2021.32

Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2021. Counting cells of order-k voronoi tessellations in d<sup>3</sup> with morse theory. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 16.
LibreCat: https://research-explorer.ista.ac.at/record/9604
DOI: 10.4230/LIPIcs.SoCG.2021.16

Alistarh D-A, Davies P. 2021. Collecting coupons is faster with friends. Structural Information and Communication Complexity.  SIROCCO: International Colloquium on Structural Information and Communication Complexity, LNCS, vol. 12810, 3–12.
LibreCat: https://research-explorer.ista.ac.at/record/9620
DOI: 10.1007/978-3-030-79527-6_1

Auerbach B, Chakraborty S, Klein K, Pascual Perez G, Pietrzak KZ, Walter M, Yeo MX. 2021. Inverse-Sybil attacks in automated contact tracing. Topics in Cryptology – CT-RSA 2021. CT-RSA: Cryptographers’ Track at the RSA Conference, LNCS, vol. 12704, 399–421.
LibreCat: https://research-explorer.ista.ac.at/record/9826
DOI: 10.1007/978-3-030-75539-3_17

Laarhoven T, Walter M. 2021. Dual lattice attacks for closest vector problems (with preprocessing). Topics in Cryptology – CT-RSA 2021. CT-RSA: Cryptographers’ Track at the RSA Conference, LNCS, vol. 12704, 478–502.
LibreCat: https://research-explorer.ista.ac.at/record/9825
DOI: 10.1007/978-3-030-75539-3_20