Aaron Sidford

University of Michigan–Ann Arbor — United States

Computer Science · Physical Sciences

24h-index2.2kcitations164works0.62yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(84), Stochastic Gradient Optimization Techniques(50), Sparse and Compressive Sensing Techniques(44), Markov Chains and Monte Carlo Methods(30), Optimization and Search Problems(30)

Publications164 total

Balancing Gradient and Hessian Queries in Non-Convex Optimization
arXiv (Cornell University)·2025Open Access
From Incremental Transitive Cover to Strongly Polynomial Maximum Flow
arXiv (Cornell University)·2025Open Access
Improved girth approximation in weighted undirected graphs
arXiv (Cornell University)·2025Open Access
Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure
arXiv (Cornell University)·2025Open Access
Accelerated Approximate Optimization of Multi-commodity Flows on Directed Graphs
2025· 1 cited
Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
arXiv (Cornell University)·2025Open Access
Entropy Regularization and Faster Decremental Matching in General Graphs
Society for Industrial and Applied Mathematics eBooks·2025
Finding Small Dijoins in Transitive Closure Time
arXiv (Cornell University)·2025Open Access
Eulerian Graph Sparsification by Effective Resistance Decomposition
Society for Industrial and Applied Mathematics eBooks·2025· 1 cited
Convex optimization with $p$-norm oracles
arXiv (Cornell University)·2024Open Access
Efficient Convex Optimization Requires Superlinear Memory
Journal of the ACM·2024Open Access
Eulerian Graph Sparsification by Effective Resistance Decomposition
arXiv (Cornell University)·2024Open Access
Faster Spectral Density Estimation and Sparsification in the Nuclear Norm
arXiv (Cornell University)·2024Open Access
Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
arXiv (Cornell University)·2024Open Access
Sparsifying Generalized Linear Models
2024· 1 citedOpen Access
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
2024· 2 citedOpen Access
Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers
ACM Transactions on Algorithms·2024· 3 citedOpen Access
Semi-Random Matrix Completion via Flow-Based Adaptive Reweighting
2024
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time
Society for Industrial and Applied Mathematics eBooks·2024· 3 cited
Entropy Regularization and Faster Decremental Matching in General Graphs
arXiv (Cornell University)·2023Open Access
page 1 of 9Next →

Frequent Co-authors

Yin Tat Lee(17), Jan van den Brand(9), Richard Peng(8), Arun Jambulapati(8), Yang P. Liu(7), Michael B. Cohen(7), Yair Carmon(6), John C. Duchi(6), Zhao Song(6), Jonathan A. Kelner(5), Thatchaphol Saranurak(5), Oliver Hinder(4), Di Wang(4), Sham M. Kakade(4), John Peebles(4), Danupon Nanongkai(3), Adrian Vladu(3), Sam Chiu-wai Wong(3), Chi Jin(3), Praneeth Netrapalli(3)