Elkrewi, M. N., Khauratovich, U., Toups, M. A., Bett, V. K., Mrnjavac, A., Macon, A.,https://doi.org/10.1093/genetics/iyac123__Vicoso, B. (2022). ZW sex-chromosome evolution and contagious parthenogenesis in Artemia brine shrimp. Genetics. Oxford University Press.https://doi.org/10.1093/genetics/iyac123 
LibreCat: https://research-explorer.ista.ac.at/record/12248
DOI: 10.1093/genetics/iyac123
WoS: 000850270300001
PMID: 35977389

Elkrewi, M. N. (2022). Data from Elkrewi, Khauratovich, Toups et al. 2022, “ZW sex-chromosome evolution and contagious parthenogenesis in Artemia brine shrimp.”https://doi.org/10.15479/AT:ISTA:11653__Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:11653 
LibreCat: https://research-explorer.ista.ac.at/record/11653
DOI: 10.15479/AT:ISTA:11653

Shehu, Y., &; Iyiola, O. S. (2022). Weak convergence for variational inequalities with inertial-type method. Applicable Analysis. Taylor &; Francis.https://doi.org/10.1080/00036811.2020.1736287 
LibreCat: https://research-explorer.ista.ac.at/record/7577
DOI: 10.1080/00036811.2020.1736287
WoS: 000518364100001
arXiv: 2101.08057

Velicky, P., Miguel Villalba, E., Michalska, J. M., Wei, D., Lin, Z., Watson, J.,https://doi.org/10.1101/2022.03.16.484431__Danzl, J. G. (n.d.). Saturated reconstruction of living brain tissue. bioRxiv. Cold Spring Harbor Laboratory.https://doi.org/10.1101/2022.03.16.484431 
LibreCat: https://research-explorer.ista.ac.at/record/11943
DOI: 10.1101/2022.03.16.484431

Michalska, J. M., Lyudchik, J., Velicky, P., Korinkova, H., Watson, J., Cenameri, A.,https://doi.org/10.1101/2022.08.17.504272__Danzl, J. G. (n.d.). Uncovering brain tissue architecture across scales with super-resolution light microscopy. bioRxiv. Cold Spring Harbor Laboratory.https://doi.org/10.1101/2022.08.17.504272 
LibreCat: https://research-explorer.ista.ac.at/record/11950
DOI: 10.1101/2022.08.17.504272

Karatzas, I., Maas, J., &; Schachermayer, W. (2021). Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. Communications in Information and Systems. International Press.https://doi.org/10.4310/CIS.2021.v21.n4.a1 
LibreCat: https://research-explorer.ista.ac.at/record/10023
DOI: 10.4310/CIS.2021.v21.n4.a1
arXiv: 2005.14177

Jecker, I. R., Mazzocchi, N., &; Wolf, P. (2021). Decomposing permutation automata. In 32nd International Conference on Concurrency Theory (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2021.18 
LibreCat: https://research-explorer.ista.ac.at/record/10052
DOI: 10.4230/LIPIcs.CONCUR.2021.18
arXiv: 2107.04683

Chatterjee, K., Henzinger, M. H., Kale, S. S., &; Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In 48th International Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2021.124 
LibreCat: https://research-explorer.ista.ac.at/record/10054
DOI: 10.4230/LIPIcs.ICALP.2021.124

Adams, H., Kourimska, H., Heiss, T., Percival, S., &; Ziegelmeier, L. (2021). How to tutorial-a-thon. Notices of the American Mathematical Society. American Mathematical Society.https://doi.org/10.1090/noti2349 
LibreCat: https://research-explorer.ista.ac.at/record/10071
DOI: 10.1090/noti2349

Harris, D. G., Iliopoulos, F., &; Kolmogorov, V. (2021). A new notion of commutativity for the algorithmic Lovász Local Lemma. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Vol. 207). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31 
LibreCat: https://research-explorer.ista.ac.at/record/10072
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2021.31
arXiv: 2008.05569

Guha, S., Jecker, I. R., Lehtinen, K., &; Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In 46th International Symposium on Mathematical Foundations of Computer Science (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2021.53 
LibreCat: https://research-explorer.ista.ac.at/record/10075
DOI: 10.4230/LIPIcs.MFCS.2021.53
arXiv: 2105.02611

Nardin, M., Käfer, K., &; Csicsvari, J. L. (n.d.). The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. bioRxiv. Cold Spring Harbor Laboratory.https://doi.org/10.1101/2021.09.30.462269 
LibreCat: https://research-explorer.ista.ac.at/record/10080
DOI: 10.1101/2021.09.30.462269

Mühlböck, F., &; Tate, R. (2021). Transitioning from structural to nominal code with efficient gradual typing. Proceedings of the ACM on Programming Languages. Chicago, IL, United States: Association for Computing Machinery.https://doi.org/10.1145/3485504 
LibreCat: https://research-explorer.ista.ac.at/record/10153
DOI: 10.1145/3485504

Degraen, D., Piovarci, M., Bickel, B., &; Kruger, A. (2021). Capturing tactile properties of real surfaces for haptic reproduction. In 34th Annual ACM Symposium (pp. 954–971). Virtual: Association for Computing Machinery.https://doi.org/10.1145/3472749.3474798 
LibreCat: https://research-explorer.ista.ac.at/record/10148
DOI: 10.1145/3472749.3474798

Clozeau, N., &; Gloria, A. (n.d.). Quantitative nonlinear homogenization: control of oscillations. arXiv.
LibreCat: https://research-explorer.ista.ac.at/record/10174
arXiv: 2104.04263

Hoefler, T., Alistarh, D.-A., Ben-Nun, T., Dryden, N., &; Peste, E.-A. (2021). Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks. Journal of Machine Learning Research. Journal of Machine Learning Research.
LibreCat: https://research-explorer.ista.ac.at/record/10180
arXiv: 2102.00554

Alistarh, D.-A., Gelashvili, R., &; Rybicki, J. (2021). Brief announcement: Fast graphical population protocols. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2021.43 
LibreCat: https://research-explorer.ista.ac.at/record/10218
DOI: 10.4230/LIPIcs.DISC.2021.43
arXiv: 2102.08808

Alistarh, D.-A., Gelashvili, R., &; Nadiradze, G. (2021). Lower bounds for shared-memory leader election under bounded write contention. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2021.4 
LibreCat: https://research-explorer.ista.ac.at/record/10217
DOI: 10.4230/LIPIcs.DISC.2021.4

Chatterjee, B., Peri, S., &; Sa, M. (2021). Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2021.52 
LibreCat: https://research-explorer.ista.ac.at/record/10216
DOI: 10.4230/LIPIcs.DISC.2021.52
arXiv: 2003.01697

Korhonen, J., Paz, A., Rybicki, J., Schmid, S., &; Suomela, J. (2021). Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2021.58 
LibreCat: https://research-explorer.ista.ac.at/record/10219
DOI: 10.4230/LIPIcs.DISC.2021.58
arXiv: 2108.02655