About Me

My interests lie primarily in graph algorithms, especially those relating to flows, cuts, and graph decompositions. I also have an interest in algebraic and additive algorithms, convex optimization, and various areas of combinatorics.

I also go by the nickname Ash. I am easiest to reach by email.

Selected Work

  • Faster Minimum k-Cut II: Near-Optimal and Deterministic for Weighted Graphs arXiv
  • Deterministic Spectral Sparsification in Almost-Linear Time for Dense Graphs with Jason Li arXiv
  • Faster Minimum k-Cut I: Simple and Sparse Weighted Graphs with Jason Li arXiv
  • A Simple Las Vegas Algorithm for Sparse Nonnegative Convolution arXiv
  • Simpler Algorithms for Knapsack, Subset Sum, and Min-Plus Convolution arXiv