Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Physical One-Way Functions
20021.3k citationsBen Recht, Jason Taylor et al.Scienceprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Ben Recht'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 Ben Recht with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ben Recht more than expected).
This network shows the impact of papers produced by Ben Recht. 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 Ben Recht. The network helps show where Ben Recht may publish in the future.
Co-authorship network of co-authors of Ben Recht
This figure shows the co-authorship network connecting the top 25 collaborators of Ben Recht.
A scholar is included among the top collaborators of Ben Recht 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 Ben Recht. Ben Recht is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
18 of 18 papers shown
1.
Wilson, Ashia, Ben Recht, & Michael I. Jordan. (2021). A Lyapunov Analysis of Accelerated Methods in Optimization. Journal of Machine Learning Research. 22(113). 1–34.30 indexed citations
2.
Aravkin, Aleksandr Y., et al.. (2013). An SVD-free Pareto curve approach to rank minimization. arXiv (Cornell University).1 indexed citations
3.
Aravkin, Aleksandr Y., Rajiv Kumar, Hassan Mansour, Ben Recht, & Felix J. Herrmann. (2013). A robust SVD-free approach to matrix completion, with applications to interpolation of large scale data. arXiv (Cornell University).4 indexed citations
Jamieson, Kevin, Robert D. Nowak, & Ben Recht. (2012). Query Complexity of Derivative-Free Optimization. Neural Information Processing Systems. 25. 2672–2680.18 indexed citations
6.
Recht, Ben, Christopher Ré, Joel A. Tropp, & Victor Bittorf. (2012). Factoring nonnegative matrices with linear programs. Neural Information Processing Systems. 25. 1214–1222.83 indexed citations
Lee, Jason D., Ben Recht, Nathan Srebro, Joel A. Tropp, & Ruslan Salakhutdinov. (2010). Practical Large-Scale Optimization for Max-norm Regularization. CaltechAUTHORS (California Institute of Technology). 23. 1297–1305.79 indexed citations
10.
Goldberg, Andrew B., Ben Recht, Junming Xu, Robert D. Nowak, & Xiaojin Zhu. (2010). Transduction with Matrix Completion: Three Birds with One Stone. Neural Information Processing Systems. 23. 757–765.132 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.