Jason Li

Research Interests

My research applies modern algorithmic techniques to the hardest, longstanding open problems in the field of fast graph algorithms. To illustrate, here are some of my recent discoveries: These modern techniques are all variations of two recurring themes, preconditioning and locality, which I explore in my thesis below. Loosely speaking, I see preconditioning and locality as reductions from worst-case instances to well-behaved and local instances, respectively.

Thesis: Preconditioning and Locality in Algorithm Design
EATCS Distinguished Dissertation Award (2021)

Selected Publications (show all)

All Publications (show selected)



Office: Room 120, Simons Institute, UC Berkeley
Email: jm[my last name]@alumni.cmu.edu