Mark Bun

From MaRDI portal
Person:2347794

Available identifiers

zbMath Open bun.markMaRDI QIDQ2347794

List of research outcomes





PublicationDate of PublicationType
Approximate degree lower bounds for oracle identification problems2024-11-20Paper
Differentially private confidence intervals for proportions under stratified random sampling2024-05-29Paper
Stability is stable: connections between replicability, privacy, and adaptive generalization2024-05-08Paper
Private and Online Learnability Are Equivalent2023-04-27Paper
The large-error approximate degree of \(\mathrm{AC}^0\)2023-02-03Paper
Approximate Degree in Classical and Quantum Computing2023-01-11Paper
Sign-rank can increase under intersection2022-07-21Paper
Sign-rank can increase under intersection2022-03-29Paper
The large-error approximate degree of \(\mathrm{AC}^0\)2021-10-25Paper
Approximate degree and the complexity of depth three circuits2021-08-04Paper
Private Hypothesis Selection2021-07-22Paper
The polynomial method strikes back: tight quantum query bounds via dual polynomials2020-12-17Paper
A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\)2020-08-25Paper
Simultaneous private learning of multiple concepts2020-02-07Paper
Heavy Hitters and the Structure of Local Privacy2019-12-02Paper
Quantum algorithms and approximating polynomials for composed functions with shared inputs2019-10-15Paper
Towards Instance-Optimal Private Query Release2019-10-15Paper
The polynomial method strikes back: tight quantum query bounds via dual polynomials2019-08-22Paper
Composable and versatile privacy via truncated CDP2019-08-22Paper
Fingerprinting codes and the price of approximate differential privacy2018-11-07Paper
Make Up Your Mind: The Price of Online Queries in Differential Privacy2018-07-16Paper
Improved bounds on the sign-rank of \(\mathrm{AC}^0\)2017-12-19Paper
Weighted polynomial approximations: limits for learning and pseudorandomness2017-08-31Paper
Concentrated differential privacy: simplifications, extensions, and lower bounds2016-12-21Paper
Separating computational and statistical differential privacy in the client-server model2016-12-21Paper
Dual polynomials for collision and element distinctness2016-11-01Paper
Simultaneous private learning of multiple concepts2016-04-15Paper
Order-revealing encryption and the hardness of private learning2016-03-23Paper
Hardness amplification and the approximate degree of constant-depth circuits2015-10-27Paper
Fingerprinting codes and the price of approximate differential privacy2015-06-26Paper
Dual lower bounds for approximate degree and Markov-Bernstein inequalities2015-06-09Paper
Dual lower bounds for approximate degree and Markov-Bernstein inequalities2013-08-06Paper

Research outcomes over time

This page was built for person: Mark Bun