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 | 
S. G. Gallego et al., “Constraining the cosmic UV background at z > 3 with MUSE Lyman-α emission observations,” Monthly Notices of the Royal Astronomical Society, vol. 504, no. 1. Oxford University Press, pp. 16–32, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11522 |
M. Gronke et al., “Lyman-α transmission properties of the intergalactic medium in the CoDaII simulation,” Monthly Notices of the Royal Astronomical Society, vol. 508, no. 3. Oxford University Press, pp. 3697–3709, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11524 |
S. Santos 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, vol. 505, no. 1. Oxford University Press, pp. 1117–1134, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11663 |
A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” ACM Transactions on Algorithms, vol. 17, no. 4. Association for Computing Machinery, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11756 |
M. H. Henzinger and P. Peng, “Constant-time dynamic weight approximation for minimum spanning forest,” Information and Computation, vol. 281, no. 12. Elsevier, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11771 |
M. H. Henzinger and X. Wu, “Upper and lower bounds for fully retroactive graph problems,” in 17th International Symposium on Algorithms and Data Structures, Virtual, 2021, vol. 12808, pp. 471–484.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11814 |
H. Fichtenberger, M. H. Henzinger, and W. Ost, “Differentially private algorithms for graphs under continual observation,” in 29th Annual European Symposium on Algorithms, Lisbon, Portual, 2021, vol. 204.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11886 |
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A deterministic almost-tight distributed algorithm for approximating single-source shortest paths,” SIAM Journal on Computing, vol. 50, no. 3. Society for Industrial & Applied Mathematics, pp. STOC16-98-STOC16-137, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11920 |
S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and X. Wu, “Dynamic set cover: Improved amortized and worst-case update time,” in 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2021, pp. 2537–2549.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Book Chapter | IST-REx-ID: 7941
S. M. Truckenbrodt and S. O. Rizzoli, “Simple multi-color super-resolution by X10 microscopy,” in Methods in Cell Biology, vol. 161, Elsevier, 2021, pp. 33–56.
View
| DOI
| PubMed | Europe PMC
2021 |Published| Journal Article | IST-REx-ID: 9282 |
M. Nauman et al., “Complete mapping of magnetic anisotropy for prototype Ising van der Waals FePS3,” 2D Materials, vol. 8, no. 3. IOP Publishing, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 9296 |
O. Aichholzer et al., “On compatible matchings,” in 15th International Conference on Algorithms and Computation, Yangon, Myanmar, 2021, vol. 12635, pp. 221–233.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 9466 |
M. Walter, “The convergence of slide-type reductions,” in Public-Key Cryptography – PKC 2021, Virtual, 2021, vol. 12710, pp. 45–67.
[Published Version]
View
| Files available
| DOI
2021 |Accepted| Conference Paper | IST-REx-ID: 9592 |
M. Dvorak and S. Nicholson, “Massively winning configurations in the convex grabbing game on the plane,” in Proceedings of the 33rd Canadian Conference on Computational Geometry, Halifax, NS, Canada.
[Submitted Version]
View
| Files available
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 9210 |
V. Volhejn and C. Lampert, “Does SGD implicitly optimize for smoothness?,” in 42nd German Conference on Pattern Recognition, Tübingen, Germany, 2021, vol. 12544, pp. 246–259.
[Submitted Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 9604 |
R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Counting cells of order-k voronoi tessellations in ℝ3 with morse theory,” in Leibniz International Proceedings in Informatics, Online, 2021, vol. 189.
[Published Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 9620 |
D.-A. Alistarh and P. Davies, “Collecting coupons is faster with friends,” in Structural Information and Communication Complexity, Wrocław, Poland, 2021, vol. 12810, pp. 3–12.
[Preprint]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 9826 |
B. Auerbach et al., “Inverse-Sybil attacks in automated contact tracing,” in Topics in Cryptology – CT-RSA 2021, Virtual Event, 2021, vol. 12704, pp. 399–421.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2021 |Published| Conference Paper | IST-REx-ID: 9825 |
T. Laarhoven and M. Walter, “Dual lattice attacks for closest vector problems (with preprocessing),” in Topics in Cryptology – CT-RSA 2021, Virtual Event, 2021, vol. 12704, pp. 478–502.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2021 |Published| Conference Paper | IST-REx-ID: 9823 |
D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” in Structural Information and Communication Complexity, Wrocław, Poland, 2021, vol. 12810, pp. 87–105.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv