I am a third-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 current research interests are primarily focused on efficient randomized graph algorithms, and, in particular, sampling techniques that preserve fundamental combinatorial structures of graphs.
- Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees with John Peebles, Richard Peng, and Anup B. Rao. under submission
- Tight Bounds for Sandpile Transience on the Two-Dimensional Grid up to Polylogarithmic Factors with Matthew Fahrbach, Yu Gao, and Tao Xiao. under submission
- 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 one of the current organizers of the ACO Student Seminar, whose webpage can be found here . Please contact me if you would like to give a talk on one of the available days.
Klaus Advanced Computing Building, Room 2124
Georgia Institute of Technology
Atlanta, GA 30332-0280
Last Modified: May 1, 2017