Peter Manohar
Orcid: 0000-0002-0732-5073
According to our database1,
Peter Manohar
authored at least 21 papers
between 2017 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
7
3
1
2
1
2
2
2
1
1
1
4
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Electron. Colloquium Comput. Complex., 2024
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs.
Electron. Colloquium Comput. Complex., 2024
A k<sup>q/q-2</sup> Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs.
CoRR, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
2023
Electron. Colloquium Comput. Complex., 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.
Electron. Colloquium Comput. Complex., 2022
Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the 37th Computational Complexity Conference, 2022
Proceedings of the Approximation, 2022
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022
2021
Proceedings of the 36th Computational Complexity Conference, 2021
2020
IACR Cryptol. ePrint Arch., 2020
2019
IACR Cryptol. ePrint Arch., 2019
Electron. Colloquium Comput. Complex., 2019
2018
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
2017
Electron. Colloquium Comput. Complex., 2017