73 citations · 585 across the 58 of their papers we have counts for
1 paper · 2 filters
Jonathan Ullman
We prove a tight lower bound (up to constant factors) on the sample complexity of any non-interactive local differentially private protocol for optimizing a linear function over th…