Peter Manohar

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 35

Top Topics

Set Of Randomly Generated Instances

Locally Decodable Codes

Top Venues

Electron. Colloquium Comput. Complex.

IACR Cryptol. ePrint Arch.

Publications

Pravesh K. Kothari, Peter Manohar
Superpolynomial Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs. CoRR (2024)
Pravesh Kothari, Peter Manohar
Superpolynomial Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs. Electron. Colloquium Comput. Complex. (2024)
Pravesh K. Kothari, Peter Manohar
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes. STOC (2024)
Pravesh K. Kothari, Peter Manohar
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes. CoRR (2023)
Venkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold. FOCS (2023)
Pravesh Kothari, Peter Manohar
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes. Electron. Colloquium Comput. Complex. (2023)
Venkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold. CoRR (2023)
Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. STOC (2023)
Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. CoRR (2023)
Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number. CoRR (2022)
Omar Alrabiah, Venkatesan Guruswami, Pravesh Kothari, Peter Manohar
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. Electron. Colloquium Comput. Complex. (2022)
Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff
-Spread and Restricted Isometry Properties of Sparse Random Matrices. CCC (2022)
Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number. APPROX/RANDOM (2022)
Pravesh K. Kothari, Peter Manohar, Brian Hu Zhang
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally. ALT (2022)
Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff
-Restricted Isometry. CoRR (2022)
Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random. STOC (2022)
Pravesh K. Kothari, Peter Manohar, Brian Hu Zhang
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally. CoRR (2021)
Pravesh K. Kothari, Peter Manohar
A Stress-Free Sum-Of-Squares Lower Bound for Coloring. Computational Complexity Conference (2021)
Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
Algorithms and Certificates for Boolean CSP Refutation: "Smoothed is no harder than Random". CoRR (2021)
Pravesh K. Kothari, Peter Manohar
A Stress-Free Sum-of-Squares Lower Bound for Coloring. CoRR (2021)
Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff
-Spread Properties of Sparse Matrices. CoRR (2021)
Alessandro Chiesa, Peter Manohar, Igor Shinkar
Testing Linearity against Non-signaling Strategies. ACM Trans. Comput. Theory 12 (3) (2020)
Peter Manohar, Jalani Williams
Lower Bounds for Caching with Delayed Hits. CoRR (2020)
Alessandro Chiesa, Peter Manohar, Igor Shinkar
On Axis-Parallel Tests for Tensor Product Codes. Theory Comput. 16 (2020)
Alessandro Chiesa, Peter Manohar, Igor Shinkar
On Local Testability in the Non-Signaling Setting. ITCS (2020)
Nathan Manohar, Peter Manohar, Rajit Manohar
HABIT: Hardware-Assisted Bluetooth-based Infection Tracking. IACR Cryptol. ePrint Arch. 2020 (2020)
Alessandro Chiesa, Peter Manohar, Nicholas Spooner
Succinct Arguments in the Quantum Random Oracle Model. IACR Cryptol. ePrint Arch. 2019 (2019)
Alessandro Chiesa, Peter Manohar, Igor Shinkar
Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing. ITCS (2019)
Alessandro Chiesa, Peter Manohar, Igor Shinkar
On Local Testability in the Non-Signaling Setting. Electron. Colloquium Comput. Complex. 26 (2019)
Alessandro Chiesa, Peter Manohar, Nicholas Spooner
Succinct Arguments in the Quantum Random Oracle Model. TCC (2) (2019)
Alessandro Chiesa, Peter Manohar, Igor Shinkar
Testing Linearity against Non-Signaling Strategies. Computational Complexity Conference (2018)
Alessandro Chiesa, Peter Manohar, Igor Shinkar
Testing Linearity against Non-Signaling Strategies. Electron. Colloquium Comput. Complex. 25 (2018)
Alessandro Chiesa, Peter Manohar, Igor Shinkar
Probabilistic Checking against Non-Signaling Strategies from Linearity Testing. Electron. Colloquium Comput. Complex. 25 (2018)
Alessandro Chiesa, Peter Manohar, Igor Shinkar
On Axis-Parallel Tests for Tensor Product Codes. Electron. Colloquium Comput. Complex. 24 (2017)
Alessandro Chiesa, Peter Manohar, Igor Shinkar
On Axis-Parallel Tests for Tensor Product Codes. APPROX-RANDOM (2017)