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
2019 |Published| Journal Article | IST-REx-ID: 11535 | 
A. A. Khostovan et al., “The clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities,” Monthly Notices of the Royal Astronomical Society, vol. 489, no. 1. Oxford University Press, pp. 555–573, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 11616 |
Huber D et al. 2019. A hot Saturn orbiting an oscillating late subgiant discovered by TESS. The Astronomical Journal. 157(6), 245.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 11826 |
B. Ancona, M. H. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms and hardness for diameter in dynamic graphs,” in 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 11850 |
M. H. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload (re-)embedding,” in SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Phoenix, AZ, United States, 2019, pp. 43–44.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 11853 |
S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm for dynamic set cover,” in 60th Annual Symposium on Foundations of Computer Science, Baltimore, MD, United States, 2019, pp. 406–423.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 11851
M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory exact minimum cuts,” in 33rd International Parallel and Distributed Processing Symposium, Rio de Janeiro, Brazil, 2019.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 11871 |
A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” in 30th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2019, pp. 1899–1918.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 11984 |
M. Guberman, B. Pieber, and P. H. Seeberger, “Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks,” Organic Process Research and Development, vol. 23, no. 12. American Chemical Society, pp. 2764–2770, 2019.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2019 |Published| Journal Article | IST-REx-ID: 170 |
T. D. Browning and E. Sofos, “Counting rational points on quartic del Pezzo surfaces with a rational conic,” Mathematische Annalen, vol. 373, no. 3–4. Springer Nature, pp. 977–1016, 2019.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6163
R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Rhombic dodecahedron grid—coordinate system and 3D digital object definitions,” in 21st IAPR International Conference on Discrete Geometry for Computer Imagery, Marne-la-Vallée, France, 2019, vol. 11414, pp. 27–37.
View
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 6528 |
K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2019 |Published| Journal Article | IST-REx-ID: 6672 |
J.-D. Boissonnat, M. Rouxel-Labbé, and M. Wintraecken, “Anisotropic triangulations via discrete Riemannian Voronoi diagrams,” SIAM Journal on Computing, vol. 48, no. 3. Society for Industrial & Applied Mathematics (SIAM), pp. 1046–1097, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6725 |
V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Book Chapter | IST-REx-ID: 6726 |
M. Walter, “Sampling the integers with low relative error,” in Progress in Cryptology – AFRICACRYPT 2019, vol. 11627, J. Buchmann, A. Nitaj, and T. Rachidi, Eds. Cham: Springer Nature, 2019, pp. 157–180.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2019 |Published| Journal Article | IST-REx-ID: 6663 |
M. Mondelli, H. Hassani, and R. Urbanke, “Construction of polar codes with sublinear complexity,” IEEE, vol. 65, no. 5. IEEE, pp. 2782–2791, 2019.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6822 |
G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.
[Submitted Version]
View
| Files available
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 6931 |
T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 7150 |
K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, and J. Suomela, “Algebraic methods in the congested clique,” Distributed Computing, vol. 32, no. 6. Springer Nature, pp. 461–478, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Book (Editor) | IST-REx-ID: 7171
K. Kersting, C. Lampert, and C. Rothkopf, Eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed. Wiesbaden: Springer Nature, 2019.
View
| Files available
| DOI