Minghui Ouyang

According to our database, Minghui Ouyang authored at least 7 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Set families: restricted distances via restricted intersections.

Zichao Dong, Jun Gao, Hong Liu, Minghui Ouyang, Qiang Zhou

CoRR, April, 2025

Towards Explaining the Power of Constant-depth Graph Neural Networks for Structured Linear Programming.

Qian Li, Minghui Ouyang, Tian Ding, Yuyi Wang, Qingjiang Shi, Ruoyu Sun

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

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

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems.

Qian Li, Minghui Ouyang, Yuyi Wang

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

When Can an Expander Code Correct Ω(n) Errors in O(n) Time?

Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen

Proceedings of the Approximation, 2024

2023

Improved Decoding of Expander Codes.

Xue Chen, Kuan Cheng, Xin Li, Minghui Ouyang

IEEE Trans. Inf. Theory, June, 2023

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