Assistant Professor, University of California, Davis
2 papers at NeurIPS 2025
This paper gives a pure dp algorithm for all the pairs min cut problem with the same error as private min-st-cut.
We develop new MPC and semi-streaming algorithms for approximating the directed densest subgraph.
