Peter Manohar

45 papers A* 6A 7B 1Journal 29Unranked 2
YearRankTypeTitle / Venue / Authors
2025 A* conf
A k
FOCS
Oliver Janzer, Peter Manohar
2025 J jnl
New Spectral Algorithms for Refuting Smoothed k-SAT.
Commun. ACM
Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
2025 J jnl
Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes.
CoRR
Elena Grigorescu, Vinayak M. Kumar, Peter Manohar, Geoffrey Mon
2025 J jnl
Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes.
Electron. Colloquium Comput. Complex.
Elena Grigorescu, Vinayak M. Kumar, Peter Manohar, Geoffrey Mon
2025 J jnl
Solving Random Planted CSPs below the n
CoRR
Arpon Basu, Jun-Ting Hsieh, Andrew D. Lin, Peter Manohar
2025 J jnl
Spectral Refutations of Semirandom
CoRR
Nicholas Kocurek, Peter Manohar
2025 A conf
Spectral Refutations of Semirandom k-LIN over Larger Fields.
APPROX/RANDOM
Nicholas Kocurek, Peter Manohar
2024 J jnl
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs.
Electron. Colloquium Comput. Complex.
Oliver Janzer, Peter Manohar
2024 J jnl
A k
CoRR
Oliver Janzer, Peter Manohar
2024 A* conf
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes.
STOC
Pravesh K. Kothari, Peter Manohar
2024 A* conf
Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs.
FOCS
Pravesh K. Kothari, Peter Manohar
2024 J jnl
Superpolynomial Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs.
CoRR
Pravesh K. Kothari, Peter Manohar
2024 J jnl
Superpolynomial Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs.
Electron. Colloquium Comput. Complex.
Pravesh Kothari, Peter Manohar
2023 A* conf
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.
STOC
Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
2023 J jnl
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.
CoRR
Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
2023 J jnl
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes.
CoRR
Pravesh K. Kothari, Peter Manohar
2023 J jnl
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes.
Electron. Colloquium Comput. Complex.
Pravesh Kothari, Peter Manohar
2023 A* conf
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold.
FOCS
Venkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar
2023 J jnl
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold.
CoRR
Venkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar
2022 J jnl
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.
Electron. Colloquium Comput. Complex.
Omar Alrabiah, Venkatesan Guruswami, Pravesh Kothari, Peter Manohar
2022 A* conf
Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random.
STOC
Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
2022 A conf
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number.
APPROX/RANDOM
Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
2022 J jnl
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number.
CoRR
Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
2022 B conf
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally.
ALT
Pravesh K. Kothari, Peter Manohar, Brian Hu Zhang
2022 J jnl
Sparsity and ๐“
CoRR
Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff
2022 A conf
โ„“
CCC
Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff
2021 A conf
A Stress-Free Sum-Of-Squares Lower Bound for Coloring.
CCC
Pravesh K. Kothari, Peter Manohar
2021 J jnl
A Stress-Free Sum-of-Squares Lower Bound for Coloring.
CoRR
Pravesh K. Kothari, Peter Manohar
2021 J jnl
Algorithms and Certificates for Boolean CSP Refutation: "Smoothed is no harder than Random".
CoRR
Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
2021 J jnl
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally.
CoRR
Pravesh K. Kothari, Peter Manohar, Brian Hu Zhang
2021 J jnl
๐“
CoRR
Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff
2020 J jnl
HABIT: Hardware-Assisted Bluetooth-based Infection Tracking.
IACR Cryptol. ePrint Arch.
Nathan Manohar, Peter Manohar, Rajit Manohar
2020 J jnl
Lower Bounds for Caching with Delayed Hits.
CoRR
Peter Manohar, Jalani Williams
2020 J jnl
On Axis-Parallel Tests for Tensor Product Codes.
Theory Comput.
Alessandro Chiesa, Peter Manohar, Igor Shinkar
2020 A conf
On Local Testability in the Non-Signaling Setting.
ITCS
Alessandro Chiesa, Peter Manohar, Igor Shinkar
2020 J jnl
Testing Linearity against Non-signaling Strategies.
ACM Trans. Comput. Theory
Alessandro Chiesa, Peter Manohar, Igor Shinkar
2019 J jnl
On Local Testability in the Non-Signaling Setting.
Electron. Colloquium Comput. Complex.
Alessandro Chiesa, Peter Manohar, Igor Shinkar
2019 A conf
Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing.
ITCS
Alessandro Chiesa, Peter Manohar, Igor Shinkar
2019 โ€” conf
Succinct Arguments in the Quantum Random Oracle Model.
TCC (2)
Alessandro Chiesa, Peter Manohar, Nicholas Spooner
2019 J jnl
Succinct Arguments in the Quantum Random Oracle Model.
IACR Cryptol. ePrint Arch.
Alessandro Chiesa, Peter Manohar, Nicholas Spooner
2018 J jnl
Probabilistic Checking against Non-Signaling Strategies from Linearity Testing.
Electron. Colloquium Comput. Complex.
Alessandro Chiesa, Peter Manohar, Igor Shinkar
2018 A conf
Testing Linearity against Non-Signaling Strategies.
CCC
Alessandro Chiesa, Peter Manohar, Igor Shinkar
2018 J jnl
Testing Linearity against Non-Signaling Strategies.
Electron. Colloquium Comput. Complex.
Alessandro Chiesa, Peter Manohar, Igor Shinkar
2017 โ€” conf
On Axis-Parallel Tests for Tensor Product Codes.
APPROX-RANDOM
Alessandro Chiesa, Peter Manohar, Igor Shinkar
2017 J jnl
On Axis-Parallel Tests for Tensor Product Codes.
Electron. Colloquium Comput. Complex.
Alessandro Chiesa, Peter Manohar, Igor Shinkar