| Publication | Date of Publication | Type |
|---|
| Differentially private aggregation via imperfect shuffling | 2024-11-22 | Paper |
| On differentially private counting on trees | 2024-11-14 | Paper |
| Algorithms with more granular differential privacy guarantees | 2024-09-25 | Paper |
| Private counting of distinct and \(k\)-occurring items in time windows | 2024-09-25 | Paper |
| Differentially private all-pairs shortest path distances: improved algorithms and lower bounds | 2024-05-14 | Paper |
Sample-efficient proper PAC learning with approximate differential privacy
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Pure differentially private summation from anonymous messages
(available as arXiv preprint) | 2023-11-02 | Paper |
Private aggregation from fewer anonymous messages
(available as arXiv preprint) | 2022-03-23 | Paper |
| On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy | 2021-12-08 | Paper |
Optimality of correlated sampling strategies
Theory of Computing | 2020-12-17 | Paper |
Dimension Reduction for Polynomials over Gaussian Space and Applications
(available as arXiv preprint) | 2020-09-22 | Paper |
| Near-tight closure bounds for Littlestone and threshold dimensions | 2020-07-07 | Paper |
The Power of Shared Randomness in Uncertain Communication
(available as arXiv preprint) | 2020-05-27 | Paper |
Communication-rounds tradeoffs for common randomness and secret key generation
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Communication with contextual uncertainty
Computational Complexity | 2018-11-07 | Paper |
LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem
SIAM Journal on Computing | 2018-08-21 | Paper |
Communication complexity of permutation-invariant functions
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Communication with contextual uncertainty
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the Power of Learning from k-Wise Queries
(available as arXiv preprint) | 2018-05-03 | Paper |
| scientific article; zbMATH DE number 6866309 (Why is no real title available?) | 2018-05-03 | Paper |
| Resource-efficient common randomness and secret-key schemes | 2018-03-15 | Paper |
Resource-efficient common randomness and secret-key schemes
(available as arXiv preprint) | 2018-03-15 | Paper |
LP/SDP hierarchy lower bounds for decoding random LDPC codes
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Linear Programming Decoding of Spatially Coupled Codes
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
| The information complexity of Hamming distance | 2017-03-22 | Paper |
