| 2026 | ICALP | Solving Random Planted CSPs Below the n | Arpon Basu, Jun-Ting Hsieh, Andrew D. Lin, Peter Manohar |
| 2026 | STOC | Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes. | Elena Grigorescu, Vinayak M. Kumar, Peter Manohar, Geoffrey Mon |
| 2025 | FOCS | A k | Oliver Janzer, Peter Manohar |
| 2024 | FOCS | Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs. | Pravesh K. Kothari, Peter Manohar |
| 2024 | STOC | An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes. | Pravesh K. Kothari, Peter Manohar |
| 2023 | FOCS | Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold. | Venkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar |
| 2023 | STOC | A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. | Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar |
| 2022 | ALT | Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally. | Pravesh K. Kothari, Peter Manohar, Brian Hu Zhang |
| 2022 | STOC | Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random. | Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar |
| 2019 | TCC | Succinct Arguments in the Quantum Random Oracle Model. | Alessandro Chiesa, Peter Manohar, Nicholas Spooner |