The following pages link to Mark Bun (Q2347794):
Displaying 28 items.
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
- Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
- Simultaneous Private Learning of Multiple Concepts (Q2800585) (← links)
- (Q2830865) (← links)
- Separating Computational and Statistical Differential Privacy in the Client-Server Model (Q3179372) (← links)
- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds (Q3179373) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- Fingerprinting Codes and the Price of Approximate Differential Privacy (Q4554072) (← links)
- Make Up Your Mind: The Price of Online Queries in Differential Privacy (Q4575828) (← links)
- Improved Bounds on the Sign-Rank of AC^0 (Q4598174) (← links)
- Heavy Hitters and the Structure of Local Privacy (Q4973047) (← links)
- Private Hypothesis Selection (Q5001497) (← links)
- (Q5009530) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Sign-rank Can Increase under Intersection (Q5066143) (← links)
- (Q5091179) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- (Q5140844) (← links)
- (Q5158501) (← links)
- (Q5214179) (← links)
- Composable and versatile privacy via truncated CDP (Q5230278) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5230298) (← links)
- Quantum algorithms and approximating polynomials for composed functions with shared inputs (Q5236223) (← links)
- Towards Instance-Optimal Private Query Release (Q5236341) (← links)
- Fingerprinting codes and the price of approximate differential privacy (Q5259533) (← links)
- Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness (Q5351926) (← links)
- (Q5875514) (← links)
- Private and Online Learnability Are Equivalent (Q5889789) (← links)
