Haim Kaplan
Artificial Intelligence · 2002–2019
A researcher in the Science corpus: 7 papers; trusts 14 researchers and is trusted by 8 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 23 citations into it; #26,841 of 35,345 by trust here, #16,471 by citations
- Computational Theory and Mathematics — 13 citations into it; #4,868 of 12,182 by trust here, #996 by citations
- Computer Networks and Communications — 12 citations into it
- Privacy & Security — 11 citations into it
- Management Science and Operations Research — 7 citations into it
- Signal Processing — 7 citations into it; #3,883 of 7,572 by trust here, #4,373 by citations
- Algorithms & Complexity — 6 citations into it
Whom Haim Kaplan trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Mikkel Thorup
- Cynthia Dwork
- Andrew Vladislav Goldberg
- Sariel Har-Peled
- Robert D. Kleinberg
- Kobbi Nissim
- Peter Sanders
- Frank McSherry
- Pankaj Kumar Agarwal
- Avrim Blum
Who trusts Haim Kaplan overall
- Paul Dütting
- Daniel Delling
- Peter Sanders
- Robert Geisberger
- Michalis Potamias
- Silvio Lattanzi
- Dominik Schultes
- Thomas Steinke
Papers from Haim Kaplan's perspective
Ordered by how strongly the researchers Haim Kaplan trusts endorse each paper. Same corpus, a different order for every researcher.
- Revealing information while preserving privacy
- Differential Privacy
- Privacy-Preserving Datamining on Vertically Partitioned Databases
- Limiting privacy breaches in privacy preserving data mining
- Calibrating Noise to Sensitivity in Private Data Analysis
- Privacy, accuracy, and consistency too: a holistic solution to contingency table release
- Distance labeling in graphs (ACM-SIAM Symposium on Discrete Algorithms)
- Privacy via pseudorandom sketches
- Practical privacy: the SuLQ framework
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
Their papers
- Labeling dynamic XML trees (2002) — 358 citations
- Private coresets (2009) — 129 citations
- Optimal oblivious routing in polynomial time (2003) — 3,342 citations
- Reachability and distance queries via 2-hop labels (2002) — 714 citations
- Reach for A*: Efficient Point-to-Point Shortest Path Algorithms (2006) — 310 citations
- Competitive Analysis with a Sample and the Secretary Problem (2019) — 51 citations
- Prophet Secretary: Surpassing the 1-1/e Barrier (2017) — 84 citations