Sushant Sachdeva

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

Li Chen, Rasmus Kyng, Yang P. Liu et al. · 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) · 2022 · 125 citations

Mathematical Programming, Graph Sparsity, Engineering +18

Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator

Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi · 2012 · 114 citations

Spectral Theory, Numerical Analysis, Graph Sparsity +21

Sparsified Cholesky and multigrid solvers for connection laplacians

Rasmus Kyng, Yin Tat Lee, Richard Peng et al. · 2016 · 92 citations · Full text

Numerical Analysis, Spectral Theory, Mathematical Programming +16

Finding overlapping communities in social networks

Sanjeev Arora, Rong Ge, Sushant Sachdeva et al. · 2012 · 79 citations

Cluster Computing, Engineering, Community Mining +17

Faster Algorithms via Approximation Theory

Sushant Sachdeva, Nisheeth K. Vishnoi · Foundations and Trends® in Theoretical Computer Science · 2014 · 78 citations