Peng Zhang's homepage

I am an assistant professor in Computer Science at Rutgers University. I am also a graduate faculty in Statistics at Rutgers.

I was a postdoc at Yale University, under the supervision of Prof. Daniel Spielman, during 2018 - 2021. I obtained my Ph.D. from Georgia Tech in 2018, advised by Prof. Richard Peng. Before that, I got my MS from Purdue University in 2015 and my BS from Zhejiang University in 2013.

Recruiting: I am recruiting PhD students. Please send me an email if you are interested in working with me at Rutgers.

Email: pz149@rutgers.edu

Hill Center, Room 444

My research lies broadly in theoretical computer science and data science. Specifically, I am interested in

  • fast algorithms for solving structured linear equations and linear programs,

  • discrepancy theory and its applications (e.g., in the design of randomized experiments).

Teaching

CS 323 Numerical Analysis and Computing: Fall 2022, at Rutgers

CS 673 Discrepancy Theory and Its Applications: Fall 2021, at Rutgers

CPSC 662 Combinatorial Discrepancy and Its Applications: Fall 2020, at Yale

Preprints

Balancing covariates in randomized experiments using the Gram-Schmidt walk

with Christopher Harshaw, Fredrik Savje, and Daniel Spielman. Arxiv https://arxiv.org/abs/1911.03071.

Publications

Hardness Results for Weaver's Discrepancy Problem

with Daniel Spielman. In APPROX 2022.

Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets

with Ming Ding, Rasmus Kyng, and Maximilian Probst Gutenberg. In ICALP 2022.

Two-Commodity Flow is as Hard as Linear Programming under Nearly Linear-Time Reductions

with Ming Ding and Rasmus Kyng. In ICALP 2022.

Positive LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard

with Rasmus Kyng and Di Wang. In SODA 2020.

Incomplete Nested Dissection

with Rasmus Kyng, Richard Peng, and Robert Schwieterman. In STOC 2018.

Hardness Results for Structured Linear Systems

with Rasmus Kyng. In FOCS 2017, won the best student paper award. In SIAM Journal on Computing (2020).

On Approximate Pattern Matching with Thresholds

with Mikhail J. Atallah. In Information Processing Letters 123 (2017): 21-26.

Approximating the Solution to Mixed Packing and Covering LPs in Parallel O~(ε^{−3}) Time

with Michael W. Mahoney, Satish Rao, and Di Wang. In ICALP 2016.

Optimal Query Complexity for Estimating the Trace of a Matrix

with Karl Wimmer and Yi Wu. In ICALP 2014.

Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a Social Network

with Wei Chen, Xiaoming Sun, Yajun Wang, and Jialin Zhang. In SIGKDD 2014.


My Ph.D. dissertation:

Hardness and Tractability For Structured Numerical Problems. 2018. Georgia Tech College of Computing Dissertation Award.