| Publication | Date of Publication | Type |
|---|
| Approximate degree lower bounds for oracle identification problems | 2024-11-20 | Paper |
Differentially private confidence intervals for proportions under stratified random sampling
Electronic Journal of Statistics | 2024-05-29 | Paper |
| Stability is stable: connections between replicability, privacy, and adaptive generalization | 2024-05-08 | Paper |
Private and Online Learnability Are Equivalent
Journal of the ACM | 2023-04-27 | Paper |
| The large-error approximate degree of \(\mathrm{AC}^0\) | 2023-02-03 | Paper |
Approximate Degree in Classical and Quantum Computing
Foundations and Trends® in Theoretical Computer Science | 2023-01-11 | Paper |
| Sign-rank can increase under intersection | 2022-07-21 | Paper |
Sign-rank can increase under intersection
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
Sign-rank can increase under intersection
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
The large-error approximate degree of \(\mathrm{AC}^0\)
Theory of Computing | 2021-10-25 | Paper |
| Approximate degree and the complexity of depth three circuits | 2021-08-04 | Paper |
Private Hypothesis Selection
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
The polynomial method strikes back: tight quantum query bounds via dual polynomials
Theory of Computing | 2020-12-17 | Paper |
A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\)
SIAM Journal on Computing | 2020-08-25 | Paper |
| Simultaneous private learning of multiple concepts | 2020-02-07 | Paper |
Heavy Hitters and the Structure of Local Privacy
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Quantum algorithms and approximating polynomials for composed functions with shared inputs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Towards Instance-Optimal Private Query Release
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
The polynomial method strikes back: tight quantum query bounds via dual polynomials
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Composable and versatile privacy via truncated CDP
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Fingerprinting codes and the price of approximate differential privacy
SIAM Journal on Computing | 2018-11-07 | Paper |
Make Up Your Mind: The Price of Online Queries in Differential Privacy
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Improved bounds on the sign-rank of \(\mathrm{AC}^0\) | 2017-12-19 | Paper |
Weighted polynomial approximations: limits for learning and pseudorandomness
(available as arXiv preprint) | 2017-08-31 | Paper |
Concentrated differential privacy: simplifications, extensions, and lower bounds
Theory of Cryptography | 2016-12-21 | Paper |
Separating computational and statistical differential privacy in the client-server model
Theory of Cryptography | 2016-12-21 | Paper |
Dual polynomials for collision and element distinctness
Theory of Computing | 2016-11-01 | Paper |
Simultaneous private learning of multiple concepts
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Order-revealing encryption and the hardness of private learning
Theory of Cryptography | 2016-03-23 | Paper |
Hardness amplification and the approximate degree of constant-depth circuits
Automata, Languages, and Programming | 2015-10-27 | Paper |
Fingerprinting codes and the price of approximate differential privacy
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Dual lower bounds for approximate degree and Markov-Bernstein inequalities
Information and Computation | 2015-06-09 | Paper |
Dual lower bounds for approximate degree and Markov-Bernstein inequalities
Lecture Notes in Computer Science | 2013-08-06 | Paper |
