I am an assistant professor in the School of Computer Science at the Georgia Institute of Technology (where I'm part of ARC and ACO), and a visiting researcher (in MLO) at Microsoft Research Redmond. My research interests are in the design, analysis, and implementation of efficient algorithms. These interests currently revolve around problems induced by practice that arise at the intersection of discrete, numerical, and randomized algorithms, and my representative results include solvers graph-structured linear systems, nearly-linear time algorithms for approximating max-flows/min-cuts, and time/space efficient data structures for matchings, resistances, and matrices. (Research, Publications, Talks )
I received my BMath from Waterloo, PhD from CMU, and was a postdoc at MIT. Awards that I have received include the NSF Career Award, Microsoft Research PhD Fellowship, and CMU SCS Distinguished Dissertation Award. I was a visiting professor at the Shanghai University of Finance and Economics (in ITCS) between 2016 - 2018, and am extensively involved with algorithmic problem solving based outreach activities such as the IOI, the DMOJ Online Judge, and the ByteDance Winter Camp. (CV)
- Jan 2019: paper on iterative refinement for optimizing Lp-norm functions posted on arXiv (conference version appeared in SODA `19).
- October 2018: co-organized with Sushant Sachdeva a workshop, Laplacian Paradigm 2.0, at FOCS 2018.
- June 2018: Article by GT College of Computing on recent works on solving structured linear systems.
- Yu Gao, Fall 2017 - present
- Saurabh Sawlani, Fall 2016 - present