Ouyang, Minghui

1. When can an expander code correct Ω(n) errors in O(n) time?
   2023/12/26 by Cheng, Kuan, Ouyang, Minghui, Shangguan, Chong +1 · 1 citation
   #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)
2. A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
   2024/09/24 by Li, Qian, Ouyang, Minghui, Wang, Yuyi · 1 citation
   #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
3. On Relative Ordered Turán Density
   2025/08/07 by King, Dylan, Lidický, Bernard, Ouyang, Minghui +3 · 1 citation
   #05C35 (primary) #Combinatorics (math.CO) #FOS: Mathematics