- Benedikt Stufler. Graphon convergence of random cographs. Random Struct. Algorithms, 59(3):464-491, 2021.
- Tom Bohman, Peter Keevash. Dynamic concentration of the triangle-free process. Random Struct. Algorithms, 58(2):221-293, 2021.
- Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Manuel Penschuck, Guangyan Zhou. The number of satisfying assignments of random 2-SAT formulas. Random Struct. Algorithms, 58(4):609-647, 2021.
- Michal Lason. Optimal stopping for many connected components in a graph. Random Struct. Algorithms, 59(2):267-287, 2021.
- Jacopo Borga. Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one-dimensional labels. Random Struct. Algorithms, 59(3):339-375, 2021.
- Dirk Zeindler. Long cycle of random permutations with polynomially growing cycle weights. Random Struct. Algorithms, 58(4):726-739, 2021.
- John Haslegrave, Christoforos Panagiotis. Site percolation and isoperimetric inequalities for plane graphs. Random Struct. Algorithms, 58(1):150-163, 2021.
- Jacob Fox, Cosmin Pohoata. Sets without k-term progressions can have many shorter progressions. Random Struct. Algorithms, 58(3):383-389, 2021.
- Erik Bates, Moumanti Podder. Avoidance couplings on non-complete graphs. Random Struct. Algorithms, 59(1):25-52, 2021.
- Michael Anastos, Alan M. Frieze. Finding maximum matchings in random regular graphs in linear expected time. Random Struct. Algorithms, 58(3):390-429, 2021.