22 citations · 59 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 5 cited
Heavy Hitters and the Structure of Local Privacy
Mark Bun, Jelani Nelson, Uri Stemmer
We present a new locally differentially private algorithm for the heavy hitters problem which achieves optimal worst-case error as a function of all standardly considered parameter…
cs.CC2017
A Nearly Optimal Lower Bound on the Approximate Degree of AC
Mark Bun, Justin Thaler
The approximate degree of a Boolean function is the least degree of a real polynomial that approximates pointwise to error at most…