28 citations · 174 across the 52 of their papers we have counts for
1 paper · 2 filters
Mark Bun, Kobbi Nissim, Uri Stemmer +1
We prove new upper and lower bounds on the sample complexity of (ε,δ) differentially private algorithms for releasing approximate answers to threshold functions. A threshold fun…