Scholar

Amey Bhangale

Google Scholar ID: ygJHy5UAAAAJ

University of California, Riverside

Hardness of approximationapproximation algorithmsprobabilistically checkable proofs

Homepage↗Google Scholar↗

Citations & Impact

All-time

Citations

312

H-index

11

i10-index

13

Publications

20

Co-authors

10

list available

Contact

No contact links provided.

Publications

5 items

A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover

2026

Cited

0

Optimal Inapproximability of Generalized Linear Equations over a Finite Group

2026

Cited

0

Optimal Online Bipartite Matching in Degree-2 Graphs

2025

Cited

0

An Analytical Approach to Parallel Repetition via CSP Inverse Theorems

2025

Cited

0

On Approximability of Satisfiable k-CSPs: V

Electron. Colloquium Comput. Complex. · 2024

Cited

1

Resume (English only)

Co-authors

10 total

Prahladh Harsha

Tata Institute of Fundamental Research, Mumbai

Swastik Kopparty

University of Toronto

Sushant Sachdeva

UToronto, Associate Professor. Vector Institute Affiliate

IIIT, Hyderabad

Professor computer science

MohammadTaghi Hajiaghayi

ACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College Park

Ramprasad Saptharishi

Tata Institute of Fundamental Research