What is he best known for?
The fields of study he is best known for:
- Statistics
- Algorithm
- Algebra
The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Mathematical proof, Theoretical computer science and Cryptography.
His Discrete mathematics research includes elements of Entropy and Pseudorandom generator.
His studies deal with areas such as Random number generation, PCP theorem and Pseudorandomness as well as Combinatorics.
Salil Vadhan has researched Mathematical proof in several fields, including Time complexity and Coding.
His work deals with themes such as Random oracle, Hash function, Algorithm and Rolling hash, Double hashing, which intersect with Theoretical computer science.
His research in Cryptography intersects with topics in Function, Homomorphic encryption, Differential privacy and Synthetic data.
His most cited work include:
- On the (Im)possibility of Obfuscating Programs (916 citations)
- Boosting and Differential Privacy (489 citations)
- On the (im)possibility of obfuscating programs (434 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Discrete mathematics, Combinatorics, Theoretical computer science, Mathematical proof and Cryptography.
Salil Vadhan studies Time complexity which is a part of Discrete mathematics.
The Combinatorics study combines topics in areas such as Function, Pseudorandomness and Constant.
His Theoretical computer science research integrates issues from Random oracle, Hash function, Differential privacy and Encryption.
His work investigates the relationship between Encryption and topics such as Obfuscation that intersect with problems in Pseudorandom function family and Homomorphic encryption.
His work on Interactive proof system and Probabilistically checkable proof is typically connected to Bounded function as part of general Mathematical proof study, connecting several disciplines of science.
He most often published in these fields:
- Discrete mathematics (52.26%)
- Combinatorics (32.40%)
- Theoretical computer science (17.77%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (32.40%)
- Differential privacy (13.24%)
- Discrete mathematics (52.26%)
In recent papers he was focusing on the following fields of study:
His main research concerns Combinatorics, Differential privacy, Discrete mathematics, Pseudorandom number generator and Laplace operator.
His Combinatorics research incorporates themes from Square and Synthetic data.
His study in Differential privacy is interdisciplinary in nature, drawing from both Theoretical computer science, Time complexity, Constraint, Variety and Internet privacy.
His Theoretical computer science study incorporates themes from Computational complexity theory, Probabilistic encryption and Plaintext-aware encryption.
In his research, Entropy is intimately related to Entropy, which falls under the overarching field of Discrete mathematics.
His work on Pseudorandom generator as part of general Pseudorandom number generator research is often related to Prefix, thus linking different fields of science.
Between 2016 and 2021, his most popular works were:
- The Complexity of Differential Privacy (84 citations)
- Finite Sample Differentially Private Confidence Intervals (29 citations)
- Differential Privacy: A Primer for a Non-Technical Audience (26 citations)
In his most recent research, the most cited papers focused on:
- Statistics
- Algorithm
- Algebra
His scientific interests lie mostly in Differential privacy, Theoretical computer science, Variety, Combinatorics and Binary logarithm.
His studies in Differential privacy integrate themes in fields like Time complexity, Model of computation and Representation.
His Theoretical computer science study combines topics in areas such as Computational complexity theory, Plaintext and Cryptography.
His Variety research is multidisciplinary, relying on both Privacy protection, Internet privacy and Personally identifiable information.
His work on Randomized algorithm as part of general Combinatorics study is frequently linked to Laplace operator, bridging the gap between disciplines.
Salil Vadhan has included themes like Pseudorandom generator and Pseudorandomness in his Binary logarithm study.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
