Mark Bun

activity

20152021

most citedAverage-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimation

22 citations · 59 across the 11 of their papers we have counts for

collaborators

Showing cs.CCShow all

3 papers · 1 filter

cs.CC2019

Sign-Rank Can Increase Under Intersection

Mark Bun, Nikhil S. Mande, Justin Thaler

The communication class $UPP^{cc}$ is a communication analog of the Turing Machine complexity class $PP$ . It is characterized by a matrix-analytic complexi…

cs.CC2017

A Nearly Optimal Lower Bound on the Approximate Degree of AC $^{0}$

Mark Bun, Justin Thaler

The approximate degree of a Boolean function $f : {- 1, 1}^{n} \to {- 1, 1}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most…

cs.CC2015★ 3 cited

Dual Polynomials for Collision and Element Distinctness

Mark Bun, Justin Thaler

The approximate degree of a Boolean function $f : {- 1, 1}^{n} \to {- 1, 1}$ is the minimum degree of a real polynomial that approximates $f$ to within error $1/3$ in the $\ell_\inf…

Sign-Rank Can Increase Under Intersection

A Nearly Optimal Lower Bound on the Approximate Degree of AC0

Dual Polynomials for Collision and Element Distinctness

A Nearly Optimal Lower Bound on the Approximate Degree of AC $^{0}$