Sushant Sachdeva
Identifiers
- name variant Sushant Sachdeva 0.60 · backfill
Papers (24)
- A Tight Bound on Localization of Electrical Flows cs.DS · 2026 · author #3
- Flows in Almost Linear Time via Adaptive Preconditioning cs.DS · 2019 · author #3
- Short Cycles via Low-Diameter Decompositions cs.DS · 2018 · author #2
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions cs.DS · 2018 · author #4
- Near-optimal approximation algorithm for simultaneous Max-Cut cs.CC · 2018 · author #4
- Convergence Results for Neural Networks via Electrodynamics cs.DS · 2017 · author #2
- Sampling Random Spanning Trees Faster than Matrix Multiplication cs.DS · 2016 · author #5
- A Framework for Analyzing Resparsification Algorithms cs.DS · 2016 · author #4
- Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple cs.DS · 2016 · author #2
- Sparsified Cholesky and Multigrid Solvers for Connection Laplacians cs.DS · 2015 · author #4
- The Mixing Time of the Dikin Walk in a Polytope - A Simple Proof cs.DS · 2015 · author #1
- Fast, Provable Algorithms for Isotonic Regression in all $\ell_{p}$-norms cs.LG · 2015 · author #3
- Algorithms for Lipschitz Learning on Graphs cs.LG · 2015 · author #3
- Simultaneous Approximation of Constraint Satisfaction Problems cs.DS · 2014 · author #3
- Approximation Theory and the Design of Fast Algorithms cs.DS · 2013 · author #1
- Matrix Inversion Is As Easy As Exponentiation cs.DS · 2013 · author #1
- An Arithmetic Analogue of Fox's Triangle Removal Argument math.CO · 2013 · author #2
- Testing Permanent Oracles -- Revisited cs.DS · 2012 · author #4
- Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders cs.LG · 2012 · author #4
- Finding Overlapping Communities in Social Networks: Toward a Rigorous Approach cs.SI · 2011 · author #3
- Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator cs.DS · 2011 · author #2
- Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs cs.CC · 2011 · author #1
- Cuts in Cartesian Products of Graphs cs.DM · 2011 · author #1
- A Reformulation of the Arora-Rao-Vazirani Structure Theorem cs.DM · 2011 · author #3
Mentions
- 2605.24130 #3 · arxiv_oai · confidence 0.70 Sushant Sachdeva
- 1207.4783 #4 · backfill · confidence 0.70 Sushant Sachdeva
- 1206.5349 #4 · backfill · confidence 0.70 Sushant Sachdeva
- 1112.1831 #3 · backfill · confidence 0.70 Sushant Sachdeva
- 1111.1491 #2 · backfill · confidence 0.70 Sushant Sachdeva
- 1105.4175 #1 · backfill · confidence 0.70 Sushant Sachdeva
- 1105.3383 #1 · backfill · confidence 0.70 Sushant Sachdeva
- 1102.1456 #3 · backfill · confidence 0.70 Sushant Sachdeva
Frequent Coauthors
- Rasmus Kyng 7 shared papers
- Richard Peng 4 shared papers
- Sanjeev Arora 4 shared papers
- Nisheeth K. Vishnoi 3 shared papers
- Amey Bhangale 2 shared papers
- Anup Rao 2 shared papers
- Daniel A. Spielman 2 shared papers
- Madhur Tulsiani 2 shared papers
- Rong Ge 2 shared papers
- Swastik Kopparty 2 shared papers
- Ankur Moitra 1 shared papers
- Anup B. Rao 1 shared papers
- Arnab Bhattacharyya 1 shared papers
- Asaf Nachmias 1 shared papers
- David Durfee 1 shared papers
- Devanathan Thiruvenkatachari 1 shared papers
- Di Wang 1 shared papers
- Grant Schoenebeck 1 shared papers
- Jakub Pachocki 1 shared papers
- James Lee 1 shared papers