Sample complexity bounds on differentially private learning via communication complexity
- Vitaly Feldman
- David Xiao
- 2015
- SIAM Journal on Computing
Publications
Date
Featured collections
Popular topics
123 results at SIAM Journal on Computing
Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Chandra Chekuri
- Jan Vondrák
- et al.
- 2014
- SIAM Journal on Computing
Protecting circuits from computationally bounded and noisy leakage
- Sebastian Faust
- Tal Rabin
- et al.
- 2014
- SIAM Journal on Computing
Self-improving algorithms for coordinatewise maxima and convex hulls
- Kenneth L. Clarkson
- Wolfgang Mulzer
- et al.
- 2014
- SIAM Journal on Computing
Min-max graph partitioning and small set expansion
- Nikhil Bansal
- Uriel Feige
- et al.
- 2014
- SIAM Journal on Computing
Privately releasing conjunctions and the statistical Quer y Barrier
- Anupam Gupta
- Moritz Hardt
- et al.
- 2013
- SIAM Journal on Computing
Improving exhaustive search implies superpolynomial lower bounds
- Ryan Williams
- 2013
- SIAM Journal on Computing
Matroid matching: The power of local search
- Jon Lee
- Maxim Sviridenko
- et al.
- 2013
- SIAM Journal on Computing
Symmetry and approximability of submodular maximization problems
- Jan Vondrák
- 2013
- SIAM Journal on Computing
The price of routing unsplittable flow
- Baruch Awerbuch
- Yossi Azar
- et al.
- 2013
- SIAM Journal on Computing