Prasad Raghavendra
- Computational Theory and Mathematics top 0.5%
- Artificial Intelligence top 5%
- Computer Networks and Communications top 5%
- Computer Graphics and Computer-Aided Design top 2%
- Numerical Analysis top 10%
- Co-authors
- David SteurerVenkatesan GuruswamiJames R. LeeRaghu MekaParikshit GopalanMadhur TulsianiBoaz BarakIlias Diakonikolas
- Topics
- Complexity and Algorithms in Graphs (37 papers)Advanced Graph Theory Research (26 papers)Machine Learning and Algorithms (14 papers)
- Cited by
- Computational Theory and MathematicsComputational MathematicsComputer Graphics and Computer-Aided Design
- Partner nations
- United StatesIsraelSwitzerland
In The Last Decade
Prasad Raghavendra
52 papers receiving 851 citations
Peers
Comparison fields: 5 of 60
- Computational Theory and Mathematics 689
- Artificial Intelligence 358
- Computer Networks and Communications 256
- Computer Graphics and Computer-Aided Design 101
- Numerical Analysis 71
Countries citing papers authored by Prasad Raghavendra
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 3 | |
| 3 | 12 | |
| 4 | 0 | |
| 5 | Friend or Foe? Population Protocols can perform Community Detection | 1 |
| 6 | 7 | |
| 7 | 1 | |
| 8 | 15 | |
| 9 | Computational Limits for Matrix Completion | 3 |
| 10 | 6 | |
| 11 | 6 | |
| 12 | 36 | |
| 13 | 1 | |
| 14 | 97 | |
| 15 | 16 | |
| 16 | 7 | |
| 17 | 2 | |
| 18 | 14 | |
| 19 | 18 | |
| 20 | 36 |
About Prasad Raghavendra
Prasad Raghavendra is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computational Mathematics, having authored 57 papers that have together received 950 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (37 papers), Advanced Graph Theory Research (26 papers) and Machine Learning and Algorithms (14 papers). The work is most often cited by research in Computational Theory and Mathematics (689 citations), Computational Mathematics (19 citations) and Computer Graphics and Computer-Aided Design (101 citations). Prasad Raghavendra has collaborated with scholars based in United States, Israel and Switzerland. Frequent 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. Their work appears in journals such as Mathematical Programming, SIAM Journal on Computing and Lecture notes in computer science.
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.