Graph sparsification for derandomizing massively parallel computation with low space
A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).

Anderson localization of composite particles
F. Suzuki, M. Lemeshko, W.H. Zurek, R.V. Krems, Physical Review Letters 127 (2021).

Efficient load-balancing through distributed token dropping
S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–139.

The polaron at strong coupling
D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and Technology Austria, 2021.

NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization
A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, D.M. Roy, Journal of Machine Learning Research 22 (2021) 143.

Glu- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells
Y.H. Takeo, S.A. Shuster, L. Jiang, M. Hu, D.J. Luginbuhl, T. Rülicke, X. Contreras, S. Hippenmeyer, M.J. Wagner, S. Ganguli, L. Luo, Neuron 109 (2021) 9–644..

The effective mass problem for the Landau-Pekar equations
D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, ArXiv (n.d.).

Statistical analysis and optimality of neural systems
W.F. Mlynarski, M. Hledik, T.R. Sokolowski, G. Tkadik, Neuron 109 (2021) 1227–1241.e5.

Approximate message passing with spectral initialization for generalized linear models
M. Mondelli, R. Venkataramanan, in:, A. Banerjee, K. Fukumizu (Eds.), Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2021, pp. 397–405.

New strong convergence method for the sum of two maximal monotone operators
Y. Shehu, Q.-L. Dong, L.-L. Liu, J.-C. Yao, Optimization and Engineering 22 (2021) 2627–2653.

The germanium quantum information route
G. Scappucci, C. Kloeffel, F.A. Zwanenburg, D. Loss, M. Myronov, J.-J. Zhang, S.D. Franceschi, G. Katsaros, M. Veldhorst, Nature Reviews Materials 6 (2021) 926–943.

On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs
A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational Geometry 66 (2021) 938–976.

Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing 34 (2021) 463–487.

Local conditions for triangulating submanifolds of Euclidean space
J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete and Computational Geometry 66 (2021) 666–686.

Binary linear codes with optimal scaling: Polar codes with large kernels
A. Fazeli, H. Hassani, M. Mondelli, A. Vardy, IEEE Transactions on Information Theory 67 (2021) 5693–5710.

Regulation of size and scale in vertebrate spinal cord development
K. Kuzmicz-Kowalska, A. Kicheva, Wiley Interdisciplinary Reviews: Developmental Biology (2021).

Sheaf-theoretic stratification learning from geometric and topological perspectives
A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.

Edge universality for non-Hermitian random matrices
G. Cipolloni, L. Erdös, D.J. Schröder, Probability Theory and Related Fields (2021).

New inertial relaxed method for solving split feasibilities
Y. Shehu, A. Gibali, Optimization Letters 15 (2021) 2109–2126.

Network coding with myopic adversaries
S. Li, R. Bitar, S. Jaggi, Y. Zhang, IEEE Journal on Selected Areas in Information Theory 2 (2021) 1108–1119.