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.
513 Publications
2022 |Published| Journal Article | IST-REx-ID: 15133 | 
Bravo, J. P. K., Aparicio-Maldonado, C., Nobrega, F. L., Brouns, S. J. J., & Taylor, D. W. (2022). Structural basis for broad anti-phage immunity by DISARM. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-022-30673-1
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
2022 |Published| Preprint | IST-REx-ID: 17115 |
O’Brien, R. E., Bravo, J. P. K., Ramos, D., Hibshman, G. N., Wright, J. T., & Taylor, D. W. (2022). Modes of inhibition used by phage anti-CRISPRs to evade type I-C Cascade. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2022.06.15.496202
[Preprint]
View
| DOI
| Download Preprint (ext.)
2022 |Submitted| Preprint | IST-REx-ID: 11943 |
Velicky, P., Miguel Villalba, E., Michalska, J. M., Wei, D., Lin, Z., Watson, J., … Danzl, J. G. (n.d.). Saturated reconstruction of living brain tissue. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2022.03.16.484431
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2021 |Published| Conference Paper | IST-REx-ID: 10054 |
Chatterjee, K., Henzinger, M. H., Kale, S. S., & Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In 48th International Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2021.124
[Published Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 10072 |
Harris, D. G., Iliopoulos, F., & Kolmogorov, V. (2021). A new notion of commutativity for the algorithmic Lovász Local Lemma. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Vol. 207). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10218 |
Alistarh, D.-A., Gelashvili, R., & Rybicki, J. (2021). Brief announcement: Fast graphical population protocols. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2021.43
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10217 |
Alistarh, D.-A., Gelashvili, R., & Nadiradze, G. (2021). Lower bounds for shared-memory leader election under bounded write contention. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2021.4
[Published Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 10216 |
Chatterjee, B., Peri, S., & Sa, M. (2021). Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2021.52
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10219 |
Korhonen, J., Paz, A., Rybicki, J., Schmid, S., & Suomela, J. (2021). Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2021.58
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Book Chapter | IST-REx-ID: 10267
Zhang, Y., Li, L., & Friml, J. (2021). Evaluation of gravitropism in non-seed plants. In E. B. Blancaflor (Ed.), Plant Gravitropism (Vol. 2368, pp. 43–51). Springer Nature. https://doi.org/10.1007/978-1-0716-1677-2_2
View
| DOI
| PubMed | Europe PMC
2021 |Published| Conference Paper | IST-REx-ID: 10688 |
Kragl, B., & Qadeer, S. (2021). The Civl verifier. In P. Ruzica & M. W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23
[Published Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 10694 |
Avni, G., Jecker, I. R., & Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.38
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11500 |
Bacon R, Mary D, Garel T, Blaizot J, Maseda M, Schaye J, Wisotzki L, Conseil S, Brinchmann J, Leclercq F, Abril-Melgarejo V, Boogaard L, Bouché NF, Contini T, Feltre A, Guiderdoni B, Herenz C, Kollatschny W, Kusakabe H, Matthee JJ, Michel-Dansac L, Nanayakkara T, Richard J, Roth M, Schmidt KB, Steinmetz M, Tresse L, Urrutia T, Verhamme A, Weilbacher PM, Zabl J, Zoutendijk SL. 2021. The MUSE Extremely Deep Field: The cosmic web in emission at high redshift. Astronomy & Astrophysics. 647, A107.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11525 |
Gallego, S. G., Cantalupo, S., Sarpas, S., Duboeuf, B., Lilly, S., Pezzulli, G., … Mauerhofer, V. (2021). Constraining the cosmic UV background at z > 3 with MUSE Lyman-α emission observations. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stab796
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 11663 |
Bernstein, A., Forster, S., & Henzinger, M. H. (2021). A deamortization approach for dynamic spanner and dynamic maximal matching. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3469833
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11919 |
Bergamaschi, T., Henzinger, M. H., Gutenberg, M. P., Williams, V. V., & Wein, N. (2021). New techniques and fine-grained hardness for dynamic near-additive spanners. In 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1836–1855). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.110
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11923 |
Henzinger, M. H., Neumann, S., Räcke, H., & Schmid, S. (2021). Tight bounds for online graph partitioning. In 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2799–2818). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.166
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11920 |
Bhattacharya, S., Henzinger, M. H., Nanongkai, D., & Wu, X. (2021). Dynamic set cover: Improved amortized and worst-case update time. In 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2537–2549). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.150
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Book Chapter | IST-REx-ID: 9245
Xia, P., & Heisenberg, C.-P. J. (2021). Quantifying tissue tension in the granulosa layer after laser surgery. In R. Dosch (Ed.), Germline Development in the Zebrafish (Vol. 2218, pp. 117–128). Humana. https://doi.org/10.1007/978-1-0716-0970-5_10
View
| DOI
| PubMed | Europe PMC
2021 |Published| Conference Paper | IST-REx-ID: 9604 |
Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., & Saghafian, M. (2021). Counting cells of order-k voronoi tessellations in ℝ3 with morse theory. In Leibniz International Proceedings in Informatics (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.16
[Published Version]
View
| Files available
| DOI