Dwork, C., Naor, M., Pitassi, T., and Rothblum, G. N. (2010). Differential privacy under continual observation. In Proceedings of the forty-second ACM symposium on Theory of computing, pages 715-724.
Dwork, C., Naor, M., Reingold, O., Rothblum, G. N., and Vadhan, S. (2009). On the complexity of differentially private data release: efficient algorithms and hardness results. In Proceedings of the forty-first annual ACM symposium on Theory of computing, pages 381-390.
Feldman, V. and Steinke, T. (2017). Generalization for adaptively-chosen estimators via stable median. In Conference on learning theory, pages 728-757. PMLR.
Gillenwater, J., Joseph, M., and Kulesza, A. (2021). Differentially private quantiles. In International Conference on Machine Learning, pages 3713-3722. PMLR.
Hardt, M. and Rothblum, G. N. (2010). A multiplicative weights mechanism for privacy-preserving data analysis. In 2010 IEEE 51st annual symposium on foundations of computer science, pages 61-70. IEEE.
Hasidim, A., Kaplan, H., Mansour, Y., Matias, Y., and Stemmer, U. (2020). Adversarily robust streaming algorithms via differential privacy. Advances in Neural Information Processing Systems, 33:147-158.
Hsu, J., Roth, A., and Ullman, J. (2013). Differential privacy for the analyst via private equilibrium computation. In Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pages 341-350.
Kamath, G., Mouzakis, A., Singhal, V., Steinke, T., and Ullman, J. (2022). A private and computationally-efficient estimator for unbounded gaussians. In Conference on Learning Theory, pages 544-572. PMLR.
Kaplan, H., Ligett, K., Mansour, Y., Naor, M., and Stemmer, U. (2020a). Privately learning thresholds: Closing the exponential gap. In Conference on Learning Theory, pages 2263-2285. PMLR.
Kaplan, H., Mansour, Y., and Stemmer, U. (2021). The sparse vector technique, revisited. In Conference on Learning Theory, pages 2747-2776. PMLR.
Kaplan, H., Schnapp, S., and Stemmer, U. (2022). Differentially private approximate quantiles. In International Conference on Machine Learning, pages 10751-10761. PMLR.
Kaplan, H., Sharir, M., and Stemmer, U. (2020b). How to find a point in the convex hull privately. SoCG.
Ligett, K., Neel, S., Roth, A., Waggoner, B., and Wu, S. Z. (2017). Accuracy first: Selecting a differential privacy level for accuracy constrained erm. Advances in Neural Information Processing Systems, 30.
Lyu, M., Su, D., and Li, N. (2017). Understanding the sparse vector technique for differential privacy. Proceedings of the VLDB Endowment, 10(6).
McKenna, R. and Sheldon, D. R. (2020). Permute-and-flip: A new mechanism for differentially private selection. Advances in Neural Information Processing Systems, 33:193-203.
McSherry, F. and Talwar, K. (2007). Mechanism design via differential privacy. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), pages 94-103. IEEE.
Nandi, A. and Bassily, R. (2020). Privately answering classification queries in the agnostic pac model. In Algorithmic Learning Theory, pages 687-703. PMLR.
Nissim, K., Raskhodnikova, S., and Smith, A. (2007). Smooth sensitivity and sampling in private data analysis. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 75-84.
Nissim, K. and Stemmer, U. (2018). Clustering algorithms for the centralized and local models. In Algorithmic Learning Theory, pages 619-653. PMLR.