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 |Published| Conference Paper | IST-REx-ID: 10217 | OA
D.-A. Alistarh, R. Gelashvili, and G. Nadiradze, “Lower bounds for shared-memory leader election under bounded write contention,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version] View | Files available | DOI
 

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

2021 |Published| Conference Paper | IST-REx-ID: 10219 | OA
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, and J. Suomela, “Brief announcement: Sinkless orientation is hard also in the supported LOCAL model,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version] View | Files available | DOI | arXiv
 

2021 |Published| Conference Paper | IST-REx-ID: 10367 | OA
C. Ilharco 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, Bangkok, Thailand, 2021, pp. 29–30.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2021 |Published| Book | IST-REx-ID: 10415
T. D. Browning, Cubic Forms and the Circle Method, vol. 343. Cham: Springer Nature, 2021.
View | DOI
 

2021 |Published| Conference Paper | IST-REx-ID: 10630 | OA
E. Arrighi 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, Virtual, 2021, vol. 213.
[Published Version] View | Files available | DOI | arXiv
 

2021 |Published| Conference Paper | IST-REx-ID: 10629 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
[Published Version] View | Files available | DOI
 

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

2021 | Conference Paper | IST-REx-ID: 10692 | OA
H. Polshyn et al., “Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order,” in APS March Meeting 2021, Virtual, 2021, vol. 66, no. 1.
[Published Version] View | Download Published Version (ext.)
 

2021 |Published| Conference Paper | IST-REx-ID: 10847 | OA
P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in 30th International Joint Conference on Artificial Intelligence, Virtual, Online, 2021, pp. 4182–4189.
[Published Version] View | DOI | Download Published Version (ext.)
 

2021 |Published| Conference Paper | IST-REx-ID: 11463 | OA
E. Frantar, E. Kurtic, and D.-A. Alistarh, “M-FAC: Efficient matrix-free approximations of second-order information,” in 35th Conference on Neural Information Processing Systems, Virtual, Online, 2021, vol. 34, pp. 14873–14886.
[Published Version] View | Download Published Version (ext.) | arXiv
 

2021 |Published| Journal Article | IST-REx-ID: 11498 | OA
K. B. Schmidt 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, vol. 654. EDP Sciences, 2021.
[Published Version] View | DOI | Download Published Version (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: 11512 | OA
L. A. Boogaard et al., “Measuring the average molecular gas content of star-forming galaxies at z = 3–4,” The Astrophysical Journal, vol. 916, no. 1. IOP Publishing, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 |Published| Journal Article | IST-REx-ID: 11525 | OA
S. G. Gallego et al., “Constraining the cosmic UV background at z > 3 with MUSE Lyman-α emission observations,” Monthly Notices of the Royal Astronomical Society, vol. 504, no. 1. Oxford University Press, pp. 16–32, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 |Published| Journal Article | IST-REx-ID: 11522 | OA
M. Gronke et al., “Lyman-α transmission properties of the intergalactic medium in the CoDaII simulation,” Monthly Notices of the Royal Astronomical Society, vol. 508, no. 3. Oxford University Press, pp. 3697–3709, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 |Published| Journal Article | IST-REx-ID: 11663 | OA
A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” ACM Transactions on Algorithms, vol. 17, no. 4. Association for Computing Machinery, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 |Published| Journal Article | IST-REx-ID: 11756 | OA
M. H. Henzinger and P. Peng, “Constant-time dynamic weight approximation for minimum spanning forest,” Information and Computation, vol. 281, no. 12. Elsevier, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 |Published| Conference Paper | IST-REx-ID: 11771 | OA
M. H. Henzinger and X. Wu, “Upper and lower bounds for fully retroactive graph problems,” in 17th International Symposium on Algorithms and Data Structures, Virtual, 2021, vol. 12808, pp. 471–484.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 |Published| Conference Paper | IST-REx-ID: 11814 | OA
H. Fichtenberger, M. H. Henzinger, and W. Ost, “Differentially private algorithms for graphs under continual observation,” in 29th Annual European Symposium on Algorithms, Lisbon, Portual, 2021, vol. 204.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

Filters and Search Terms

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

Search

Filter Publications