Sanjeev Khanna
Artificial Intelligence · 2000–2014
A researcher in the Science corpus: 7 papers; trusts 11 researchers and is trusted by 65 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 36 citations into it; #3,997 of 35,345 by trust here, #5,638 by citations
- Privacy & Security — 22 citations into it; #333 of 709 by trust here, #240 by citations
Whom Sanjeev Khanna trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Cynthia Dwork
- Anupam Gupta
- Moritz Hardt
- George L. Nemhauser
- Frank McSherry
- Silvano Martello
- Aaron Roth
- Kobbi Nissim
Who trusts Sanjeev Khanna overall
- Graham Cormode
- Gruia Calinescu
- Gurmeet Singh Manku
- Joseph M Hellerstein
- Aranyak Mehta
- Sudipto Guha
- Arvind Arasu
- S. Muthu Muthukrishnan
- Tianqi Chen
- Jinyuan Jia
Papers from Sanjeev Khanna's perspective
Ordered by how strongly the researchers Sanjeev Khanna trusts endorse each paper. Same corpus, a different order for every researcher.
- Calibrating Noise to Sensitivity in Private Data Analysis
- Boosting and Differential Privacy
- Differential Privacy: A Survey of Results
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Privately releasing conjunctions and the statistical query barrier
- Privacy: Theory meets Practice on the Map
- Robust De-anonymization of Large Sparse Datasets
- Privacy-preserving logistic regression
- A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis
- Iterative Constructions and Private Data Release
Their papers
- Space-efficient online computation of quantile summaries (2001) — 622 citations
- Distributed Private Heavy Hitters (2012) — 117 citations
- Differential Privacy: An Economic Method for Choosing Epsilon (2014) — 332 citations
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (2005) — 348 citations
- Why and Where: A Characterization of Data Provenance (2001) — 1,490 citations
- Complexity classifications of Boolean constraint satisfaction problems (2001) — 440 citations
- A PTAS for the multiple knapsack problem (2000) — 303 citations