Aaron Sidford

2.2k total citations
37 papers, 546 citations indexed

About

Aaron Sidford is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Statistics and Probability. According to data from OpenAlex, Aaron Sidford has authored 37 papers receiving a total of 546 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Computational Theory and Mathematics, 16 papers in Artificial Intelligence and 12 papers in Statistics and Probability. Recurrent topics in Aaron Sidford's work include Complexity and Algorithms in Graphs (27 papers), Markov Chains and Monte Carlo Methods (11 papers) and Sparse and Compressive Sensing Techniques (9 papers). Aaron Sidford is often cited by papers focused on Complexity and Algorithms in Graphs (27 papers), Markov Chains and Monte Carlo Methods (11 papers) and Sparse and Compressive Sensing Techniques (9 papers). Aaron Sidford collaborates with scholars based in United States, United Kingdom and Sweden. Aaron Sidford's co-authors include Yin Tat Lee, Jonathan A. Kelner, Oliver Hinder, Yair Carmon, Lorenzo Orecchia, John C. Duchi, Zeyuan Allen Zhu, Jan van den Brand, Yang P. Liu and Zhao Song and has published in prestigious journals such as SIAM Journal on Computing, SIAM Journal on Optimization and Operations Research Letters.

In The Last Decade

Aaron Sidford

34 papers receiving 513 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Aaron Sidford United States	12	318	231	129	111	93	37	546
Yin Tat Lee United States	18	373 1.2×	338 1.5×	211 1.6×	99 0.9×	109 1.2×	46	816
Daniel M. Kane United States	15	271 0.9×	460 2.0×	145 1.1×	125 1.1×	32 0.3×	89	841
Raghu Meka United States	17	305 1.0×	332 1.4×	79 0.6×	270 2.4×	66 0.7×	48	792
David Steurer United States	21	707 2.2×	383 1.7×	264 2.0×	126 1.1×	86 0.9×	47	1.1k
Yury Makarychev United States	15	502 1.6×	222 1.0×	212 1.6×	55 0.5×	57 0.6×	51	769
Prasad Raghavendra United States	19	689 2.2×	358 1.5×	256 2.0×	48 0.4×	71 0.8×	57	950
Jelani Nelson United States	14	236 0.7×	540 2.3×	266 2.1×	237 2.1×	39 0.4×	38	854
Arkadi Nemirovsky Russia	7	163 0.5×	235 1.0×	75 0.6×	210 1.9×	182 2.0×	8	545
Shmuel Onn Israel	18	471 1.5×	116 0.5×	97 0.8×	53 0.5×	137 1.5×	78	811
Aditya Bhaskara United States	9	175 0.6×	156 0.7×	107 0.8×	39 0.4×	21 0.2×	38	397

Countries citing papers authored by Aaron Sidford

Since Specialization

Citations

This map shows the geographic impact of Aaron Sidford's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Aaron Sidford with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aaron Sidford more than expected).

Fields of papers citing papers by Aaron Sidford

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Aaron Sidford. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Aaron Sidford. The network helps show where Aaron Sidford may publish in the future.

Co-authorship network of co-authors of Aaron Sidford

This figure shows the co-authorship network connecting the top 25 collaborators of Aaron Sidford. A scholar is included among the top collaborators of Aaron Sidford based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Aaron Sidford. Aaron Sidford is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Lee, James R., et al.. (2024). Sparsifying Generalized Linear Models. 1665–1675.

Blanchet, José, et al.. (2023). Towards optimal running times for optimal transport. Operations Research Letters. 52. 107054–107054. 7 indexed citations

Brand, Jan van den, Yang P. Liu, & Aaron Sidford. (2023). Dynamic Maxflow via Dynamic Interior Point Methods. 1215–1228. 4 indexed citations

Liu, Yang P., et al.. (2023). Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification. 196–206. 2 indexed citations

Lee, James R., et al.. (2023). Sparsifying Sums of Norms. 1953–1962. 3 indexed citations

Bernstein, Aaron, Jan van den Brand, Maximilian Probst Gutenberg, et al.. (2022). Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Liu, Yang P., et al.. (2022). Unit Capacity Maxflow in Almost $m^{4/3}$ Time. SIAM Journal on Computing. 53(6). FOCS20–175. 4 indexed citations

Chakrabarty, Deeparnab, et al.. (2022). Improved Lower Bounds for Submodular Function Minimization. 118. 245–254. 2 indexed citations

Murtagh, Jack, Omer Reingold, Aaron Sidford, & Salil Vadhan. (2021). . Theory of Computing. 17(1). 1–35. 1 indexed citations

10.

Lévy, Daniel, Yair Carmon, John C. Duchi, & Aaron Sidford. (2020). Large-Scale Methods for Distributionally Robust Optimization. Neural Information Processing Systems. 33. 8847–8860. 3 indexed citations

11.

Liu, Yang P., et al.. (2020). Unit Capacity Maxflow in Almost Time. 119–130. 11 indexed citations

12.

Brand, Jan van den, Yin Tat Lee, Aaron Sidford, & Zhao Song. (2020). Solving tall dense linear programs in nearly linear time. 775–788. 25 indexed citations

13.

Gasnikov, Alexander, Pavel Dvurechensky, Eduard Gorbunov, et al.. (2019). Near Optimal Methods for Minimizing Convex Functions with Lipschitz $p$-th Derivatives. Conference on Learning Theory. 1392–1393. 7 indexed citations

14.

Chakrabarty, Deeparnab, et al.. (2019). Faster Matroid Intersection. 1146–1168. 7 indexed citations

15.

Chakrabarty, Deeparnab, et al.. (2017). Subquadratic submodular function minimization. 1220–1231. 11 indexed citations

16.

Cohen, Michael B., Jonathan A. Kelner, John Peebles, et al.. (2017). Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. DSpace@MIT (Massachusetts Institute of Technology). 410–419. 23 indexed citations

17.

Murtagh, Jack, Omer Reingold, Aaron Sidford, & Salil Vadhan. (2017). Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. 801–812. 4 indexed citations

18.

Kapralov, Michael, et al.. (2017). Single Pass Spectral Sparsification in Dynamic Streams. SIAM Journal on Computing. 46(1). 456–477. 18 indexed citations

19.

Peng, Richard, Aaron Sidford, Michael B. Cohen, et al.. (2016). Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. DSpace@MIT (Massachusetts Institute of Technology). 21 indexed citations

20.

Kelner, Jonathan A., Yin Tat Lee, Lorenzo Orecchia, & Aaron Sidford. (2014). An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations. arXiv (Cornell University). 217–226. 22 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact