| 2026 | ICALP | A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover. | Amey Bhangale, Yezhou Zhang |
| 2026 | ICALP | Optimal Inapproximability of Generalized Linear Equations over a Finite Group. | Amey Bhangale, Yezhou Zhang |
| 2026 | SODA | Plane vs. Plane Low Degree Test. | Amey Bhangale, Silas Richelson |
| 2026 | STOC | An Analytical Approach to Parallel Repetition via CSP Inverse Theorems. | Amey Bhangale, Mark Braverman, Subhash Khot, Yang Liu, Dor Minzer, Kunal Mittal |
| 2025 | CRYPTO | Leader Election with Poly-Logarithmic Communication Per Party. | Amey Bhangale, Chen-Da Liu-Zhang, Julian Loss, Kartik Nayak, Sravya Yandamuri |
| 2025 | FOCS | On Inverse Theorems and Combinatorial Lines. | Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer |
| 2025 | ISAAC | Optimal Online Bipartite Matching in Degree-2 Graphs. | Amey Bhangale, Arghya Chakraborty, Prahladh Harsha |
| 2025 | STOC | Parallel Repetition for 3-Player XOR Games. | Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer |
| 2025 | STOC | On Approximability of Satisfiable k-CSPs: V. | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2024 | STOC | On Approximability of Satisfiable k-CSPs: IV. | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2023 | STOC | On Approximability of Satisfiable k-CSPs: II. | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2023 | STOC | On Approximability of Satisfiable k-CSPs: III. | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2022 | ASIACRYPT | Efficient Adaptively-Secure Byzantine Agreement for Long Messages. | Amey Bhangale, Chen-Da Liu-Zhang, Julian Loss, Kartik Nayak |
| 2022 | STOC | On approximability of satisfiable | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2022 | TCC | A Toolbox for Barriers on Interactive Oracle Proofs. | Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev |
| 2021 | STOC | Optimal inapproximability of satisfiable k-LIN over non-abelian groups. | Amey Bhangale, Subhash Khot |
| 2020 | FOCS | Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs. | Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal |
| 2020 | SODA | Improved Inapproximability of Rainbow Coloring. | Per Austrin, Amey Bhangale, Aditya Potukuchi |
| 2018 | ICALP | NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors. | Amey Bhangale |
| 2018 | ISIT | A Note on the Joint Entropy of N/2-Wise Independence. | Amey Bhangale, Aditya Potukuchi |
| 2018 | SODA | Near-optimal approximation algorithm for simultaneous Max-Cut. | Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari |
| 2016 | ICALP | Bicovering: Covering Edges With Two Small Subsets of Vertices. | Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz |
| 2015 | ICALP | Simultaneous Approximation of Constraint Satisfaction Problems. | Amey Bhangale, Swastik Kopparty, Sushant Sachdeva |