I am a fourth-year Computer Science PhD student in the Algorithms, Combinatorics, and Optimization program at Georgia Tech, advised by Richard Peng. Previously, I completed my undergraduate degree from the University of Chicago, majoring in Mathematics and Economics.
My research interests primarily lie in efficient randomized algorithms, graph algorithms, and computational economics.
- L1 Regression using Lewis Weights Preconditioning with Kevin A. Lai and Saurabh Sawlani. under submission
- Tight Bounds for Sandpile Transience on the Two-Dimensional Grid up to Polylogarithmic Factors with Matthew Fahrbach, Yu Gao, and Tao Xiao. to appear in SODA 2018
- Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees with John Peebles, Richard Peng, and Anup B. Rao. IEEE Symposium on the Foundations of Computer Science (FOCS) 2017. Invited to appear in the SICOMP special issue
- Sampling Random Spanning Trees Faster than Matrix Multiplication with Rasmus Kyng, John Peebles, Anup B. Rao, and Sushant Sachdeva. ACM Symposium on the Theory of Computing (STOC) 2017.
- On Fully Dynamic Graph Sparsifiers with Ittai Abraham, Ioannis Koutis, Sebastian Krinninger, and Richard Peng. IEEE Symposium on the Foundations of Computer Science (FOCS) 2016.
- On the Complexity of Nash Equilibria in Anonymous Games with Xi Chen and Anthi Orfanou. ACM Symposium on the Theory of Computing (STOC) 2015.
ACO Student Seminar
I am no longer one of the organizers for the ACO Student Seminar, but the current webpage can be found here .
Klaus Advanced Computing Building, Room 2124
Georgia Institute of Technology
Atlanta, GA 30332-0280
Last Modified: Oct. 1, 2017