The following pages link to Sushant Sachdeva (Q1755830):
Displaying 22 items.
- The mixing time of the Dikin walk in a polytope -- a simple proof (Q1755831) (← links)
- Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders (Q2345948) (← links)
- An Arithmetic Analogue of Fox's Triangle Removal Argument (Q2789638) (← links)
- Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs (Q3088105) (← links)
- Testing Permanent Oracles – Revisited (Q3167410) (← links)
- Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)
- Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs (Q3453563) (← links)
- A Framework for Analyzing Resparsification Algorithms (Q4575880) (← links)
- (Q4607982) (← links)
- Sampling random spanning trees faster than matrix multiplication (Q4978019) (← links)
- Convergence Results for Neural Networks via Electrodynamics (Q4993285) (← links)
- Faster <i>p</i>-norm minimizing flows, via smoothed <i>q</i>-norm problems (Q5146825) (← links)
- Faster Algorithms via Approximation Theory (Q5167553) (← links)
- Iterative Refinement for <i>ℓ<sub>p</sub></i>-norm Regression (Q5236270) (← links)
- Sparsified Cholesky and multigrid solvers for connection laplacians (Q5361884) (← links)
- Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator (Q5415541) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
- A new approach to estimating effective resistances and counting spanning trees in expander graphs (Q6538633) (← links)
- A simple framework for finding balanced sparse cuts via APSP (Q6539111) (← links)
- Nested dissection meets IPMs: planar min-cost flow in nearly-linear time (Q6575077) (← links)
- Incremental approximate maximum flow on undirected graphs in subpolynomial update time (Q6645467) (← links)
- Fast algorithms for separable linear programs (Q6645493) (← links)
