Schmid, L. (2021). Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:10293 

Schmid, L., Shati, P., Hilbe, C., &; Chatterjee, K. (2021). The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. Springer Nature.https://doi.org/10.1038/s41598-021-96932-1 

Schmid, L., Chatterjee, K., Hilbe, C., &; Nowak, M. A. (2021). A unified framework of direct and indirect reciprocity. Nature Human Behaviour. Springer Nature.https://doi.org/10.1038/s41562-021-01114-8 

Hafner, C., &; Bickel, B. (2021). The design space of plane elastic curves. ACM Transactions on Graphics. Virtual: Association for Computing Machinery.https://doi.org/10.1145/3450626.3459800 

Semerádová, H. (2021). Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:10135 

Agrawal, N. (2021). Transition to turbulence and drag reduction in particle-laden pipe flows. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:9728 

Peruzzo, M., Hassani, F., Szep, G., Trioni, A., Redchenko, E., Zemlicka, M., &; Fink, J. M. (2021). Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. PRX Quantum. American Physical Society.https://doi.org/10.1103/PRXQuantum.2.040341 

Ford, B., Gasse, L., Kokoris Kogias, E., &; Jovanovic, P. (2020). Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods.

Hasani, R., Lechner, M., Amini, A., Rus, D., &; Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In Proceedings of the 37th International Conference on Machine Learning (pp. 4082–4093). Virtual.

Arbel-Raviv, M., Brown, T. A., &; Morrison, A. (2020). Getting to the root of concurrent binary search tree performance. In Proceedings of the 2018 USENIX Annual Technical Conference (pp. 295–306). Boston, MA, United States: USENIX Association.

Schmid, L., Chatterjee, K., &; Schmid, S. (2020). The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In Proceedings of the 23rd International Conference on Principles of Distributed Systems (Vol. 153). Neuchâtel, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2019.21 

Ferrere, T., Henzinger, T. A., &; Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CSL.2020.20 

Choudhary, A., Kachanovich, S., &; Wintraecken, M. (2020). Coxeter triangulations have good quality. Mathematics in Computer Science. Springer Nature.https://doi.org/10.1007/s11786-020-00461-5 

Gotfryd, D., Paerschke, E., Chaloupka, J., Oles, A. M., &; Wohlfeld, K. (2020). How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. American Physical Society.https://doi.org/10.1103/PhysRevResearch.2.013353 

Alistarh, D.-A., Fedorov, A., &; Koval, N. (2020). In search of the fastest concurrent union-find algorithm. In 23rd International Conference on Principles of Distributed Systems (Vol. 153, p. 15:1-15:16). Neuchatal, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2019.15 

Wei, Z., Tan, S., Liu, T., Wu, Y., Lei, J.-G., Chen, Z.,https://doi.org/10.1101/791137__Liao, K. (2020). Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. Cold Spring Harbor Laboratory.https://doi.org/10.1101/791137 

Larsson, J., Westram, A. M., Bengmark, S., Lundh, T., &; Butlin, R. K. (2020). A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. The Royal Society.https://doi.org/10.1098/rsif.2019.0721 

Czumaj, A., Davies, P., &; Parter, M. (2020). Simple, deterministic, constant-round coloring in the congested clique. In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (pp. 309–318). Salerno, Italy: Association for Computing Machinery.https://doi.org/10.1145/3382734.3405751 

Filakovský, M., Wagner, U., &; Zhechev, S. Y. (2020). Embeddability of simplicial complexes is undecidable. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 767–785). Salt Lake City, UT, United States: SIAM.https://doi.org/10.1137/1.9781611975994.47 

Beattie, R. J., Hippenmeyer, S., &; Pauler, F. (2020). SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. Frontiers Media.https://doi.org/10.3389/feduc.2020.00048