Projects per year
Fingerprint
Dive into the research topics where Pravesh Kumar Kothari is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Projects
- 1 Active
-
CAREER: The Nature of Average-Case Computation
Kothari, P. K. (PI)
NSF - National Science Foundation
4/1/24 → 1/31/26
Project: Research project
-
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes
Kothari, P. K. & Manohar, P., Jun 10 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O�Donnell, R. (eds.). Association for Computing Machinery, p. 776-787 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
New SDP Roundings and Certifiable Approximation for Cubic Optimization
Hsieh, J. T., Kothari, P. K., Pesenti, L. & Trevisan, L., 2024, p. 2337-2362. 26 p.Research output: Contribution to conference › Paper › peer-review
Open Access -
Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs
Kothari, P. K., Potechin, A. & Xu, J., Jun 10 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O�Donnell, R. (eds.). Association for Computing Machinery, p. 1923-1934 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
Algorithms Approaching the Threshold for Semi-random Planted Clique
Buhai, R. D., Kothari, P. K. & Steurer, D., Jun 2 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 1918-1926 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access3 Scopus citations -
A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity
Gollakota, A., Klivans, A. R. & Kothari, P. K., Jun 2 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 1657-1670 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access4 Scopus citations