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 JPK, Aparicio-Maldonado C, Nobrega FL, Brouns SJJ, Taylor DW. Structural basis for broad anti-phage immunity by DISARM. Nature Communications. 2022;13. doi: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 RE, Bravo JPK, Ramos D, Hibshman GN, Wright JT, Taylor DW. Modes of inhibition used by phage anti-CRISPRs to evade type I-C Cascade. bioRxiv. 2022. doi: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 JM, et al. Saturated reconstruction of living brain tissue. bioRxiv. doi: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 MH, Kale SS, Svozil A. Faster algorithms for bounded liveness in graphs and game graphs. In: 48th International Colloquium on Automata, Languages, and Programming. Vol 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.ICALP.2021.124
[Published Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 10072 |
Harris DG, Iliopoulos F, Kolmogorov V. A new notion of commutativity for the algorithmic Lovász Local Lemma. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Vol 207. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi: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. Brief announcement: Fast graphical population protocols. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi: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. Lower bounds for shared-memory leader election under bounded write contention. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi: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. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi: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. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi: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. Evaluation of gravitropism in non-seed plants. In: Blancaflor EB, ed. Plant Gravitropism. Vol 2368. MIMB. Springer Nature; 2021:43-51. doi: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. The Civl verifier. In: Ruzica P, Whalen MW, eds. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. Vol 2. TU Wien Academic Press; 2021:143–152. doi: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 IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:617-636. doi: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 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: 11663 |
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| Conference Paper | IST-REx-ID: 11919 |
Bergamaschi T, Henzinger MH, Gutenberg MP, Williams VV, Wein N. New techniques and fine-grained hardness for dynamic near-additive spanners. In: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:1836-1855. doi:10.1137/1.9781611976465.110
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11923 |
Henzinger MH, Neumann S, Räcke H, Schmid S. Tight bounds for online graph partitioning. In: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:2799-2818. doi:10.1137/1.9781611976465.166
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 11920 |
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: 9245
Xia P, Heisenberg C-PJ. Quantifying tissue tension in the granulosa layer after laser surgery. In: Dosch R, ed. Germline Development in the Zebrafish. Vol 2218. Humana; 2021:117-128. doi: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. 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