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.
5849 Publications
2022 | Journal Article | IST-REx-ID: 11638 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Ngampruetikorn V, Sachdeva V, Torrence J, Humplik J, Schwab DJ, Palmer SE. Inferring couplings in networks across order-disorder phase transitions. Physical Review Research. 2022;4(2). doi:10.1103/PhysRevResearch.4.023240
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Journal Article | IST-REx-ID: 11702 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Barton NH. The “New Synthesis.” Proceedings of the National Academy of Sciences of the United States of America. 2022;119(30). doi:10.1073/pnas.2122147119
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2022 | Journal Article | IST-REx-ID: 11713 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Nikolic N, Sauert M, Albanese TG, Moll I. Quantifying heterologous gene expression during ectopic MazF production in Escherichia coli. BMC Research Notes. 2022;15. doi:10.1186/s13104-022-06061-9
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2022 | Conference Paper | IST-REx-ID: 11812 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Hanauer K, Henzinger MH, Hua QC. Fully dynamic four-vertex subgraph counting. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.SAND.2022.18
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 11808 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Hanauer K, Henzinger MH, Schulz C. Recent advances in fully dynamic graph algorithms. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.SAND.2022.1
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2022 | Journal Article | IST-REx-ID: 11916 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Wirth M. Kac regularity and domination of quadratic forms. Advances in Operator Theory. 2022;7(3). doi:10.1007/s43036-022-00199-w
[Published Version]
View
| Files available
| DOI
2022 | Conference Paper | IST-REx-ID: 11930 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Henzinger MH, Noe A, Schulz C. Practical fully dynamic minimum cut algorithms. In: 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments. Society for Industrial and Applied Mathematics; 2022:13-26. doi:10.1137/1.9781611977042.2
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Journal Article | IST-REx-ID: 11955 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Traxler M, Gisbertz S, Pachfule P, et al. Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling. Angewandte Chemie International Edition. 2022;61(21). doi:10.1002/anie.202117738
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
2022 | Journal Article | IST-REx-ID: 11991 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Krokhin A, Opršal J. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 2022;9(3):30-59. doi:10.1145/3559736.3559740
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 12010 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Brunnbauer A, Berducci L, Brandstatter A, et al. Latent imagination facilitates zero-shot transfer in autonomous racing. In: 2022 International Conference on Robotics and Automation. IEEE; 2022:7513-7520. doi:10.1109/ICRA46639.2022.9811650
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Journal Article | IST-REx-ID: 12007 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
GOSWAMI BB, An S-I, Murtugudde R. Role of the Tibetan plateau glaciers in the Asian summer monsoon. Climatic Change. 2022;173(3-4). doi:10.1007/s10584-022-03426-8
[Published Version]
View
| Files available
| DOI
2022 | Conference Paper | IST-REx-ID: 12011 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Zhang Y, Jaggi S, Langberg M, Sarwate AD. The capacity of causal adversarial channels. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. IEEE; 2022:2523-2528. doi:10.1109/ISIT50566.2022.9834709
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 12016 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Fathollahi D, Mondelli M. Polar coded computing: The role of the scaling exponent. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. IEEE; 2022:2154-2159. doi:10.1109/ISIT50566.2022.9834712
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 12012 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Torkamani S, Ebrahimi JB, Sadeghi P, D’Oliveira RGL, Médard M. Heterogeneous differential privacy via graphs. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. IEEE; 2022:1623-1628. doi:10.1109/ISIT50566.2022.9834711
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Thesis | IST-REx-ID: 12072 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Shute AL. Existence and density problems in Diophantine geometry: From norm forms to Campana points. 2022. doi:10.15479/at:ista:12072
[Published Version]
View
| Files available
| DOI
2022 | Conference Paper | IST-REx-ID: 12102 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. Algorithms and hardness results for computing cores of Markov chains. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.29
[Published Version]
View
| Files available
| DOI
2022 | Conference Paper | IST-REx-ID: 12101 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Complexity of spatial games. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.11
[Published Version]
View
| Files available
| DOI
2022 | Journal Article | IST-REx-ID: 12111 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Stocker L, Sack S, Ferguson MS, Zilberberg O. Entanglement-based observables for quantum impurities. Physical Review Research. 2022;4(4). doi:10.1103/PhysRevResearch.4.043177
[Published Version]
View
| Files available
| DOI
2022 | Conference Paper | IST-REx-ID: 12135 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chen B, Piovarci M, Wang C, et al. Gloss management for consistent reproduction of real and virtual objects. In: SIGGRAPH Asia 2022 Conference Papers. Vol 2022. Association for Computing Machinery; 2022. doi:10.1145/3550469.3555406
[Published Version]
View
| Files available
| DOI
2022 | Journal Article | IST-REx-ID: 12134 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Börner G, Schröder M, Scarselli D, Budanur NB, Hof B, Timme M. Explosive transitions in epidemic dynamics. Journal of Physics: Complexity. 2022;3(4). doi:10.1088/2632-072x/ac99cd
[Published Version]
View
| Files available
| DOI