Jason Li

About me

Research Interests

I work on the algorithmic side of theoretical computer science, specifically in the fields of approximation algorithms and distributed computing. On the mathematics side, my main interests are combinatorics and discrete graph theory.

Biography

I am a first-year PhD student in the School of Computer Science at Carnegie Mellon University and am part of the Algorithms and Combinatorial Optimization (ACO) group. I am fortunate to be advised by Prof. Anupam Gupta.

Publications

• Bernhard Haeupler, Jason Li. Beating O(sqrt(n) + D) for Distributed Shortest Path Approximations via Shortcuts. In submission (2017).

Older Publications

• Jason Li, Ryan O'Donnell. Bounding laconic proof systems by solving CSPs in parallel. SPAA 2017.
• S Bhupatiraju, P Etingof, D Jordan, W Kuszmaul, J Li. Lower central series of a free associative algebra over the integers and finite fields. Journal of Algebra (2012). (PDF)

Contact