Ferber, Asaf, Matthew Alan Kwan, and Lisa Sauermann. “List-Decodability with Large Radius for Reed-Solomon Codes.”https://doi.org/10.1109/FOCS52979.2021.00075__In 62nd Annual IEEE Symposium on Foundations of Computer Science, 2022:720–26. IEEE, 2022.https://doi.org/10.1109/FOCS52979.2021.00075 .

Ferber, Asaf, Matthew Alan Kwan, and Lisa Sauermann. “List-Decodability with Large Radius for Reed-Solomon Codes.”https://doi.org/10.1109/TIT.2022.3148779__IEEE Transactions on Information Theory. IEEE, 2022.https://doi.org/10.1109/TIT.2022.3148779 .

Kwan, Matthew Alan, Lisa Sauermann, and Yufei Zhao. “Extension Complexity of Low-Dimensional Polytopes.”https://doi.org/10.1090/tran/8614__Transactions of the American Mathematical Society. American Mathematical Society, 2022.https://doi.org/10.1090/tran/8614 .

Cooley, Oliver, Nicola Del Giudice, Mihyun Kang, and Philipp Sprüssel. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.”https://doi.org/10.37236/10607__Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2022.https://doi.org/10.37236/10607 .

Cooley, Oliver, M. Kang, and O. Pikhurko. “On a Question of Vera T. Sós about Size Forcing of Graphons.”https://doi.org/10.1007/s10474-022-01265-8__Acta Mathematica Hungarica. Springer Nature, 2022.https://doi.org/10.1007/s10474-022-01265-8 .

Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.”https://doi.org/10.1109/FOCS54457.2022.00091__In 63rd Annual IEEE Symposium on Foundations of Computer Science, 2022–October:919–30. Institute of Electrical and Electronics Engineers, 2022.https://doi.org/10.1109/FOCS54457.2022.00091 .

Cooley, Oliver, Mihyun Kang, and Julian Zalla. “Loose Cores and Cycles in Random Hypergraphs.”https://doi.org/10.37236/10794__The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics, 2022.https://doi.org/10.37236/10794 .