Optimal Query Complexity for Estimating the Trace of a Matrix. - Karl Wimmer; Yi Wu 002; Peng Zhang 052 (ICALP (1), 2014)

Minimizing seed set selection with probabilistic coverage guarantee in a social network. - Peng Zhang 052; Wei Chen 013; Xiaoming Sun 001; Yajun Wang 001; Jialin Zhang 001 (KDD, 2014)

Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time. - Michael W. Mahoney; Satish Rao; Di Wang 005; Peng Zhang 052 (ICALP, 2016)

On approximate pattern matching with thresholds. - Peng Zhang 052; Mikhail J. Atallah (Inf. Process. Lett., 2017)

Incomplete nested dissection. - Rasmus Kyng; Richard Peng; Robert Schwieterman; Peng Zhang 052 (STOC, 2018)

Hardness and Tractability for Structured Numerical Problems. - Peng Zhang 052 (2019)

Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard. - Rasmus Kyng; Di Wang 005; Peng Zhang 052 (SODA, 2020)

Hardness Results for Structured Linear Systems. - Rasmus Kyng; Peng Zhang 052 (SIAM J. Comput., 2020)

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)