The following pages link to Aaron Sidford (Q2205971):
Displaying 39 items.
- Lower bounds for finding stationary points I (Q2205972) (← links)
- Lower bounds for finding stationary points II: first-order methods (Q2220663) (← links)
- Arboral satisfaction: recognition and LP approximation (Q2398493) (← links)
- Single Pass Spectral Sparsification in Dynamic Streams (Q2968162) (← links)
- Uniform Sampling for Matrix Approximation (Q2989029) (← links)
- Efficient Convex Optimization with Oracles (Q3295271) (← links)
- Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing (Q3449825) (← links)
- (Q4558562) (← links)
- Accelerated Methods for NonConvex Optimization (Q4571877) (← links)
- Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes (Q4607932) (← links)
- (Q4607979) (← links)
- Stability of the Lanczos Method for Matrix Function Approximation (Q4607994) (← links)
- Efficient $\widetilde{O}(n/\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse (Q4608054) (← links)
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs (Q4977989) (← links)
- Subquadratic submodular function minimization (Q4978061) (← links)
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
- Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (Q5096446) (← links)
- A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares) (Q5136291) (← links)
- Solving tall dense linear programs in nearly linear time (Q5144963) (← links)
- Fast and Space Efficient Spectral Sparsification in Dynamic Streams (Q5146894) (← links)
- (Q5158498) (← links)
- Efficient profile maximum likelihood for universal symmetric property estimation (Q5212818) (← links)
- Memory-sample tradeoffs for linear regression with small error (Q5212830) (← links)
- Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications (Q5236269) (← links)
- Geometric median in nearly linear time (Q5361815) (← links)
- Routing under balance (Q5361864) (← links)
- An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations (Q5383975) (← links)
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time (Q5495863) (← links)
- (Q5875498) (← links)
- Improved girth approximation in weighted undirected graphs (Q6538619) (← links)
- Towards optimal running timesfor optimal transport (Q6556151) (← links)
- Fully-dynamic graph sparsifiers against an adaptive adversary (Q6560806) (← links)
- Regularized box-simplex games and dynamic decremental bipartite matching (Q6560873) (← links)
- Semi-streaming bipartite matching in fewer passes and optimal space (Q6575101) (← links)
- Algorithmic trade-offs for girth approximation in undirected graphs (Q6575136) (← links)
- Computing Lewis weights to high precision (Q6575182) (← links)
- The complexity of infinite-horizon general-sum stochastic games (Q6610347) (← links)
- Incremental approximate maximum flow on undirected graphs in subpolynomial update time (Q6645467) (← links)
- A whole new ball game: a primal accelerated method for matrix games and minimizing the maximum of smooth functions (Q6645496) (← links)
