Published numerous papers, including 'Trickle-down Theorems via C-Lorentzian Polynomials II: Pairwise Spectral Influence and Improved Dobrushin's Condition' (2025), 'Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences' (FOCS 2025), 'Unweighted Code Sparsifiers and Thin Subgraphs' (submitted 2025), 'On approximability of the Permanent of PSD matrices' (STOC 2025), and more. 'A Randomized Rounding Approach to the Traveling Salesman Problem' (FOCS 2011) won the best paper award.
Research Experience
Co-organized a semester-long program on Geometry of Polynomials in Spring 2019.
Education
PhD, Stanford University, 2013, Thesis: 'New Rounding Techniques for the Design and Analysis of Approximation Algorithms', Honorable Mention for ACM Doctoral Dissertation Award.
Background
Lazowska Professor, Computer Science and Engineering, University of Washington. Mainly interested in the design and analysis of algorithms using algebraic techniques.