I am a postdoc in Computer Science at Yale University, under the supervision of Dan Spielman. Before came to Yale, I got my PhD from Georgia Tech in 2018, advised by Richard Peng. I spent two years at Purdue University during 2013-2015 and got my MS degree there.
My research focuses on numerical linear algebra and spectral graph theory.
Here is my CV.
Papers
Hardness and Tractability For Structured Numerical Problems My PhD dissertation.
Positive LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard with Rasmus Kyng, Richard Peng, Di Wang. Under submission. This is Chapter 4 of my dissertation.
Incomplete Nested Dissection with Rasmus Kyng, Richard Peng, Robert Schwieterman. In STOC 2018.
Hardness Results for Structured Linear Systems with Rasmus Kyng. In FOCS 2017, won the best student paper award.
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, Di Wang. In ICALP 2016.
Optimal Query Complexity for Estimating the Trace of a Matrix with Karl Wimmer, Yi Wu. In ICALP 2014.
Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a Social Network with Wei Chen, Xiaoming Sun, Yajun Wang, Jialin Zhang. In SIGKDD 2014.