David Steurer
Impact in
- Computational Mathematics top 1%
- Tensor decomposition and applications
- Computational Theory and Mathematics top 0.5%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Complexity and Algorithms in Graphs 27
- Advanced Graph Theory Research 20
- Computability, Logic, AI Algorithms 5
-
- Machine Learning and Algorithms 13
- Co-authors
- Prasad Raghavendra (16 shared papers)Irit Dinur (4 shared papers)Boaz Barak (12 shared papers)Samuel B. Hopkins (3 shared papers)Sanjeev Arora (2 shared papers)Sanjeev Arora (5 shared papers)Jonathan A. Kelner (2 shared papers)James R. Lee (3 shared papers)
- Journals
- Computational Complexity (1 paper)ACM Transactions on Algorithms (1 paper)SIAM Journal on Computing (1 paper)Mathematics of Operations Research (1 paper)Journal of the ACM (1 paper)
- Partner nations
- United StatesIsraelSwitzerland
In The Last Decade
David Steurer
46 papers receiving 1.0k citations
Peers
Comparison fields: 5 of 66
- Computational Mathematics 84
- Computational Theory and Mathematics 707
- Computer Graphics and Computer-Aided Design 93
- Discrete Mathematics and Combinatorics 53
- Numerical Analysis 86
Countries citing papers authored by David Steurer
This map shows the geographic impact of David Steurer'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 David Steurer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Steurer more than expected).
Fields of papers citing papers by David Steurer
This network shows the impact of papers produced by David Steurer. 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 David Steurer. The network helps show where David Steurer may publish in the future.
Co-authors
The 25 scholars most cited alongside David Steurer, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 47 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2014 | 150 | |
| 2 | 2010 | 97 | |
| 3 | 2010 | 64 | |
| 4 | 2015 | 51 | |
| 5 | 2015 | 47 | |
| 6 | 2017 | 47 | |
| 7 | 2009 | 45 | |
| 8 | 2008 | 40 | |
| 9 | 2016 | 37 | |
| 10 | Tensor principal component analysis via sum-of-square proofs. | 2015 | 36 |
| 11 | 2012 | 36 | |
| 12 | 2009 | 31 | |
| 13 | 2012 | 31 | |
| 14 | 2018 | 30 | |
| 15 | 2014 | 29 | |
| 16 | 2008 | 28 | |
| 17 | 2015 | 25 | |
| 18 | 2015 | 24 | |
| 19 | 2009 | 23 | |
| 20 | 2010 | 22 |
About David Steurer
David Steurer is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Numerical Analysis and Computational Mathematics, having authored 47 papers that have together received 1.1k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (27 papers), Advanced Graph Theory Research (20 papers), Machine Learning and Algorithms (13 papers), Optimization and Search Problems (9 papers), Tensor decomposition and applications (5 papers), Advanced Optimization Algorithms Research (5 papers), Computability, Logic, AI Algorithms (5 papers) and Sparse and Compressive Sensing Techniques (5 papers). The work is most often cited by research in Computational Mathematics (84 citations), Computational Theory and Mathematics (707 citations), Computer Graphics and Computer-Aided Design (93 citations), Discrete Mathematics and Combinatorics (53 citations) and Numerical Analysis (86 citations). David Steurer has collaborated with scholars based in United States, Israel and Switzerland. Frequent co-authors include Prasad Raghavendra, Irit Dinur, Boaz Barak, Samuel B. Hopkins, Sanjeev Arora, Sanjeev Arora, Jonathan A. Kelner, James R. Lee, Jonathan Shi and Madhur Tulsiani. Their work appears in journals such as Computational Complexity, ACM Transactions on Algorithms, SIAM Journal on Computing, Mathematics of Operations Research and Journal of the ACM.
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.