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.

9176 Publications


2022 | Conference Paper | IST-REx-ID: 11812 | OA
K. Hanauer, M. H. Henzinger, and Q. C. Hua, “Fully dynamic four-vertex subgraph counting,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2022 | Conference Paper | IST-REx-ID: 11808 | OA
K. Hanauer, M. H. Henzinger, and C. Schulz, “Recent advances in fully dynamic graph algorithms,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2022 | Journal Article | IST-REx-ID: 11916 | OA
M. Wirth, “Kac regularity and domination of quadratic forms,” Advances in Operator Theory, vol. 7, no. 3. Springer Nature, 2022.
[Published Version] View | Files available | DOI
 

2022 | Conference Paper | IST-REx-ID: 11918
M. H. Henzinger, A. Lincoln, and B. Saha, “The complexity of average-case dynamic subgraph counting,” in 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2022, pp. 459–498.
View | DOI
 

2022 | Conference Paper | IST-REx-ID: 11930 | OA
M. H. Henzinger, A. Noe, and C. Schulz, “Practical fully dynamic minimum cut algorithms,” in 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Alexandria, VA, United States, 2022, pp. 13–26.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Journal Article | IST-REx-ID: 11955 | OA
M. Traxler et al., “Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling,” Angewandte Chemie International Edition, vol. 61, no. 21. Wiley, 2022.
[Published Version] View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 

2022 | Journal Article | IST-REx-ID: 11991 | OA
A. Krokhin and J. Opršal, “An invitation to the promise constraint satisfaction problem,” ACM SIGLOG News, vol. 9, no. 3. Association for Computing Machinery, pp. 30–59, 2022.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Journal Article | IST-REx-ID: 11996
J. A. Palacci, “A soft active matter that can climb walls,” Science, vol. 377, no. 6607. American Association for the Advancement of Science, pp. 710–711, 2022.
View | DOI | PubMed | Europe PMC
 

2022 | Conference Paper | IST-REx-ID: 12010 | OA
A. Brunnbauer et al., “Latent imagination facilitates zero-shot transfer in autonomous racing,” in 2022 International Conference on Robotics and Automation, Philadelphia, PA, United States, 2022, pp. 7513–7520.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Journal Article | IST-REx-ID: 12007 | OA
B. B. GOSWAMI, S.-I. An, and R. Murtugudde, “Role of the Tibetan plateau glaciers in the Asian summer monsoon,” Climatic Change, vol. 173, no. 3–4. Springer Nature, 2022.
[Published Version] View | Files available | DOI
 

2022 | Conference Paper | IST-REx-ID: 12011 | OA
Y. Zhang, S. Jaggi, M. Langberg, and A. D. Sarwate, “The capacity of causal adversarial channels,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2523–2528.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Conference Paper | IST-REx-ID: 12017
A. K. Yadav, M. Alimohammadi, Y. Zhang, A. J. Budkuley, and S. Jaggi, “New results on AVCs with omniscient and myopic adversaries,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2535–2540.
View | DOI
 

2022 | Conference Paper | IST-REx-ID: 12013
P. Joshi, A. Purkayastha, Y. Zhang, A. J. Budkuley, and S. Jaggi, “On the capacity of additive AVCs with feedback,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 504–509.
View | DOI
 

2022 | Conference Paper | IST-REx-ID: 12016 | OA
D. Fathollahi and M. Mondelli, “Polar coded computing: The role of the scaling exponent,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2154–2159.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Conference Paper | IST-REx-ID: 12012 | OA
S. Torkamani, J. B. Ebrahimi, P. Sadeghi, R. G. L. D’Oliveira, and M. Médard, “Heterogeneous differential privacy via graphs,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 1623–1628.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Conference Paper | IST-REx-ID: 12018
Y. Zhang and S. Vatedka, “Lower bounds on list decoding capacity using error exponents,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 1324–1329.
View | DOI
 

2022 | Conference Paper | IST-REx-ID: 12015
Y. Zhang and S. Vatedka, “Lower bounds for multiple packing,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 3085–3090.
View | DOI
 

2022 | Conference Paper | IST-REx-ID: 12014
Y. Zhang and S. Vatedka, “List-decodability of Poisson Point Processes,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2559–2564.
View | DOI
 

2022 | Conference Paper | IST-REx-ID: 12019
N. Polyanskii and Y. Zhang, “List-decodable zero-rate codes for the Z-channel,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2553–2558.
View | DOI
 

2022 | Thesis | IST-REx-ID: 12072 | OA
A. L. Shute, “Existence and density problems in Diophantine geometry: From norm forms to Campana points,” Institute of Science and Technology Austria, 2022.
[Published Version] View | Files available | DOI
 

Search

Filter Publications