Velicky P, Miguel Villalba E, Michalska JM, et al. Saturated reconstruction of living brain tissue. bioRxiv. doi:10.1101/2022.03.16.484431

Michalska JM, Lyudchik J, Velicky P, et al. Uncovering brain tissue architecture across scales with super-resolution light microscopy. bioRxiv. doi:10.1101/2022.08.17.504272

Karatzas I, Maas J, Schachermayer W. Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. Communications in Information and Systems. 2021;21(4):481-536. doi:10.4310/CIS.2021.v21.n4.a1

Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: 32nd International Conference on Concurrency Theory. Vol 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.CONCUR.2021.18

Chatterjee K, Henzinger MH, Kale SS, Svozil A. Faster algorithms for bounded liveness in graphs and game graphs. In: 48th International Colloquium on Automata, Languages, and Programming. Vol 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.ICALP.2021.124

Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. How to tutorial-a-thon. Notices of the American Mathematical Society. 2021;68(9):1511-1514. doi:10.1090/noti2349

Harris DG, Iliopoulos F, Kolmogorov V. A new notion of commutativity for the algorithmic Lovász Local Lemma. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Vol 207. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.APPROX/RANDOM.2021.31

Guha S, Jecker IR, Lehtinen K, Zimmermann M. A bit of nondeterminism makes pushdown automata expressive and succinct. In: 46th International Symposium on Mathematical Foundations of Computer Science. Vol 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.MFCS.2021.53

Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. bioRxiv. doi:10.1101/2021.09.30.462269

Palaia I, Paraschiv A, Debets V, Storm C, Sari A. Durotaxis of passive nanoparticles on elastic membranes. ACS Nano. 2021. doi:10.1021/acsnano.1c02777 

Harker-Kirschneck L, Hafner AE, Yao T, et al. Physical mechanisms of ESCRT-III-driven cell division in archaea. bioRxiv. doi:10.1101/2021.03.23.436559

Rauschendorfer T, Gurri S, Heggli I, et al. Acute and chronic effects of a light-activated FGF receptor in keratinocytes in vitro and in mice. Life Science Alliance. 2021;4(11). doi:10.26508/lsa.202101100

Mühlböck F, Tate R. Transitioning from structural to nominal code with efficient gradual typing. Proceedings of the ACM on Programming Languages. 2021;5. doi:10.1145/3485504

Degraen D, Piovarci M, Bickel B, Kruger A. Capturing tactile properties of real surfaces for haptic reproduction. In: 34th Annual ACM Symposium. Association for Computing Machinery; 2021:954-971. doi:10.1145/3472749.3474798

Clozeau N, Gloria A. Quantitative nonlinear homogenization: control of oscillations. arXiv.

Hoefler T, Alistarh D-A, Ben-Nun T, Dryden N, Peste E-A. Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks. Journal of Machine Learning Research. 2021;22(241):1-124.

Alistarh D-A, Gelashvili R, Rybicki J. Brief announcement: Fast graphical population protocols. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.43

Alistarh D-A, Gelashvili R, Nadiradze G. Lower bounds for shared-memory leader election under bounded write contention. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.4

Chatterjee B, Peri S, Sa M. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.52

Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.58