David Steurer

3.4k total citations
47 papers, 1.1k citations indexed

About

David Steurer is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, David Steurer has authored 47 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Computational Theory and Mathematics, 20 papers in Artificial Intelligence and 12 papers in Computer Networks and Communications. Recurrent topics in David Steurer's work include Complexity and Algorithms in Graphs (27 papers), Advanced Graph Theory Research (20 papers) and Machine Learning and Algorithms (13 papers). David Steurer is often cited by papers focused on Complexity and Algorithms in Graphs (27 papers), Advanced Graph Theory Research (20 papers) and Machine Learning and Algorithms (13 papers). David Steurer collaborates with scholars based in United States, Israel and Switzerland. David Steurer's co-authors include Prasad Raghavendra, Irit Dinur, Boaz Barak, Samuel B. Hopkins, Sanjeev Arora, Jonathan A. Kelner, Sanjeev Arora, James R. Lee, Jonathan Shi and Madhur Tulsiani and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

David Steurer

46 papers receiving 1.0k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
David Steurer United States	21	707	383	264	126	121	47	1.1k
Yin Tat Lee United States	18	373 0.5×	338 0.9×	211 0.8×	99 0.8×	99 0.8×	46	816
Ankur Moitra United States	18	265 0.4×	537 1.4×	178 0.7×	224 1.8×	102 0.8×	63	1.2k
Alexander Barvinok United States	20	632 0.9×	289 0.8×	107 0.4×	168 1.3×	315 2.6×	63	1.5k
Prasad Raghavendra United States	19	689 1.0×	358 0.9×	256 1.0×	48 0.4×	66 0.5×	57	950
Peter Bürgisser Germany	15	822 1.2×	359 0.9×	62 0.2×	136 1.1×	84 0.7×	63	1.3k
Ravindran Kannan United States	14	336 0.5×	330 0.9×	93 0.4×	119 0.9×	55 0.5×	28	848
Yuri Rabinovich Israel	14	631 0.9×	265 0.7×	325 1.2×	102 0.8×	50 0.4×	38	1.2k
Raghu Meka United States	17	305 0.4×	332 0.9×	79 0.3×	270 2.1×	83 0.7×	48	792
Daniel M. Kane United States	15	271 0.4×	460 1.2×	145 0.5×	125 1.0×	110 0.9×	89	841
James R. Lee United States	17	668 0.9×	189 0.5×	254 1.0×	61 0.5×	65 0.5×	55	1.1k

Countries citing papers authored by David Steurer

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of David Steurer

This figure shows the co-authorship network connecting the top 25 collaborators of David Steurer. A scholar is included among the top collaborators of David Steurer 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 David Steurer. David Steurer 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

Kothari, Pravesh K., et al.. (2023). Algorithms Approaching the Threshold for Semi-random Planted Clique. 1918–1926. 4 indexed citations

Guruswami, Venkatesan, Yury Makarychev, Prasad Raghavendra, David Steurer, & Yuan Zhou. (2018). Finding almost-perfect graph bisections. Figshare. 2011. 321–337.

Hopkins, Samuel B., Jonathan Shi, & David Steurer. (2015). Tensor principal component analysis via sum-of-square proofs.. Conference on Learning Theory. 956–1006. 36 indexed citations

Arora, Sanjeev, Boaz Barak, & David Steurer. (2015). Subexponential Algorithms for Unique Games and Related Problems. Journal of the ACM. 62(5). 1–25. 25 indexed citations

Barak, Boaz, Ankur Moitra, Ryan O’Donnell, et al.. (2015). Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15 indexed citations

Barak, Boaz, Jonathan A. Kelner, & David Steurer. (2015). Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. 143–151. 47 indexed citations

Dinur, Irit, David Steurer, & Thomas Vidick. (2015). A parallel repetition theorem for entangled projection games. Computational Complexity. 24(2). 201–254. 14 indexed citations

Barak, Boaz & David Steurer. (2014). Sum-of-squares proofs and the quest toward optimal algorithms.. arXiv (Cornell University). 21. 59. 3 indexed citations

Lee, James R., et al.. (2014). On the Power of Symmetric LP and SDP Relaxations. 13–21. 6 indexed citations

10.

Barak, Boaz, Guy Kindler, & David Steurer. (2013). On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction. 197–214. 15 indexed citations

11.

Raghavendra, Prasad, David Steurer, & Madhur Tulsiani. (2012). Reductions between Expansion Problems. 37. 64–73. 36 indexed citations

12.

Barak, Boaz, et al.. (2012). Hypercontractivity, sum-of-squares proofs, and their applications. arXiv (Cornell University). 307–326. 3 indexed citations

13.

Barak, Boaz, Prasad Raghavendra, & David Steurer. (2011). Rounding Semidefinite Programming Hierarchies via Global Correlation. arXiv (Cornell University). 18. 472–481. 3 indexed citations

14.

Arora, Sanjeev, Russell Impagliazzo, William Matthews, & David Steurer. (2010). Improved Algorithms for Unique Games via Divide and Conquer.. Electronic colloquium on computational complexity. 17. 41. 6 indexed citations

15.

Raghavendra, Prasad & David Steurer. (2010). Graph expansion and the unique games conjecture. 755–764. 97 indexed citations

16.

Arora, Sanjeev, Boaz Barak, & David Steurer. (2010). Subexponential Algorithms for Unique Games and Related Problems. 563–572. 64 indexed citations

17.

Steurer, David & Nisheeth K. Vishnoi. (2009). Connections Between Unique Games and Multicut.. Electronic colloquium on computational complexity. 16. 125. 3 indexed citations

18.

Raghavendra, Prasad & David Steurer. (2009). Towards computing the Grothendieck constant. Symposium on Discrete Algorithms. 525–534. 16 indexed citations

19.

Barak, Boaz, Moritz Hardt, Thomas Holenstein, & David Steurer. (2009). Subsampling Semidefinite Programs and Max-Cut on the Sphere. 1 indexed citations

20.

Raghavendra, Prasad & David Steurer. (2009). Towards Computing the Grothendieck Constant. 525–534. 14 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