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 | 
Gallego, Sofia G., 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, 2021, pp. 16–32, doi:10.1093/mnras/stab796.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11522 |
Gronke, Max, 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, 2021, pp. 3697–709, doi:10.1093/mnras/stab2762.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11524 |
Santos, S., 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, 2021, pp. 1117–34, doi:10.1093/mnras/stab1218.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11663 |
Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” ACM Transactions on Algorithms, vol. 17, no. 4, 29, Association for Computing Machinery, 2021, doi:10.1145/3469833.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11756 |
Henzinger, Monika H., and Pan Peng. “Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest.” Information and Computation, vol. 281, no. 12, 104805, Elsevier, 2021, doi:10.1016/j.ic.2021.104805.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11771 |
Henzinger, Monika H., and Xiaowei Wu. “Upper and Lower Bounds for Fully Retroactive Graph Problems.” 17th International Symposium on Algorithms and Data Structures, vol. 12808, Springer Nature, 2021, pp. 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 |
Fichtenberger, Hendrik, et al. “Differentially Private Algorithms for Graphs under Continual Observation.” 29th Annual European Symposium on Algorithms, vol. 204, 42, 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 |
Henzinger, Monika H., et al. “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, 2021, pp. STOC16-98-STOC16-137, doi:10.1137/16m1097808.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11920 |
Bhattacharya, Sayan, et al. “Dynamic Set Cover: Improved Amortized and Worst-Case Update Time.” 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 2537–49, doi:10.1137/1.9781611976465.150.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Book Chapter | IST-REx-ID: 7941
Truckenbrodt, Sven M., and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution by X10 Microscopy.” Methods in Cell Biology, vol. 161, Elsevier, 2021, pp. 33–56, doi:10.1016/bs.mcb.2020.04.016.
View
| DOI
| PubMed | Europe PMC
2021 |Published| Journal Article | IST-REx-ID: 9282 |
Nauman, Muhammad, et al. “Complete Mapping of Magnetic Anisotropy for Prototype Ising van Der Waals FePS3.” 2D Materials, vol. 8, no. 3, 035011, IOP Publishing, 2021, doi:10.1088/2053-1583/abeed3.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 9296 |
Aichholzer, Oswin, et al. “On Compatible Matchings.” 15th International Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021, pp. 221–33, 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 |
Walter, Michael. “The Convergence of Slide-Type Reductions.” Public-Key Cryptography – PKC 2021, vol. 12710, Springer Nature, 2021, pp. 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 |
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.
[Submitted Version]
View
| Files available
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 9210 |
Volhejn, Vaclav, and Christoph Lampert. “Does SGD Implicitly Optimize for Smoothness?” 42nd German Conference on Pattern Recognition, vol. 12544, Springer, 2021, pp. 246–59, doi:10.1007/978-3-030-71278-5_18.
[Submitted Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 9604 |
Biswas, Ranita, et al. “Counting Cells of Order-k Voronoi Tessellations in ℝ3 with Morse Theory.” Leibniz International Proceedings in Informatics, vol. 189, 16, 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 |
Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” Structural Information and Communication Complexity, vol. 12810, Springer Nature, 2021, pp. 3–12, doi:10.1007/978-3-030-79527-6_1.
[Preprint]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 9826 |
Auerbach, Benedikt, et al. “Inverse-Sybil Attacks in Automated Contact Tracing.” Topics in Cryptology – CT-RSA 2021, vol. 12704, Springer Nature, 2021, pp. 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 |
Laarhoven, Thijs, and Michael Walter. “Dual Lattice Attacks for Closest Vector Problems (with Preprocessing).” Topics in Cryptology – CT-RSA 2021, vol. 12704, Springer Nature, 2021, pp. 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 |
Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.” Structural Information and Communication Complexity, vol. 12810, Springer Nature, 2021, pp. 87–105, doi:10.1007/978-3-030-79527-6_6.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv