Sushant Sachdeva
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
29
Venues
8
Active years
2012–2025
Best venue rank
A*
Where they publish
Papers
29 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | COLT | PREM: Privately Answering Statistical Queries with Relative Error. | Badih Ghazi, Cristbal Guzmn, Pritish Kamath, Alexander Knop, Ravi Kumar, Pasin Manurangsi, Sushant Sachdeva |
| 2025 | SODA | Eulerian Graph Sparsification by Effective Resistance Decomposition. | Arun Jambulapati, Sushant Sachdeva, Aaron Sidford, Kevin Tian, Yibin Zhao |
| 2024 | FOCS | Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. | Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2024 | ICALP | Optimal Electrical Oblivious Routing on Expanders. | Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2024 | ICALP | Better Sparsifiers for Directed Eulerian Graphs. | Sushant Sachdeva, Anvith Thudi, Yibin Zhao |
| 2024 | SODA | Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. | Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
| 2024 | SODA | Fast Algorithms for Separable Linear Programs. | Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye |
| 2023 | FOCS | A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. | Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
| 2023 | SODA | A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs. | Lawrence Li, Sushant Sachdeva |
| 2023 | SPAA | A Simple and Efficient Parallel Laplacian Solver. | Sushant Sachdeva, Yibin Zhao |
| 2022 | FOCS | Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. | Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2022 | ICML | A Convergent and Dimension-Independent Min-Max Optimization Algorithm. | Vijay Keswani, Oren Mangoubi, Sushant Sachdeva, Nisheeth K. Vishnoi |
| 2022 | SODA | Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. | Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye |
| 2021 | ICALP | Almost-Linear-Time Weighted 𝓁 | Deeksha Adil, Brian Bullins, Rasmus Kyng, Sushant Sachdeva |
| 2020 | ICML | Faster Graph Embeddings via Coarsening. | Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang |
| 2020 | SODA | Faster | Deeksha Adil, Sushant Sachdeva |
| 2019 | AISTATS | Improved Semi-Supervised Learning with Multiple Graphs. | Krishnamurthy Viswanathan, Sushant Sachdeva, Andrew Tomkins, Sujith Ravi |
| 2019 | SODA | Iterative Refinement for ℓp-norm Regression. | Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva |
| 2019 | SODA | Short Cycles via Low-Diameter Decompositions. | Yang P. Liu, Sushant Sachdeva, Zejun Yu |
| 2019 | STOC | Flows in almost linear time via adaptive preconditioning. | Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang |
| 2018 | FOCS | Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. | Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang |
| 2018 | SODA | Near-optimal approximation algorithm for simultaneous Max-Cut. | Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari |
| 2017 | SODA | A Framework for Analyzing Resparsification Algorithms. | Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva |
| 2017 | STOC | Sampling random spanning trees faster than matrix multiplication. | David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva |
| 2016 | FOCS | Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple. | Rasmus Kyng, Sushant Sachdeva |
| 2016 | STOC | Sparsified Cholesky and multigrid solvers for connection laplacians. | Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman |
| 2015 | COLT | Algorithms for Lipschitz Learning on Graphs. | Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman |
| 2015 | ICALP | Simultaneous Approximation of Constraint Satisfaction Problems. | Amey Bhangale, Swastik Kopparty, Sushant Sachdeva |
| 2012 | STOC | Approximating the exponential, the lanczos method and an ( | Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi |