Mark Bun

According to our database1, Mark Bun authored at least 30 papers between 2013 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Controlling Privacy Loss in Survey Sampling (Working Paper).
CoRR, 2020

A Computational Separation between Private Learning and Online Learning.
CoRR, 2020

New Oracle-Efficient Algorithms for Private Synthetic Data Release.
CoRR, 2020

An Equivalence Between Private Classification and Online Prediction.
CoRR, 2020

Efficient, Noise-Tolerant, and Private Learning via Boosting.
Proceedings of the Conference on Learning Theory, 2020

2019
Heavy Hitters and the Structure of Local Privacy.
ACM Trans. Algorithms, 2019

Make Up Your Mind: The Price of Online Queries in Differential Privacy.
J. Priv. Confidentiality, 2019

Simultaneous Private Learning of Multiple Concepts.
J. Mach. Learn. Res., 2019

Sign-Rank Can Increase Under Intersection.
Electronic Colloquium on Computational Complexity (ECCC), 2019

Towards Instance-Optimal Private Query Release.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimation.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Private Hypothesis Selection.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Fingerprinting Codes and the Price of Approximate Differential Privacy.
SIAM J. Comput., 2018

The Large-Error Approximate Degree of AC<sup>0</sup>.
Electronic Colloquium on Computational Complexity (ECCC), 2018

Quantum algorithms and approximating polynomials for composed functions with shared inputs.
Electronic Colloquium on Computational Complexity (ECCC), 2018

Composable and versatile privacy via truncated CDP.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
A Nearly Optimal Lower Bound on the Approximate Degree of AC<sup>0</sup>.
Electronic Colloquium on Computational Complexity (ECCC), 2017

The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Differentially Private Submodular Maximization: Data Summarization in Disguise.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Dual Polynomials for Collision and Element Distinctness.
Theory Comput., 2016

Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds.
IACR Cryptol. ePrint Arch., 2016

Separating Computational and Statistical Differential Privacy in the Client-Server Model.
IACR Cryptol. ePrint Arch., 2016

Approximate Degree and the Complexity of Depth Three Circuits.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Improved Bounds on the Sign-Rank of AC<sup>0</sup>.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Improved Bounds on the Sign-Rank of AC^0.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Order-Revealing Encryption and the Hardness of Private Learning.
IACR Cryptol. ePrint Arch., 2015

Differentially Private Release and Learning of Threshold Functions.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness.
Electronic Colloquium on Computational Complexity (ECCC), 2014

2013
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities.
Electronic Colloquium on Computational Complexity (ECCC), 2013


  Loading...