Prasad Raghavendra

2.8k total citations
57 papers, 950 citations indexed

About

Prasad Raghavendra is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Prasad Raghavendra has authored 57 papers receiving a total of 950 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computational Theory and Mathematics, 24 papers in Artificial Intelligence and 21 papers in Computer Networks and Communications. Recurrent topics in Prasad Raghavendra's work include Complexity and Algorithms in Graphs (37 papers), Advanced Graph Theory Research (26 papers) and Machine Learning and Algorithms (14 papers). Prasad Raghavendra is often cited by papers focused on Complexity and Algorithms in Graphs (37 papers), Advanced Graph Theory Research (26 papers) and Machine Learning and Algorithms (14 papers). Prasad Raghavendra collaborates with scholars based in United States, Israel and Switzerland. Prasad Raghavendra's co-authors include David Steurer, Venkatesan Guruswami, James R. Lee, Raghu Meka, Parikshit Gopalan, Madhur Tulsiani, Boaz Barak, Ilias Diakonikolas, Joseph Naor and Li-Yang Tan and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and Lecture notes in computer science.

In The Last Decade

Prasad Raghavendra

52 papers receiving 851 citations

Peers

Prasad Raghavendra
David Steurer United States
Guy Kindler Israel
Konstantin Makarychev United States
Yury Makarychev United States
James R. Lee United States
Alex Samorodnitsky Israel
Virginia Vassilevska Williams United States
Daniel M. Kane United States
Samuel Fiorini Belgium
Ravi B. Boppana United States
David Steurer United States
Prasad Raghavendra
Citations per year, relative to Prasad Raghavendra Prasad Raghavendra (= 1×) peers David Steurer

Countries citing papers authored by Prasad Raghavendra

Since Specialization
Citations

This map shows the geographic impact of Prasad Raghavendra'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 Prasad Raghavendra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Prasad Raghavendra more than expected).

Fields of papers citing papers by Prasad Raghavendra

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Prasad Raghavendra. 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 Prasad Raghavendra. The network helps show where Prasad Raghavendra may publish in the future.

Co-authorship network of co-authors of Prasad Raghavendra

This figure shows the co-authorship network connecting the top 25 collaborators of Prasad Raghavendra. A scholar is included among the top collaborators of Prasad Raghavendra 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 Prasad Raghavendra. Prasad Raghavendra is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
2.
Eldan, Ronen, et al.. (2023). Noise Stability on the Boolean Hypercube via a Renormalized Brownian Motion. 661–671. 3 indexed citations
3.
Raghavendra, Prasad, et al.. (2020). Lifting sum-of-squares lower bounds: degree-2 to degree-4. 840–853. 12 indexed citations
4.
Guruswami, Venkatesan, Yury Makarychev, Prasad Raghavendra, David Steurer, & Yuan Zhou. (2018). Finding almost-perfect graph bisections. Figshare. 2011. 321–337.
5.
Becchetti, Luca, Andrea Clementi, Emanuele Natale, et al.. (2017). Friend or Foe? Population Protocols can perform Community Detection. arXiv (Cornell University). 1 indexed citations
6.
Guruswami, Venkatesan, Prasad Raghavendra, Rishi Saket, & Yi Wu. (2016). Bypassing UGC from Some Optimal Geometric Inapproximability Results. ACM Transactions on Algorithms. 12(1). 1–25. 7 indexed citations
7.
Hopkins, Samuel B., et al.. (2015). On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. 1079–1095. 1 indexed citations
8.
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
9.
Hardt, Moritz, et al.. (2014). Computational Limits for Matrix Completion. Conference on Learning Theory. 703–725. 3 indexed citations
10.
Lee, James R., et al.. (2014). On the Power of Symmetric LP and SDP Relaxations. 13–21. 6 indexed citations
11.
Guruswami, Venkatesan, Prasad Raghavendra, Rishi Saket, & Yi Wu. (2012). Bypassing UGC from some Optimal Geometric Inapproximability Results. 699–717. 6 indexed citations
12.
Raghavendra, Prasad, David Steurer, & Madhur Tulsiani. (2012). Reductions between Expansion Problems. 37. 64–73. 36 indexed citations
13.
Azar, Yossi, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, & Prasad Raghavendra. (2011). Buffer Management for Colored Packets with Deadlines. Theory of Computing Systems. 49(4). 738–756. 1 indexed citations
14.
Raghavendra, Prasad & David Steurer. (2010). Graph expansion and the unique games conjecture. 755–764. 97 indexed citations
15.
Raghavendra, Prasad & David Steurer. (2009). Towards computing the Grothendieck constant. Symposium on Discrete Algorithms. 525–534. 16 indexed citations
16.
Gopalan, Parikshit, Venkatesan Guruswami, & Prasad Raghavendra. (2009). List decoding tensor products and interleaved codes. 13–22. 7 indexed citations
17.
Azar, Yossi, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, & Prasad Raghavendra. (2009). Buffer management for colored packets with deadlines. 319–327. 2 indexed citations
18.
Raghavendra, Prasad & David Steurer. (2009). Towards Computing the Grothendieck Constant. 525–534. 14 indexed citations
19.
Raghavendra, Prasad. (2007). A Note on Yekhanin's Locally Decodable Codes. Electronic colloquium on computational complexity. 14(2-3). 259–71. 18 indexed citations
20.
Guruswami, Venkatesan & Prasad Raghavendra. (2006). Hardness of Learning Halfspaces with Noise. 543–552. 36 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

Breakdown of academic impact, for papers by David Steurer Breakdown of academic impact, for papers by Guy Kindler Breakdown of academic impact, for papers by Konstantin Makarychev Breakdown of academic impact, for papers by Yury Makarychev Breakdown of academic impact, for papers by James R. Lee Breakdown of academic impact, for papers by Alex Samorodnitsky Breakdown of academic impact, for papers by Virginia Vassilevska Williams Breakdown of academic impact, for papers by Daniel M. Kane Breakdown of academic impact, for papers by Samuel Fiorini Breakdown of academic impact, for papers by Ravi B. Boppana
Rankless by CCL
2026