Spremljaj
Peter Manohar
Peter Manohar
Institute for Advanced Study
Preverjeni e-poštni naslov na ias.edu - Domača stran
Naslov
Navedeno
Navedeno
Leto
Succinct Arguments in the Quantum Random Oracle Model
A Chiesa, P Manohar, N Spooner
Proceedings of the 17th Theory of Cryptography Conference. TCC 19, 2019
852019
Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random
V Guruswami, PK Kothari, P Manohar
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
322022
A near-cubic lower bound for 3-query locally decodable codes from semirandom CSP refutation
O Alrabiah, V Guruswami, PK Kothari, P Manohar
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1438-1448, 2023
252023
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally
PK Kothari, P Manohar, BH Zhang
International Conference on Algorithmic Learning Theory, 638-667, 2022
162022
An exponential lower bound for linear 3-query locally correctable codes
PK Kothari, P Manohar
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 776-787, 2024
142024
On Axis-Parallel Tests for Tensor Product Codes
A Chiesa, P Manohar, I Shinkar
Theory of Computing 16 (1), 1-34, 2020
122020
A Stress-Free Sum-of-Squares Lower Bound for Coloring
PK Kothari, P Manohar
arXiv preprint arXiv:2105.07517, 2021
92021
Lower Bounds for Caching with Delayed Hits
P Manohar, J Williams
arXiv preprint arXiv:2006.00376, 2020
82020
Probabilistic Checking against Non-Signaling Strategies from Linearity Testing
A Chiesa, P Manohar, I Shinkar
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018
82018
𝓁_p-Spread and Restricted Isometry Properties of Sparse Random Matrices
V Guruswami, P Manohar, J Mosheiff
37th Computational Complexity Conference (CCC 2022), 2022
72022
Testing Linearity against Non-signaling Strategies
A Chiesa, P Manohar, I Shinkar
ACM Transactions on Computation Theory (TOCT) 12 (3), 1-51, 2020
72020
Superpolynomial Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs
PK Kothari, P Manohar
arXiv preprint arXiv:2404.06513, 2024
62024
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold
V Guruswami, JT Hsieh, PK Kothari, P Manohar
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
52023
HABIT: Hardware-Assisted Bluetooth-based Infection Tracking.
N Manohar, P Manohar, R Manohar
IACR Cryptol. ePrint Arch. 2020, 949, 2020
52020
Implementation of a Hardware-Assisted Bluetooth-Based COVID-19 Tracking Device in a High School: Mixed Methods Study
D Li, T Shelby, M Brault, R Manohar, S Vermund, A Hagaman, ...
JMIR Formative Research 7 (1), e39765, 2023
12023
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number
V Guruswami, PK Kothari, P Manohar
arXiv preprint arXiv:2205.06739, 2022
2022
Sparsity and -Restricted Isometry
V Guruswami, P Manohar, J Mosheiff
arXiv preprint arXiv:2205.06738, 2022
2022
On Local Testability in the Non-Signaling Setting
A Chiesa, P Manohar, I Shinkar
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
2020
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–18