Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
6079 Publications
2024 | Published | Journal Article | IST-REx-ID: 12846 | 
Chern A, Ishida S. Area formula for spherical polygons via prequantization. SIAM Journal on Applied Algebra and Geometry. 2024;8(3):782-796. doi:10.1137/23M1565255
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2024 | Draft | Preprint | IST-REx-ID: 17361 |
Bauer M, Ishida S, Michor PW. Symplectic structures on the space of space curves. arXiv. doi:10.48550/arXiv.2407.19908
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 17377 |
Wójcikowska B, Friml J, Mazur E. BiAux, a newly discovered compound triggering auxin signaling. Trends in Plant Science. 2024;29(12):1279-1281. doi:10.1016/j.tplants.2024.07.008
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2024 | Published | Journal Article | IST-REx-ID: 18525 |
Ruzickova N, Hledik M, Tkačik G. Quantitative omnigenic model discovers interpretable genome-wide associations. Proceedings of the National Academy of Sciences of the United States of America. 2024;121(44). doi:10.1073/pnas.2402340121
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2024 | Draft | Preprint | IST-REx-ID: 20701 |
Hoffmann C, Hubáček P, Ivanova S. Practical batch proofs of exponentiation. Cryptology ePrint Archive.
[Preprint]
View
| Files available
| Download Preprint (ext.)
2024 | Draft | Preprint | IST-REx-ID: 17353 |
Brigati G, Pedrotti F. Heat flow, log-concavity, and Lipschitz transport maps. arXiv. doi:10.48550/arXiv.2404.15205
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17146 |
Edelsbrunner H, Pach J. Maximum Betti numbers of Čech complexes. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.SoCG.2024.53
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17099 |
Asadi A, Chatterjee K, Saona Urmeneta RJ, Svoboda J. Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms. In: 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 323. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.FSTTCS.2024.5
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15006 |
Hirvonen J, Schmid L, Chatterjee K, Schmid S. On the convergence time in graphical games: A locality-sensitive approach. In: 27th International Conference on Principles of Distributed Systems. Vol 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.OPODIS.2023.11
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15007 |
Alpos O, Amores-Sesar I, Cachin C, Yeo MX. Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. In: 27th International Conference on Principles of Distributed Systems. Vol 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.OPODIS.2023.12
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 17302 |
van Tiel M, Aubry-Wake C, Somers L, Andermann C, Avanzi F, Baraer M, Chiogna G, Daigre C, Das S, Drenkhan F, Farinotti D, Fyffe CL, de Graaf I, Hanus S, Immerzeel W, Koch F, McKenzie JM, Müller T, Popp AL, Saidaliyeva Z, Schaefli B, Schilling OS, Teagai K, Thornton JM, Yapiyev V. 2024. Cryosphere–groundwater connectivity is a missing link in the mountain water cycle. Nature Water. 2, 624–637.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2024 | Published | Conference Paper | IST-REx-ID: 18066 |
Avni G, Goharshady EK, Henzinger TA, Mallik K. Bidding games with charging. In: 35th International Conference on Concurrency Theory. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.CONCUR.2024.8
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17327 |
Cano F, Henzinger TA, Könighofer B, Kueffner K, Mallik K. Abstraction-based decision making for statistical properties. In: 9th International Conference on Formal Structures for Computation and Deduction. Vol 299. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.FSCD.2024.2
[Published Version]
View
| Files available
| DOI
| WoS
2024 | Published | Conference Paper | IST-REx-ID: 18156 |
Henzinger M, Sricharan AR, Steiner TA. Private counting of distinct elements in the turnstile model and extensions. In: International Conference on Approximation Algorithms for Combinatorial Optimization Problems . Vol 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.APPROX/RANDOM.2024.40
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18067 |
Boker U, Henzinger TA, Lehtinen K, Prakash A. History-determinism vs fair simulation. In: 35th International Conference on Concurrency Theory. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.CONCUR.2024.12
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18308 |
La Tour MD, Henzinger M, Saulpic D. Fully dynamic k-means coreset in near-optimal update time. In: 32nd Annual European Symposium on Algorithms. Vol 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.ESA.2024.100
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18068 |
Henzinger TA, Mazzocchi NA, Sarac NE. Strategic dominance: A new preorder for nondeterministic processes. In: 35th International Conference on Concurrency Theory. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.CONCUR.2024.29
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18556 |
Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. The Euclidean MST-ratio for bi-colored lattices. In: 32nd International Symposium on Graph Drawing and Network Visualization. Vol 320. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.GD.2024.3
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18309 |
Hu B, Kosinas E, Polak A. Connectivity oracles for predictable vertex failures. In: 32nd Annual European Symposium on Algorithms. Vol 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.ESA.2024.72
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18557 |
El-Hayek A, Henzinger M, Schmid S. Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In: 38th International Symposium on Distributed Computing. Vol 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.DISC.2024.21
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv