World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
73
Citations
19787
World Ranking
1602
National Ranking
834

Salil P. Vadhan 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 Salil P. Vadhan 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: 209 publications — 49th percentile

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

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

Salil P. Vadhan 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 Salil P. Vadhan 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: 73 D-Index — 89th percentile

89% 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

  • 2018 - ACM Fellow For advancing computational complexity and cryptography, and for promoting public support for theoretical computer science
  • 2007 - Fellow of John Simon Guggenheim Memorial Foundation
  • 2002 - Fellow of Alfred P. Sloan Foundation

Overview

Salil P. Vadhan is a researcher affiliated with Harvard University in the United States. Their work is primarily situated within the field of Computer Science, with notable contributions across multiple subfields including Artificial Intelligence, Computational Theory and Mathematics, Statistics and Probability, Computer Networks and Communications, and Sociology and Political Science.

Their research topics encompass a range of areas with a strong focus on data privacy and security. Key themes in their work include Privacy-Preserving Technologies in Data, Cryptography and Data Security, Complexity and Algorithms in Graphs, Markov Chains and Monte Carlo Methods, Coding Theory and Cryptography, Adversarial Robustness in Machine Learning, and Advanced Causal Inference Techniques.

Salil P. Vadhan has published extensively, with some of the recent papers including:

  • Differentially Private Simple Linear Regression (2022) in Proceedings on Privacy Enhancing Technologies
  • Widespread Underestimation of Sensitivity in Differentially Private Libraries and How to Fix It (2022) in Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
  • PCPs and the Hardness of Generating Synthetic Data (2020) in Journal of Cryptology
  • Harnessing the Known Unknowns: Differential Privacy and the 2020 Census (2022) in Harvard Data Science Review
  • A standardised differential privacy framework for epidemiological modeling with mobile phone data (2023) in PLOS Digital Health

Frequent co-authors in their research include Omer Reingold, Edward Pyne, Wanrong Zhang, Jack Murtagh, and Jayshree Sarathy. These collaborations reflect ongoing involvement in research communities focused on privacy, cryptography, and algorithms.

The venues in which they have frequently published reveal the breadth and focus of their scholarship. These include arXiv (Cornell University), Leibniz-Zentrum für Informatik (Schloss Dagstuhl), Proceedings on Privacy Enhancing Technologies, Theory of Computing, and Oberwolfach Reports.

Salil P. Vadhan has been recognized with several awards during their career, including being named an ACM Fellow in 2018 for advancing computational complexity and cryptography and for promoting public support for theoretical computer science. Earlier recognitions include fellowships from the John Simon Guggenheim Memorial Foundation in 2007 and the Alfred P. Sloan Foundation in 2002.

Best Publications

  • On the (im)possibility of obfuscating programs

    Boaz Barak;Oded Goldreich;Russell Impagliazzo;Steven Rudich

  • Boosting and Differential Privacy

    Cynthia Dwork;Guy N. Rothblum;Salil Vadhan

  • Verifiable random functions

    S. Micali;M. Rabin;S. Vadhan

  • Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

    Eli Ben-Sasson;Oded Goldreich;Prahladh Harsha;Madhu Sudan

  • Pseudorandom generators without the XOR lemma

    M. Sudan;L. Trevisan;S. Vadhan

  • Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors

    Omer Reingold;Salil P. Vadhan;Avi Wigderson

  • Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes

    Venkatesan Guruswami;Christopher Umans;Salil Vadhan

  • Proofs of Retrievability via Hardness Amplification

    Yevgeniy Dodis;Salil Vadhan;Daniel Wichs

  • Improved Delegation of Computation using Fully Homomorphic Encryption.

    Kai-Min Chung;Yael Tauman Kalai;Salil P. Vadhan

  • On the complexity of differentially private data release: efficient algorithms and hardness results

    Cynthia Dwork;Moni Naor;Omer Reingold;Guy N. Rothblum

  • Entropy waves, the zig-zag graph product, and new constant-degree expanders

    Omer Reingold;Salil Vadhan;Avi Wigderson

  • Notions of Reducibility between Cryptographic Primitives

    Omer Reingold;Luca Trevisan;Salil P. Vadhan

  • The Complexity of Counting in Sparse, Regular, and Planar Graphs

    Salil P. Vadhan

  • Computational Differential Privacy

    Ilya Mironov;Omkant Pandey;Omer Reingold;Salil Vadhan

  • The Complexity of Differential Privacy

    Salil P. Vadhan

  • The Limits of Two-Party Differential Privacy.

    Andrew McGregor;Ilya Mironov;Toniann Pitassi;Omer Reingold

  • Extracting all the randomness and reducing the error in Trevisan's extractors

    Ran Raz;Omer Reingold;Salil Vadhan

  • Randomness conductors and constant-degree lossless expanders

    Michael Capalbo;Omer Reingold;Salil Vadhan;Avi Wigderson

  • Extracting randomness from samplable distributions

    L. Trevisan;S. Vadhan

  • The power of a pebble: exploring and mapping directed graphs

    Michael A. Bender;Antonio Fernández;Dana Ron;Amit Sahai

  • Proceedings of the 43rd annual ACM symposium on Theory of computing

    Lance Fortnow;Salil Vadhan

  • Pseudorandom Generators without the XOR Lemma (Abstract).

    Madhu Sudan;Luca Trevisan;Salil P. Vadhan

Frequent Co-Authors

Omer Reingold
Omer Reingold Stanford University
Oded Goldreich
Oded Goldreich Weizmann Institute of Science
Luca Trevisan
Luca Trevisan Bocconi University
Amit Sahai
Amit Sahai University of California, Los Angeles
Boaz Barak
Boaz Barak Harvard University
Jonathan Ullman
Jonathan Ullman Northeastern University
Avi Wigderson
Avi Wigderson Institute for Advanced Study
David Zuckerman
David Zuckerman The University of Texas at Austin
Madhu Sudan
Madhu Sudan Harvard University
Kobbi Nissim
Kobbi Nissim Georgetown University

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

Pursuing a Computer Science degree in the USA opens up diverse opportunities, especially with the rise of affordable and flexible online education. Many related online degrees help students tailor their expertise and boost employability in specialized fields.

For those interested in digital safety, an online cybersecurity degree provides a strong foundation in protecting data and systems against cyber threats. Students interested in the intersection of technology and the built environment may consider an online construction management degree, which blends project management with technical skills.

Another popular choice is the cheapest criminal justice degree online. This pathway is ideal for those looking to combine technology skills with public service roles such as cybersecurity within law enforcement. Similarly, students focused on business and technology may benefit from an online accountant degree, preparing them for data-driven decision-making in finance.

Exploring these related degrees can expand your knowledge and career options beyond traditional computer science roles.

Best Scientists Citing Salil P. Vadhan

Trending Scientists

Recently Published Articles