Jason Li

Postdoctoral Researcher, Simons Institute, UC Berkeley

Jason Li is a Simons Institute postdoctoral fellow working on fundamental graph optimization problems such as minimum cut and maximum flow. His research efforts have led to state-of-the-art algorithms for a wide array of classic problems, including deterministic global minimum cut, minimum k-way cut, Gomory-Hu tree or all-pairs minimum cut, and single-source shortest path in parallel.

Program Visits

Foundations of Data Science, Fall 2018, Visiting Graduate Student
graph algorithms, minimum cut, maximum flow, shortest path