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.

1790 Publications


2021 | Conference Paper | IST-REx-ID: 10054 | OA
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 | Conference Paper | IST-REx-ID: 10072 | OA
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 | Conference Paper | IST-REx-ID: 10075 | OA
Guha S, Jecker IR, Lehtinen K, Zimmermann M. A bit of nondeterminism makes pushdown automata expressive and succinct. In: 46th International Symposium on Mathematical Foundations of Computer Science. Vol 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.MFCS.2021.53
[Published Version] View | Files available | DOI | arXiv
 

2021 | Preprint | IST-REx-ID: 10174 | OA
Clozeau N, Gloria A. Quantitative nonlinear homogenization: control of oscillations. arXiv.
[Preprint] View | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10218 | OA
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 | Conference Paper | IST-REx-ID: 10217 | OA
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 | Conference Paper | IST-REx-ID: 10216 | OA
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 | Conference Paper | IST-REx-ID: 10219 | OA
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 | Conference Paper | IST-REx-ID: 10367 | OA
Ilharco C, Shirazi A, Gopalan A, et al. Recognizing multimodal entailment. In: 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts. Association for Computational Linguistics; 2021:29-30. doi:10.18653/v1/2021.acl-tutorials.6
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2021 | Book | IST-REx-ID: 10415
Browning TD. Cubic Forms and the Circle Method. Vol 343. Cham: Springer Nature; 2021. doi:10.1007/978-3-030-86872-7
View | DOI
 

2021 | Conference Paper | IST-REx-ID: 10630 | OA
Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection non-emptiness for star-free language classes. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 213. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.34
[Published Version] View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10629 | OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on product graphs of small treewidth. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.42
[Published Version] View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10688 | OA
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 | Conference Paper | IST-REx-ID: 10692 | OA
Polshyn H, Zhu J, Kumar M, et al. Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order. In: APS March Meeting 2021. Vol 66. American Physical Society; 2021.
[Published Version] View | Download Published Version (ext.)
 

2021 | Conference Paper | IST-REx-ID: 10847 | OA
Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. Solving partially observable stochastic shortest-path games. In: 30th International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence; 2021:4182-4189. doi:10.24963/ijcai.2021/575
[Published Version] View | DOI | Download Published Version (ext.)
 

2021 | Conference Paper | IST-REx-ID: 11463 | OA
Frantar E, Kurtic E, Alistarh D-A. M-FAC: Efficient matrix-free approximations of second-order information. In: 35th Conference on Neural Information Processing Systems. Vol 34. Curran Associates; 2021:14873-14886.
[Published Version] View | Download Published Version (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 11498 | OA
Schmidt KB, Kerutt J, Wisotzki L, et al. Recovery and analysis of rest-frame UV emission lines in 2052 galaxies observed with MUSE at 1.5 < z < 6.4. Astronomy & Astrophysics. 2021;654. doi:10.1051/0004-6361/202140876
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2021 | 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 | Journal Article | IST-REx-ID: 11512 | OA
Boogaard LA, Bouwens RJ, Riechers D, et al. Measuring the average molecular gas content of star-forming galaxies at z = 3–4. The Astrophysical Journal. 2021;916(1). doi:10.3847/1538-4357/ac01d7
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 11525 | OA
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
 

Filters and Search Terms

isbn%3D978-3-642-40707-9

Search

Filter Publications