Nikonorova, N., et al. “The Arabidopsis Root Tip (Phospho)Proteomes at Growth-Promoting versus Growth-Repressing Conditions Reveal Novel Root Growth Regulators.”10.3390/cells10071665__Cells, vol. 10, 1665, MDPI, 2021, doi:10.3390/cells10071665.

Li, Lanxin, et al. “Cell Surface and Intracellular Auxin Signalling for H+-Fluxes in Root Growth.”10.21203/rs.3.rs-266395/v3__Research Square, 266395, doi:10.21203/rs.3.rs-266395/v3.

Schmid, Laura. Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10293.

Schmid, Laura, et al. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.”10.1038/s41598-021-96932-1__Scientific Reports, vol. 11, no. 1, 17443, Springer Nature, 2021, doi:10.1038/s41598-021-96932-1.

Schmid, Laura, et al. “A Unified Framework of Direct and Indirect Reciprocity.”10.1038/s41562-021-01114-8__Nature Human Behaviour, vol. 5, no. 10, Springer Nature, 2021, pp. 1292–1302, doi:10.1038/s41562-021-01114-8.

Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic Curves.”10.1145/3450626.3459800__ACM Transactions on Graphics, vol. 40, no. 4, 126, Association for Computing Machinery, 2021, doi:10.1145/3450626.3459800.

Semerádová, Hana. Molecular Mechanisms of the Cytokinin-Regulated Endomembrane Trafficking to Coordinate Plant Organogenesis. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10135.

Agrawal, Nishchal. Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9728.

Ford, Bryan, et al. Cryptographically Verifiable Data Structure Having Multi-Hop Forward and Backwards Links and Associated Systems and Methods. 2020.

Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–93.

Arbel-Raviv, Maya, et al. “Getting to the Root of Concurrent Binary Search Tree Performance.” Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306.

Schmid, Laura, et al. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.”10.4230/LIPIcs.OPODIS.2019.21__Proceedings of the 23rd International Conference on Principles of Distributed Systems, vol. 153, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2019.21.

Ferrere, Thomas, et al. “Monitoring Event Frequencies.”10.4230/LIPIcs.CSL.2020.20__28th EACSL Annual Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20.

Choudhary, Aruni, et al. “Coxeter Triangulations Have Good Quality.”10.1007/s11786-020-00461-5__Mathematics in Computer Science, vol. 14, Springer Nature, 2020, pp. 141–76, doi:10.1007/s11786-020-00461-5.

Gotfryd, Dorota, et al. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.”10.1103/PhysRevResearch.2.013353__Physical Review Research, vol. 2, no. 1, 013353, American Physical Society, 2020, doi:10.1103/PhysRevResearch.2.013353.

Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.”10.4230/LIPIcs.OPODIS.2019.15__23rd International Conference on Principles of Distributed Systems, vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16, doi:10.4230/LIPIcs.OPODIS.2019.15.

Wei, Zhuang, et al. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.”10.1101/791137__BioRxiv, Cold Spring Harbor Laboratory, 2020, doi:10.1101/791137.

Larsson, J., et al. “A Developmentally Descriptive Method for Quantifying Shape in Gastropod Shells.”10.1098/rsif.2019.0721__Journal of The Royal Society Interface, vol. 17, no. 163, 20190721, The Royal Society, 2020, doi:10.1098/rsif.2019.0721.

Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.”10.1145/3382734.3405751__Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–18, doi:10.1145/3382734.3405751.

Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.”10.1137/1.9781611975994.47__Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47.