default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Manohar
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c18]Arpon Basu, Jun-Ting Hsieh, Andrew D. Lin, Peter Manohar:
Solving Random Planted CSPs Below the nk/2 Threshold. ICALP 2026: 23:1-23:22- [c17]Elena Grigorescu
, Vinayak M. Kumar, Peter Manohar, Geoffrey Mon:
Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes. STOC 2026: 1409-1416 - 2025
- [j3]Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar:
New Spectral Algorithms for Refuting Smoothed k-SAT. Commun. ACM 68(3): 83-91 (2025) - [c16]Nicholas Kocurek, Peter Manohar:
Spectral Refutations of Semirandom k-LIN over Larger Fields. APPROX/RANDOM 2025: 17:1-17:15 - [c15]Oliver Janzer, Peter Manohar:
A kq/q-2 Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs. FOCS 2025: 75-85 - [i26]Arpon Basu, Jun-Ting Hsieh, Andrew D. Lin, Peter Manohar:
Solving Random Planted CSPs below the nk/2} Threshold. CoRR abs/2507.10833 (2025) - [i25]Nicholas Kocurek, Peter Manohar:
Spectral Refutations of Semirandom k-LIN over Larger Fields. CoRR abs/2508.18185 (2025) - [i24]Elena Grigorescu, Vinayak M. Kumar, Peter Manohar, Geoffrey Mon:
Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes. CoRR abs/2511.02633 (2025) - [i23]Elena Grigorescu, Vinayak M. Kumar, Peter Manohar, Geoffrey Mon:
Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes. Electron. Colloquium Comput. Complex. TR25: Article TR25-208 (2025) - 2024
- [c14]Pravesh K. Kothari, Peter Manohar:
Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs. FOCS 2024: 1802-1845 - [c13]Pravesh K. Kothari, Peter Manohar:
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes. STOC 2024: 776-787 - [i22]Pravesh K. Kothari, Peter Manohar:
Superpolynomial Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs. CoRR abs/2404.06513 (2024) - [i21]Oliver Janzer, Peter Manohar:
A kq/q-2 Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs. CoRR abs/2411.14276 (2024) - [i20]Oliver Janzer, Peter Manohar:
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs. Electron. Colloquium Comput. Complex. TR24: Article TR24-187 (2024) - [i19]Pravesh Kothari, Peter Manohar:
Superpolynomial Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs. Electron. Colloquium Comput. Complex. TR24: Article TR24-068 (2024) - 2023
- [c12]Venkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar:
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold. FOCS 2023: 307-327 - [c11]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: 1438-1448 - [i18]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 abs/2308.15403 (2023) - [i17]Venkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar:
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold. CoRR abs/2309.16897 (2023) - [i16]Pravesh K. Kothari, Peter Manohar:
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes. CoRR abs/2311.00558 (2023) - [i15]Pravesh Kothari, Peter Manohar:
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes. Electron. Colloquium Comput. Complex. TR23: Article TR23-162 (2023) - 2022
- [c10]Pravesh K. Kothari, Peter Manohar, Brian Hu Zhang:
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally. ALT 2022: 638-667 - [c9]Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar:
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number. APPROX/RANDOM 2022: 42:1-42:7 - [c8]Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff:
ℓp-Spread and Restricted Isometry Properties of Sparse Random Matrices. CCC 2022: 7:1-7:17 - [c7]Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar:
Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random. STOC 2022: 678-689 - [i14]Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff:
Sparsity and 𝓁p-Restricted Isometry. CoRR abs/2205.06738 (2022) - [i13]Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar:
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number. CoRR abs/2205.06739 (2022) - [i12]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. TR22: Article TR22-101 (2022) - 2021
- [c6]Pravesh K. Kothari, Peter Manohar:
A Stress-Free Sum-Of-Squares Lower Bound for Coloring. CCC 2021: 23:1-23:21 - [i11]Pravesh K. Kothari, Peter Manohar:
A Stress-Free Sum-of-Squares Lower Bound for Coloring. CoRR abs/2105.07517 (2021) - [i10]Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff:
𝓁p-Spread Properties of Sparse Matrices. CoRR abs/2108.13578 (2021) - [i9]Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar:
Algorithms and Certificates for Boolean CSP Refutation: "Smoothed is no harder than Random". CoRR abs/2109.04415 (2021) - [i8]Pravesh K. Kothari, Peter Manohar, Brian Hu Zhang:
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally. CoRR abs/2110.11853 (2021) - 2020
- [j2]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Axis-Parallel Tests for Tensor Product Codes. Theory Comput. 16: 1-34 (2020) - [j1]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
Testing Linearity against Non-signaling Strategies. ACM Trans. Comput. Theory 12(3): 16:1-16:51 (2020) - [c5]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Local Testability in the Non-Signaling Setting. ITCS 2020: 26:1-26:37 - [i7]Peter Manohar, Jalani Williams:
Lower Bounds for Caching with Delayed Hits. CoRR abs/2006.00376 (2020) - [i6]Nathan Manohar, Peter Manohar, Rajit Manohar:
HABIT: Hardware-Assisted Bluetooth-based Infection Tracking. IACR Cryptol. ePrint Arch. 2020: 949 (2020)
2010 – 2019
- 2019
- [c4]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing. ITCS 2019: 25:1-25:17 - [c3]Alessandro Chiesa, Peter Manohar, Nicholas Spooner:
Succinct Arguments in the Quantum Random Oracle Model. TCC (2) 2019: 1-29 - [i5]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Local Testability in the Non-Signaling Setting. Electron. Colloquium Comput. Complex. TR19: Article TR19-070 (2019) - [i4]Alessandro Chiesa, Peter Manohar, Nicholas Spooner:
Succinct Arguments in the Quantum Random Oracle Model. IACR Cryptol. ePrint Arch. 2019: 834 (2019) - 2018
- [c2]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
Testing Linearity against Non-Signaling Strategies. CCC 2018: 17:1-17:37 - [i3]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
Testing Linearity against Non-Signaling Strategies. Electron. Colloquium Comput. Complex. TR18: Article TR18-067 (2018) - [i2]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
Probabilistic Checking against Non-Signaling Strategies from Linearity Testing. Electron. Colloquium Comput. Complex. TR18: Article TR18-123 (2018) - 2017
- [c1]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Axis-Parallel Tests for Tensor Product Codes. APPROX-RANDOM 2017: 39:1-39:22 - [i1]Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Axis-Parallel Tests for Tensor Product Codes. Electron. Colloquium Comput. Complex. TR17: Article TR17-110 (2017)
Coauthor Index
aka: Pravesh K. Kothari
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-07-08 01:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
