Or Sheffet

Orcid: 0000-0002-5182-0530

According to our database1, Or Sheffet authored at least 35 papers between 2007 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A Differentially Private Linear-Time fPTAS for the Minimum Enclosing Ball Problem.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Transfer Learning In Differential Privacy's Hybrid-Model.
Proceedings of the International Conference on Machine Learning, 2022

2021
Quantile Multi-Armed Bandits: Optimal Best-Arm Identification and a Differentially Private Scheme.
IEEE J. Sel. Areas Inf. Theory, 2021

Differentially Private Approximations of a Convex Hull in Low Dimensions.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020
Privacy Games.
ACM Trans. Economics and Comput., 2020

Private Approximations of a Convex Hull in Low Dimensions.
CoRR, 2020

Best-Arm Identification for Quantile Bandits with Privacy.
CoRR, 2020

The Power of Synergy in Differential Privacy: Combining a Small Curator with Local Randomizers.
Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

Private k-Means Clustering with Stability Assumptions.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Differentially Private Ordinary Least Squares.
J. Priv. Confidentiality, 2019

An Optimal Private Stochastic-MAB Algorithm Based on an Optimal Private Stopping Rule.
CoRR, 2019

Differentially Private Algorithms for Learning Mixtures of Separated Gaussians.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

An Optimal Private Stochastic-MAB Algorithm based on Optimal Private Stopping Rule.
Proceedings of the 36th International Conference on Machine Learning, 2019

Old Techniques in Differentially Private Linear Regression.
Proceedings of the Algorithmic Learning Theory, 2019

Locally Private Mean Estimation: $Z$-test and Tight Confidence Intervals.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Differentially Private Contextual Linear Bandits.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Locally Private Hypothesis Testing.
Proceedings of the 35th International Conference on Machine Learning, 2018

2015
Differentially Private Least Squares: Estimation, Confidence and Rejecting the Null Hypothesis.
CoRR, 2015

Private Approximations of the 2nd-Moment Matrix Using Existing Techniques in Linear Regression.
CoRR, 2015

Optimal social choice functions: A utilitarian view.
Artif. Intell., 2015

2014
Learning Mixtures of Ranking Models.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013
Optimizing password composition policies.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Differentially private data analysis of social networks via restricted sensitivity.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
Center-based clustering under perturbation stability.
Inf. Process. Lett., 2012

Send mixed signals: earn more, work less.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Predicting Consumer Behavior in Commerce Search.
Proceedings of the 29th International Conference on Machine Learning, 2012

The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Improved Spectral-Norm Bounds for Clustering.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

Additive Approximation for Near-Perfect Phylogeny Construction.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2010
On The Randomness Complexity of Property Testing.
Comput. Complex., 2010

On Nash-Equilibria of Approximation-Stable Games.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Stability Yields a PTAS for k-Median and k-Means Clustering.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Improved Guarantees for Agnostic Learning of Disjunctions.
Proceedings of the COLT 2010, 2010

2008
Graph Colouring with No Large Monochromatic Components.
Comb. Probab. Comput., 2008

2007
Graph coloring with no large monochromatic components.
Electron. Notes Discret. Math., 2007


  Loading...