Search Results - Sachdeva, Sushant

Refine Results
  1. 1
    Special Section on the Fifty-First Annual ACM Sympositum on the Theory of Computing (STOC 2019)

    Special Section on the Fifty-First Annual ACM Sympositum on the Theory of Computing (STOC 2019) by Moshkovitz, Dana, Sachdeva, Sushant

    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Fast Algorithms for ℓ p -Regression

    Fast Algorithms for ℓ p -Regression by Adil, Deeksha, Kyng, Rasmus, Peng, Richard, Sachdeva, Sushant

    Published in Journal of the ACM
    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  3. 3
    Fast Algorithms for ℓp-Regression

    Fast Algorithms for ℓp-Regression by Adil, Deeksha, Kyng, Rasmus, Peng, Richard, Sachdeva, Sushant

    Published in Journal of the ACM
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    The mixing time of the Dikin walk in a polytope—A simple proof

    The mixing time of the Dikin walk in a polytope—A simple proof by Sachdeva, Sushant, Vishnoi, Nisheeth K.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  5. 5
    Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple

    Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple by Kyng, Rasmus, Sachdeva, Sushant

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  6. 6
    Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions

    Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions by Chu, Timothy, Gao, Yu, Peng, Richard, Sachdeva, Sushant, Sawlani, Saurabh, Wang, Junxing

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  7. 7
    Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover

    Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover by Sachdeva, Sushant, Saket, Rishi

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  8. 8
    Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs

    Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs by Guruswami, Venkatesan, Sachdeva, Sushant, Saket, Rishi

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  9. 9
    Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders

    Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders by Arora, Sanjeev, Ge, Rong, Moitra, Ankur, Sachdeva, Sushant

    Published in Algorithmica
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  10. 10
    A Simple and Efficient Parallel Laplacian Solver

    A Simple and Efficient Parallel Laplacian Solver by Sachdeva, Sushant, Zhao, Yibin

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs

    A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs by Li, Lawrence, Sachdeva, Sushant

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    On the Characterization and Selection of Diverse Conformational Ensembles with Applications to Flexible Docking

    On the Characterization and Selection of Diverse Conformational Ensembles with Applications to Flexible Docking by Loriot, Sébastien, Sachdeva, S, Bastard, K, Prévost, Chantal, Cazals, Frédéric

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  13. 13
    Better Sparsifiers for Directed Eulerian Graphs

    Better Sparsifiers for Directed Eulerian Graphs by Sachdeva, Sushant, Thudi, Anvith, Zhao, Yibin

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Faster p-norm minimizing flows, via smoothed q-norm problems

    Faster p-norm minimizing flows, via smoothed q-norm problems by Adil, Deeksha, Sachdeva, Sushant

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Eulerian Graph Sparsification by Effective Resistance Decomposition

    Eulerian Graph Sparsification by Effective Resistance Decomposition by Jambulapati, Arun, Sachdeva, Sushant, Sidford, Aaron, Tian, Kevin, Zhao, Yibin

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Optimal Electrical Oblivious Routing on Expanders

    Optimal Electrical Oblivious Routing on Expanders by Cella Florescu, Kyng, Rasmus, Maximilian Probst Gutenberg, Sachdeva, Sushant

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    The Mixing Time of the Dikin Walk in a Polytope - A Simple Proof

    The Mixing Time of the Dikin Walk in a Polytope - A Simple Proof by Sachdeva, Sushant, Vishnoi, Nisheeth K

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Fast Algorithms for Separable Linear Programs

    Fast Algorithms for Separable Linear Programs by Dong, Sally, Goranci, Gramoz, Li, Lawrence, Sachdeva, Sushant, Ye, Guanghao

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization

    Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization by Adil, Deeksha, Bullins, Brian, Sachdeva, Sushant

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Fast Algorithms for \(\ell_p\)-Regression

    Fast Algorithms for \(\ell_p\)-Regression by Adil, Deeksha, Kyng, Rasmus, Peng, Richard, Sachdeva, Sushant

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: