Improved decoding of expander codes: fundamental trade-off between expansion ratio and minimum distance of inner code. - Kuan Cheng; Minghui Ouyang; Chong Shangguan; Yuanting Shen (CoRR, 2023)

Improved Decoding of Expander Codes. - Xue Chen; Kuan Cheng; Xin Li 006; Minghui Ouyang (IEEE Trans. Inf. Theory, 2023)

When Can an Expander Code Correct Ω(n) Errors in O(n) Time? - Kuan Cheng; Minghui Ouyang; Chong Shangguan; Yuanting Shen (APPROX/RANDOM, 2024)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems. - Qian Li; Minghui Ouyang; Yuyi Wang 001 (ISAAC, 2024)

On the Power of Small-size Graph Neural Networks for Linear Programming. - Qian Li; Tian Ding; Linxin Yang; Minghui Ouyang; Qingjiang Shi; Ruoyu Sun 001 (NeurIPS, 2024)

Towards Explaining the Power of Constant-depth Graph Neural Networks for Structured Linear Programming. - Qian Li; Minghui Ouyang; Tian Ding; Yuyi Wang 006; Qingjiang Shi; Ruoyu Sun 001 (ICLR, 2025)

Set families: restricted distances via restricted intersections. - Zichao Dong; Jun Gao; Hong Liu; Minghui Ouyang; Qiang Zhou (CoRR, 2025)