-
1
Quantum interactive proofs with short messages
Published 2020“…Theory of Computing…”
Get full text
Article -
2
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
Published 2021“…Theory of Computing Exchange…”
Get full text
Article -
3
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
Published 2022“…Theory of Computing Exchange…”
Get full text
Article -
4
Optimality of Correlated Sampling Strategies
Published 2021“…Theory of Computing Exchange…”
Get full text
Article -
5
Distributed corruption detection in networks
Published 2021“…Theory of Computing Exchange…”
Get full text
Article -
6
Learning k-modal distributions via testing
Published 2022“…Theory of Computing Exchange…”
Get full text
Article -
7
Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices
Published 2016“…ACM Symposium on Theory of Computing. Proceedings…”
Get full text
Get full text
Article -
8
Planning and Learning in Partially Observable Systems via Filter Stability
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article -
9
Near-Optimal Derandomization of Medium-Width Branching Programs
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article -
10
Robustness Implies Privacy in Statistical Estimation
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article -
11
Testing Distributional Assumptions of Learning Algorithms
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article -
12
Noise Stability on the Boolean Hypercube via a Renormalized Brownian Motion
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article -
13
On Approximability of Satisfiable k-CSPs: II
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article -
14
On Approximability of Satisfiable k-CSPs: III
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article -
15
Nearly All k-SAT Functions Are Unate
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article -
16
Binary Error-Correcting Codes with Minimal Noiseless Feedback
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article -
17
Succinct Computational Secret Sharing
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article -
18
Optimal Bounds for Noisy Sorting
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article -
19
Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article -
20
Removing Additive Structure in 3SUM-Based Reductions
Published 2023“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text
Article