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 | OA
Bravo JPK, Aparicio-Maldonado C, Nobrega FL, Brouns SJJ, Taylor DW. 2022. Structural basis for broad anti-phage immunity by DISARM. Nature Communications. 13, 2987.
[Published Version] View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 

2022 |Published| Preprint | IST-REx-ID: 17115 | OA
O’Brien RE, Bravo JPK, Ramos D, Hibshman GN, Wright JT, Taylor DW. 2022. Modes of inhibition used by phage anti-CRISPRs to evade type I-C Cascade. bioRxiv, 10.1101/2022.06.15.496202.
[Preprint] View | DOI | Download Preprint (ext.)
 

2022 |Submitted| Preprint | IST-REx-ID: 11943 | OA
Velicky P, Miguel Villalba E, Michalska JM, Wei D, Lin Z, Watson J, Troidl J, Beyer J, Ben Simon Y, Sommer CM, Jahr W, Cenameri A, Broichhagen J, Grant SGN, Jonas PM, Novarino G, Pfister H, Bickel B, Danzl JG. Saturated reconstruction of living brain tissue. bioRxiv, 10.1101/2022.03.16.484431.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2021 |Published| Conference Paper | IST-REx-ID: 10054 | OA
Chatterjee K, Henzinger MH, Kale SS, Svozil A. 2021. Faster algorithms for bounded liveness in graphs and game graphs. 48th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 198, 124.
[Published Version] View | Files available | DOI
 

2021 |Published| Conference Paper | IST-REx-ID: 10072 | OA
Harris DG, Iliopoulos F, Kolmogorov V. 2021. A new notion of commutativity for the algorithmic Lovász Local Lemma. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/ Randomization and Computation, LIPIcs, vol. 207, 31.
[Published Version] View | Files available | DOI | arXiv
 

2021 |Published| Conference Paper | IST-REx-ID: 10218 | OA
Alistarh D-A, Gelashvili R, Rybicki J. 2021. Brief announcement: Fast graphical population protocols. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 43.
[Published Version] View | Files available | DOI | arXiv
 

2021 |Published| Conference Paper | IST-REx-ID: 10217 | OA
Alistarh D-A, Gelashvili R, Nadiradze G. 2021. Lower bounds for shared-memory leader election under bounded write contention. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 4.
[Published Version] View | Files available | DOI
 

2021 |Published| Conference Paper | IST-REx-ID: 10216 | OA
Chatterjee B, Peri S, Sa M. 2021. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 52.
[Published Version] View | Files available | DOI | arXiv
 

2021 |Published| Conference Paper | IST-REx-ID: 10219 | OA
Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. 2021. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 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: Plant Gravitropism. Methods in Molecular Biology, vol. 2368, 43–51.
View | DOI | PubMed | Europe PMC
 

2021 |Published| Conference Paper | IST-REx-ID: 10688 | OA
Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, Conference Series, vol. 2, 143–152.
[Published Version] View | Files available | DOI
 

2021 |Published| Conference Paper | IST-REx-ID: 10694 | OA
Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 |Published| Journal Article | IST-REx-ID: 11500 | OA
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 | OA
Gallego SG, Cantalupo S, Sarpas S, Duboeuf B, Lilly S, Pezzulli G, Marino RA, Matthee JJ, Wisotzki L, Schaye J, Richard J, Kusakabe H, Mauerhofer V. 2021. Constraining the cosmic UV background at z > 3 with MUSE Lyman-α emission observations. Monthly Notices of the Royal Astronomical Society. 504(1), 16–32.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 |Published| Journal Article | IST-REx-ID: 11663 | OA
Bernstein A, Forster S, Henzinger MH. 2021. A deamortization approach for dynamic spanner and dynamic maximal matching. ACM Transactions on Algorithms. 17(4), 29.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 |Published| Conference Paper | IST-REx-ID: 11919 | OA
Bergamaschi T, Henzinger MH, Gutenberg MP, Williams VV, Wein N. 2021. New techniques and fine-grained hardness for dynamic near-additive spanners. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1836–1855.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 |Published| Conference Paper | IST-REx-ID: 11923 | OA
Henzinger MH, Neumann S, Räcke H, Schmid S. 2021. Tight bounds for online graph partitioning. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2799–2818.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 |Published| Conference Paper | IST-REx-ID: 11920 | OA
Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. 2021. Dynamic set cover: Improved amortized and worst-case update time. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2537–2549.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 |Published| Book Chapter | IST-REx-ID: 9245
Xia P, Heisenberg C-PJ. 2021.Quantifying tissue tension in the granulosa layer after laser surgery. In: Germline Development in the Zebrafish. Methods in Molecular Biology, vol. 2218, 117–128.
View | DOI | PubMed | Europe PMC
 

2021 |Published| Conference Paper | IST-REx-ID: 9604 | OA
Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2021. Counting cells of order-k voronoi tessellations in ℝ3 with morse theory. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 16.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

isbn%3D978-973-703-602-5

Search

Filter Publications