Large Clique is Hard on Average for Resolution. - Shuo Pang 002 (Electron. Colloquium Comput. Complex., 2019)

SOS Lower Bound for Exact Planted Clique. - Shuo Pang 002 (CCC, 2021)

On CDCL-Based Proof Systems with the Ordered Decision Strategy. - Nathan Mull; Shuo Pang 002; Alexander A. Razborov (SIAM J. Comput., 2022)

Sum-of-Squares Lower Bounds for Non-Gaussian Component Analysis. - Ilias Diakonikolas; Sushrut Karmalkar; Shuo Pang 002; Aaron Potechin (FOCS, 2024)

Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. - Susanna F. de Rezende; Noah Fleming; Duri Andrea Janett; Jakob Nordström; Shuo Pang 002 (Electron. Colloquium Comput. Complex., 2024)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. - Jonas Conneryd; Susanna F. de Rezende; Jakob Nordström; Shuo Pang 002; Kilian Risse (Electron. Colloquium Comput. Complex., 2025)