NOTE: if you are contacting me for research related purposes, please try for faster response times. However, due to school policies, I cannot communicate with students in my classes using this email address.

I am an assistant professor in the School of Computer Science at the Georgia Institute of Technology. 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 strutures for matchings, resistances, and matrices. (Research, Publications, Talks )

At Georgia Tech I'm part of the Algorithms and Randomness Center and the Algorithms, Combinatorics, and Optimization program. Before Georgia Tech, I received my BMath from Waterloo, PhD from CMU, and was an Instructor in Applied Math (equiv. to postdoc) at MIT. I had a visiting professor appointment at the Institute for Theoretical Computer Science at the Shanghai University of Finance and Economics between 2016 - 2018, and during the first half of 2019 I will be a visitig researcher in the Machine Learning and Optimization Group at Microsoft Research Redmond. I'm also extensively involved with algorithmic problem solving based outreach activities, including problem setting for the International Olympiad in Informatics, and helping with the DMOJ Online Judge and the ByteDance Winter Camp in advisory roles. (CV)

Recent Activities

Current Students

Former Students