World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
36
Citations
4499
World Ranking
11372
National Ranking
4679

Prasad Raghavendra publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Prasad Raghavendra sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 90 publications — 6th percentile

6% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Prasad Raghavendra D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Prasad Raghavendra sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 36 D-Index — 23rd percentile

23% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Research.com Recognitions

  • 2012 - Fellow of Alfred P. Sloan Foundation

Overview

Prasad Raghavendra is a researcher primarily affiliated with the University of California, Berkeley in the United States. Their research is situated within the broad field of Computer Science, with significant contributions across multiple subfields including Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Statistics and Probability, and Statistical and Nonlinear Physics.

Their main areas of work focus on complexity and algorithms in graphs, machine learning and algorithms, advanced graph theory research, complex network analysis techniques, Markov chains and Monte Carlo methods, graph labeling and dimension problems, as well as optimization and search problems.

Some recent publications by Prasad Raghavendra include the following papers:

  • Symmetries and Complexity (Invited Talk), 2021, arXiv (Cornell University)
  • Randomness Efficient Noise Stability and Generalized Small Bias Sets, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • List Decodable Subspace Recovery, 2020, arXiv (Cornell University)
  • Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs, 2021, SIAM Journal on Computing
  • Matrix Discrepancy from Quantum Communication, 2021, arXiv (Cornell University)

The researcher has worked frequently with co-authors including Sidhanth Mohanty, Raghu Meka, David X. Wu, Jess Banks, and Jonah Brown-Cohen. Sidhanth Mohanty stands out as the most frequent collaborator with four joint publications.

Prasad Raghavendra's research contributions have been disseminated mainly through venues such as:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • SIAM Journal on Computing
  • Zenodo (CERN European Organization for Nuclear Research)

In 2012, they were recognized as a Fellow of the Alfred P. Sloan Foundation, an award that indicates notable contributions to their scientific discipline.

Best Publications

  • Optimal algorithms and inapproximability results for every CSP

    Prasad Raghavendra

  • Graph expansion and the unique games conjecture

    Prasad Raghavendra;David Steurer

  • Hardness of Learning Halfspaces with Noise

    Venkatesan Guruswami;Prasad Raghavendra

  • Lower Bounds on the Size of Semidefinite Programming Relaxations

    James R. Lee;Prasad Raghavendra;David Steurer

  • Rounding Semidefinite Programming Hierarchies via Global Correlation.

    Boaz Barak;Prasad Raghavendra;David Steurer

  • Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph

    V. Guruswami;R. Manokaran;P. Raghavendra

  • Reductions between Expansion Problems

    Prasad Raghavendra;David Steurer;Madhur Tulsiani

  • The Power of Sum-of-Squares for Detecting Hidden Structures

    Samuel B. Hopkins;Pravesh K. Kothari;Aaron Potechin;Prasad Raghavendra

  • Agnostic Learning of Monomials by Halfspaces Is Hard

    Vitaly Feldman;Venkatesan Guruswami;Prasad Raghavendra;Yi Wu

  • Approximating CSPs with global cardinality constraints using SDP hierarchies

    Prasad Raghavendra;Ning Tan

  • Approximate Constraint Satisfaction Requires Large LP Relaxations

    Siu On Chan;James R. Lee;Prasad Raghavendra;David Steurer

  • Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES

    Prasad Raghavendra;David Steurer

  • Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant

    Venkatesan Guruswami;Johan HÅstad;Rajsekar Manokaran;Prasad Raghavendra

  • Many sparse cuts via higher eigenvalues

    Anand Louis;Prasad Raghavendra;Prasad Tetali;Santosh Vempala

  • Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling

    Rajsekar Manokaran;Joseph (Seffi) Naor;Prasad Raghavendra;Roy Schwartz

  • How to Round Any CSP

    Prasad Raghavendra;David Steurer

  • Making the Long Code Shorter

    Boaz Barak;Parikshit Gopalan;Johan Hastad;Raghu Meka

  • Approximations for the isoperimetric and spectral profile of graphs and related parameters

    Prasad Raghavendra;David Steurer;Prasad Tetali

  • Approximating np-hard problems efficient algorithms and their limits

    Venkatesan Guruswami;Prasad Raghavendra

  • A Note on Yekhanin's Locally Decodable Codes

    Prasad Raghavendra

  • Strongly refuting random CSPs below the spectral threshold

    Prasad Raghavendra;Satish Rao;Tselil Schramm

Frequent Co-Authors

David Steurer
David Steurer ETH Zurich
Venkatesan Guruswami
Venkatesan Guruswami University of California, Berkeley
James R. Lee
James R. Lee University of Washington
Boaz Barak
Boaz Barak Harvard University
Luca Trevisan
Luca Trevisan Bocconi University
Johan Håstad
Johan Håstad Royal Institute of Technology
Santosh Vempala
Santosh Vempala Georgia Institute of Technology
Vitaly Feldman
Vitaly Feldman Apple (United States)
Prasad Tetali
Prasad Tetali Carnegie Mellon University
Ilias Diakonikolas
Ilias Diakonikolas University of Wisconsin–Madison

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens doors to closely related fields and online degree options. Today, students can pursue online programs not just in computer science, but in areas like engineering, physics, and data science. For those interested in engineering, check out the cheapest online master’s mechanical engineering programs. These offer technical foundations, with flexibility to study remotely.

Wondering can you get a physics degree online? Yes, many U.S. universities now provide affordable online physics degrees. These programs cover theory and practical skills, often paired with virtual labs.

Data science is another high-demand pathway. A data scientist degree can lead to roles in artificial intelligence, machine learning, and analytics—areas with strong job growth.

If you’re drawn to electrical engineering, electrical engineering online tuition costs are increasingly competitive, enabling broader access to a vital STEM field.

These related online degrees make it easier for students to tailor their education and career pathway—no matter where they are located.

Best Scientists Citing Prasad Raghavendra

Trending Scientists

Recently Published Articles