Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions. - Ming Ding 005; Rasmus Kyng; Peng Zhang 052 (ICALP, 2022)

Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. - Ming Ding 005; Rasmus Kyng; Maximilian Probst Gutenberg; Peng Zhang 052 (ICALP, 2022)

Efficient 1-Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences. - Ming Ding 005; Peng Zhang 052 (ESA, 2023)

Weighted 1-Laplacian Solvers for Well-Shaped Simplicial Complexes. - Ming Ding 005; Peng Zhang 052 (CoRR, 2023)

Assessing GPT Performance in a Proof-Based University-Level Course Under Blind Grading. - Ming Ding 005; Rasmus Kyng; Federico Soldà; Weixuan Yuan (CoRR, 2025)