Salil Vadhan

14.2k total citations · 1 hit paper
137 papers, 4.2k citations indexed

About

Salil Vadhan is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Salil Vadhan has authored 137 papers receiving a total of 4.2k indexed citations (citations by other indexed papers that have themselves been cited), including 109 papers in Artificial Intelligence, 80 papers in Computational Theory and Mathematics and 18 papers in Computer Networks and Communications. Recurrent topics in Salil Vadhan's work include Cryptography and Data Security (71 papers), Complexity and Algorithms in Graphs (63 papers) and Privacy-Preserving Technologies in Data (35 papers). Salil Vadhan is often cited by papers focused on Cryptography and Data Security (71 papers), Complexity and Algorithms in Graphs (63 papers) and Privacy-Preserving Technologies in Data (35 papers). Salil Vadhan collaborates with scholars based in United States, Israel and Singapore. Salil Vadhan's co-authors include Omer Reingold, Luca Trevisan, Cynthia Dwork, Guy N. Rothblum, Madhu Sudan, Avi Wigderson, Lance Fortnow, M. O. Rabin, Silvio Micali and Oded Goldreich and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and The Annals of Statistics.

In The Last Decade

Salil Vadhan

132 papers receiving 3.9k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Boosting and Differential Privacy

2010 380 citations Salil Vadhan et al. profile →

Peers

Countries citing papers authored by Salil Vadhan

Since Specialization

Citations

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

Fields of papers citing papers by Salil Vadhan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Salil Vadhan

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

#	Work	Indexed citations
1	"I inherently just trust that it works": Investigating Mental Models of Open-Source Libraries for Differential Privacy 2024 ·Proceedings of the ACM on Human-Computer Interaction ·(unknown), (unknown), (unknown), Salil Vadhan	1
2	Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract) 2021 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·(unknown), Salil Vadhan	3
3	2021 ·Theory of Computing ·Jack Murtagh, Omer Reingold, Aaron Sidford, Salil Vadhan	1
4	Differential Privacy: A Primer for a Non-Technical Audience 2018 ·Digital Access to Scholarship at Harvard (DASH) (Harvard University) ·Alexandra Wood, Micah Altman, (unknown), Mark Bun, Marco Gaboardi, James Honaker, Kobbi Nissim, (unknown), Thomas Steinke, Salil Vadhan	13
5	Bridging the Gap between Computer Science and Legal Approaches to Privacy 2018 ·Digital Access to Scholarship at Harvard (DASH) (Harvard University) ·Kobbi Nissim, (unknown), Alexandra Wood, Mark Bun, Marco Gaboardi, Urs Gasser, (unknown), Salil Vadhan, Thomas Steinke	24
6	2018 ·Theory of Computing ·Jack Murtagh, Salil Vadhan	2
7	On Learning vs. Refutation 2017 ·Digital Access to Scholarship at Harvard (DASH) (Harvard University) ·Salil Vadhan	2
8	A Uniform Min-Max Theorem with Applications in Cryptography. 2013 ·Electronic colloquium on computational complexity ·(unknown), Salil Vadhan	0
9	2013 ·Theory of Computing ·Kai-Min Chung, Michael Mitzenmacher, Salil Vadhan	13
10	The Limits of Two-Party Differential Privacy. 2011 ·Electronic colloquium on computational complexity ·Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil Vadhan	18
11	Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions. 2011 ·Digital Access to Scholarship at Harvard (DASH) (Harvard University) ·Salil Vadhan, (unknown)	1
12	Why simple hash functions work: exploiting the entropy in a data stream 2008 ·Symposium on Discrete Algorithms ·Michael Mitzenmacher, Salil Vadhan	67
13	Theory of Cryptography : 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, the Netherlands, February 21-24, 2007 : proceedings 2007 ·Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) ·Salil Vadhan	13
14	Zero knowledge with efficient provers 2006 ·(unknown), Salil Vadhan	10
15	An Unconditional Study of Computational Zero Knowledge. 2006 ·Electronic colloquium on computational complexity ·Salil Vadhan	6
16	Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem 2005 ·Electronic colloquium on computational complexity ·Omer Reingold, Luca Trevisan, Salil Vadhan	6
17	Derandomized Squaring of Graphs 2005 ·Electronic colloquium on computational complexity ·(unknown), Salil Vadhan	1
18	Statistical zero-knowledge proofs with efficient provers: Lattice problems and more 2003 ·Daniele Micciancio, Salil Vadhan	2
19	An Improved Pseudorandom Generator Based on Hardness of Factoring 2002 ·Lecture notes in computer science ·(unknown), Leonid Reyzin, Salil Vadhan	0
20	Extracting all the Randomness from a Weakly Random Source 1998 ·DSpace@MIT (Massachusetts Institute of Technology) ·Salil Vadhan	6

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