Quantum interactive proofs with short messages by Beigi, Salman, Shor, Peter W., Watrous, John

“…Theory of Computing…”
Get full text

Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality by Har-Peled, Sariel, Indyk, Piotr, Motwani, Rajeev

“…Theory of Computing Exchange…”
Get full text

Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality by Har-Peled, Sariel, Indyk, Piotr, Motwani, Rajeev

“…Theory of Computing Exchange…”
Get full text

Optimality of Correlated Sampling Strategies by Bavarian, Mohammad, Ghazi, Badih, Haramaty, Elad, Kamath, Pritish, Rivest, Ronald L, Sudan, Madhu

“…Theory of Computing Exchange…”
Get full text

Distributed corruption detection in networks by Alon, N, Mossel, E, Pemantle, R

“…Theory of Computing Exchange…”
Get full text

Learning k-modal distributions via testing by Daskalakis, C, Diakonikolas, I, Servedio, RA

“…Theory of Computing Exchange…”
Get full text

Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices by Moitra, Ankur

“…ACM Symposium on Theory of Computing. Proceedings…”
Get full text
Get full text

Near Optimal Alphabet-Soundness Tradeoff PCPs by Minzer, Dor, Zheng, Kai Zhe

“…Association for Computing Machinery STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing…”
Get full text

0-1 Knapsack in Nearly Quadratic Time by Jin, Ce

“…Association for Computing Machinery STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing…”
Get full text

Planning and Learning in Partially Observable Systems via Filter Stability by Golowich, Noah, Moitra, Ankur, Rohatgi, Dhruv

“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text

Near-Optimal Derandomization of Medium-Width Branching Programs by Putterman, Aaron (Louie), Pyne, Edward

“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text

Robustness Implies Privacy in Statistical Estimation by Hopkins, Samuel B., Kamath, Gautam, Majid, Mahbod, Narayanan, Shyam

“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text

Testing Distributional Assumptions of Learning Algorithms by Rubinfeld, Ronitt, Vasilyan, Arsen

“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text

Noise Stability on the Boolean Hypercube via a Renormalized Brownian Motion by Eldan, Ronen, Mikulincer, Dan, Raghavendra, Prasad

“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text

On Approximability of Satisfiable k-CSPs: II by Bhangale, Amey, Khot, Subhash, Minzer, Dor

“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text

On Approximability of Satisfiable k-CSPs: III by Bhangale, Amey, Khot, Subhash, Minzer, Dor

“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text

Nearly All k-SAT Functions Are Unate by Balogh, J?zsef, Dong, Dingding, Lidick?, Bernard, Mani, Nitya, Zhao, Yufei

“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text

Binary Error-Correcting Codes with Minimal Noiseless Feedback by Gupta, Meghal, Guruswami, Venkatesan, Zhang, Rachel

“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text

Succinct Computational Secret Sharing by Applebaum, Benny, Beimel, Amos, Ishai, Yuval, Kushilevitz, Eyal, Liu, Tianren, Vaikuntanathan, Vinod

“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text

Optimal Bounds for Noisy Sorting by Gu, Yuzhou, Xu, Yinzhan

“…ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing…”
Get full text