Sushant Sachdeva

Available identifiers

zbMath Open sachdeva.sushantDBLP25/9221WikidataQ102798783 ScholiaQ102798783MaRDI QIDQ1755830

List of research outcomes

Publication	Date of Publication	Type
Incremental approximate maximum flow on undirected graphs in subpolynomial update time	2024-11-28	Paper
Fast algorithms for separable linear programs	2024-11-28	Paper
Nested dissection meets IPMs: planar min-cost flow in nearly-linear time	2024-07-19	Paper
A new approach to estimating effective resistances and counting spanning trees in expander graphs	2024-05-14	Paper
A simple framework for finding balanced sparse cuts via APSP	2024-05-14	Paper
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions	2023-12-19	Paper
Convergence Results for Neural Networks via Electrodynamics	2021-06-15	Paper
Faster p-norm minimizing flows, via smoothed q-norm problems	2021-02-02	Paper
Faster p-norm minimizing flows, via smoothed q-norm problems	2019-10-23	Paper
Iterative Refinement for ℓp-norm Regression	2019-10-15	Paper
The mixing time of the Dikin walk in a polytope -- a simple proof	2019-01-11	Paper
A Framework for Analyzing Resparsification Algorithms	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4607982	2018-03-15	Paper
Sparsified Cholesky and multigrid solvers for connection laplacians	2017-09-29	Paper
Sampling random spanning trees faster than matrix multiplication	2017-08-17	Paper
An arithmetic analogue of Fox's triangle removal argument	2016-03-02	Paper
Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs	2015-11-27	Paper
Simultaneous Approximation of Constraint Satisfaction Problems	2015-10-27	Paper
Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders	2015-05-21	Paper
Algorithms for Lipschitz Learning on Graphs	2015-05-01	Paper
Faster Algorithms via Approximation Theory	2014-07-10	Paper
Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator	2014-05-13	Paper
Testing Permanent Oracles – Revisited	2012-11-02	Paper
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs	2011-08-17	Paper

Research outcomes over time

This page was built for person: Sushant Sachdeva