Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
1850 Publications
2021 |Published| Journal Article | IST-REx-ID: 11525 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Gallego SG, Cantalupo S, Sarpas S, et al. Constraining the cosmic UV background at z > 3 with MUSE Lyman-α emission observations. Monthly Notices of the Royal Astronomical Society. 2021;504(1):16-32. doi:10.1093/mnras/stab796
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11522 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Gronke M, Ocvirk P, Mason C, et al. Lyman-α transmission properties of the intergalactic medium in the CoDaII simulation. Monthly Notices of the Royal Astronomical Society. 2021;508(3):3697-3709. doi:10.1093/mnras/stab2762
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11524 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Santos S, Sobral D, Butterworth J, et al. The evolution of the UV luminosity and stellar mass functions of Lyman-α emitters from z ∼ 2 to z ∼ 6. Monthly Notices of the Royal Astronomical Society. 2021;505(1):1117-1134. doi:10.1093/mnras/stab1218
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11663 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic spanner and dynamic maximal matching. ACM Transactions on Algorithms. 2021;17(4). doi:10.1145/3469833
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11756 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Henzinger MH, Peng P. Constant-time dynamic weight approximation for minimum spanning forest. Information and Computation. 2021;281(12). doi:10.1016/j.ic.2021.104805
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11771 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Henzinger MH, Wu X. Upper and lower bounds for fully retroactive graph problems. In: 17th International Symposium on Algorithms and Data Structures. Vol 12808. Springer Nature; 2021:471–484. doi:10.1007/978-3-030-83508-8_34
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11814 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Fichtenberger H, Henzinger MH, Ost W. Differentially private algorithms for graphs under continual observation. In: 29th Annual European Symposium on Algorithms. Vol 204. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.ESA.2021.42
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11886 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Henzinger MH, Krinninger S, Nanongkai D. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. SIAM Journal on Computing. 2021;50(3):STOC16-98-STOC16-137. doi:10.1137/16m1097808
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11920 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. Dynamic set cover: Improved amortized and worst-case update time. In: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:2537-2549. doi:10.1137/1.9781611976465.150
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Book Chapter | IST-REx-ID: 7941
Truckenbrodt SM, Rizzoli SO. Simple multi-color super-resolution by X10 microscopy. In: Methods in Cell Biology. Vol 161. Elsevier; 2021:33-56. doi:10.1016/bs.mcb.2020.04.016
View
| DOI
| PubMed | Europe PMC
2021 |Published| Journal Article | IST-REx-ID: 9282 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Nauman M, Kiem DH, Lee S, et al. Complete mapping of magnetic anisotropy for prototype Ising van der Waals FePS3. 2D Materials. 2021;8(3). doi:10.1088/2053-1583/abeed3
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 9296 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. In: 15th International Conference on Algorithms and Computation. Vol 12635. Springer Nature; 2021:221-233. doi:10.1007/978-3-030-68211-8_18
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 9466 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Walter M. The convergence of slide-type reductions. In: Public-Key Cryptography – PKC 2021. Vol 12710. Springer Nature; 2021:45-67. doi:10.1007/978-3-030-75245-3_3
[Published Version]
View
| Files available
| DOI
2021 |Accepted| Conference Paper | IST-REx-ID: 9592 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing game on the plane. In: Proceedings of the 33rd Canadian Conference on Computational Geometry.
[Submitted Version]
View
| Files available
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 9210 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Volhejn V, Lampert C. Does SGD implicitly optimize for smoothness? In: 42nd German Conference on Pattern Recognition. Vol 12544. LNCS. Springer; 2021:246-259. doi:10.1007/978-3-030-71278-5_18
[Submitted Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 9604 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Counting cells of order-k voronoi tessellations in ℝ3 with morse theory. In: Leibniz International Proceedings in Informatics. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.SoCG.2021.16
[Published Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 9620 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Alistarh D-A, Davies P. Collecting coupons is faster with friends. In: Structural Information and Communication Complexity. Vol 12810. Springer Nature; 2021:3-12. doi:10.1007/978-3-030-79527-6_1
[Preprint]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 9826 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Auerbach B, Chakraborty S, Klein K, et al. Inverse-Sybil attacks in automated contact tracing. In: Topics in Cryptology – CT-RSA 2021. Vol 12704. Springer Nature; 2021:399-421. doi:10.1007/978-3-030-75539-3_17
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2021 |Published| Conference Paper | IST-REx-ID: 9825 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Laarhoven T, Walter M. Dual lattice attacks for closest vector problems (with preprocessing). In: Topics in Cryptology – CT-RSA 2021. Vol 12704. Springer Nature; 2021:478-502. doi:10.1007/978-3-030-75539-3_20
[Preprint]
View
| DOI
| Download Preprint (ext.)
2021 |Published| Conference Paper | IST-REx-ID: 9823 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Alistarh D-A, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. In: Structural Information and Communication Complexity. Vol 12810. Springer Nature; 2021:87-105. doi:10.1007/978-3-030-79527-6_6
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv