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).
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.
Carmon, Yair, et al.. (2019). A Rank-1 Sketch for Matrix Multiplicative Weights. Conference on Learning Theory. 589–623.2 indexed citations
6.
Sidford, Aaron, Mengdi Wang, Lin F. Yang, & Yinyu Ye. (2019). Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity. International Conference on Artificial Intelligence and Statistics. 2992–3002.2 indexed citations
7.
Bubeck, Sébastien, et al.. (2019). Near-optimal method for highly smooth convex optimization. Conference on Learning Theory. 492–507.6 indexed citations
8.
Bubeck, Sébastien, et al.. (2019). Complexity of Highly Parallel Non-Smooth Convex Optimization. Neural Information Processing Systems. 32. 13900–13909.1 indexed citations
9.
Carmon, Yair, et al.. (2019). Variance Reduction for Matrix Games. Neural Information Processing Systems. 32. 11381–11392.5 indexed citations
10.
Sidford, Aaron, Mengdi Wang, Xian Wu, Lin F. Yang, & Yinyu Ye. (2018). Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model. neural information processing systems. 31. 5186–5196.26 indexed citations
11.
Jain, Prateek, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, & Aaron Sidford. (2018). Accelerating Stochastic Gradient Descent for Least Squares Regression. Conference on Learning Theory. 545–604.5 indexed citations
Jain, Prateek, Chi Jin, Sham M. Kakade, Praneeth Netrapalli, & Aaron Sidford. (2016). Matching Matrix Bernstein with Little Memory: Near-Optimal Finite Sample Guarantees for Oja's Algorithm.. arXiv (Cornell University).2 indexed citations
15.
Jain, Prateek, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, & Aaron Sidford. (2016). Parallelizing Stochastic Approximation Through Mini-Batching and Tail-Averaging.. arXiv (Cornell University).4 indexed citations
16.
Garber, Dan, Elad Hazan, Chi Jin, et al.. (2016). Faster eigenvector computation via shift-and-invert preconditioning. 2626–2634.2 indexed citations
17.
Cohen, Michael B., Yin Tat Lee, Gary L. Miller, Jakub Pachocki, & Aaron Sidford. (2016). Geometric median in nearly linear time. 9–21.53 indexed citations
18.
Frostig, Roy, Rong Ge, Sham M. Kakade, & Aaron Sidford. (2015). Competing with the Empirical Risk Minimizer in a Single Pass. Conference on Learning Theory. 728–763.24 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.