Follow
Peter Manohar
Title
Cited by
Cited by
Year
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
862019
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
332022
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
152024
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
92020
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
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
62023
HABIT: Hardware-Assisted Bluetooth-based Infection Tracking.
N Manohar, P Manohar, R Manohar
IACR Cryptol. ePrint Arch. 2020, 949, 2020
52020
Exponential lower bounds for smooth 3-LCCs and sharp bounds for designs
PK Kothari, P Manohar
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024
32024
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
22023
New Spectral Algorithms for Refuting Smoothed k-SAT
V Guruswami, PK Kothari, P Manohar
Communications of the ACM 68 (3), 83-91, 2025
2025
A Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
O Janzer, P Manohar
arXiv preprint arXiv:2411.14276, 2024
2024
New Spectral Techniques in Algorithms, Combinatorics, and Coding Theory: The Kikuchi Matrix Method
P Manohar
Carnegie Mellon University, 2024
2024
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
The system can't perform the operation now. Try again later.
Articles 1–20