Amey Bhangale

91 papers A* 14A 7B 2Journal 61Unranked 7
YearRankTypeTitle / Venue / Authors
2026 A* conf
Plane vs. Plane Low Degree Test.
SODA
Amey Bhangale, Silas Richelson
2025 J jnl
An Analytical Approach to Parallel Repetition via CSP Inverse Theorems.
CoRR
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer, Kunal Mittal
2025 J jnl
An Analytical Approach to Parallel Repetition via CSP Inverse Theorems.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer, Kunal Mittal
2025 — conf
Leader Election with Poly-Logarithmic Communication Per Party.
CRYPTO (2)
Amey Bhangale, Chen-Da Liu-Zhang, Julian Loss, Kartik Nayak, Sravya Yandamuri
2025 J jnl
Leader Election with Poly-logarithmic Communication Per Party.
IACR Cryptol. ePrint Arch.
Amey Bhangale, Chen-Da Liu-Zhang, Julian Loss, Kartik Nayak, Sravya Yandamuri
2025 A* conf
On Approximability of Satisfiable k-CSPs: V.
STOC
Amey Bhangale, Subhash Khot, Dor Minzer
2025 A* conf
On Inverse Theorems and Combinatorial Lines.
FOCS
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2025 J jnl
On approximability of Satisfiable k-CSPs: I.
Comput. Complex.
Amey Bhangale, Subhash Khot, Dor Minzer
2025 J jnl
On approximability of satisfiable $\boldsymbol {k}$ -CSPs: II.
Comb. Probab. Comput.
Amey Bhangale, Subhash Khot, Dor Minzer
2025 B conf
Optimal Online Bipartite Matching in Degree-2 Graphs.
ISAAC
Amey Bhangale, Arghya Chakraborty, Prahladh Harsha
2025 J jnl
Optimal Online Bipartite Matching in Degree-2 Graphs.
CoRR
Amey Bhangale, Arghya Chakraborty, Prahladh Harsha
2025 A* conf
Parallel Repetition for 3-Player XOR Games.
STOC
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2025 J jnl
Parallel Repetition for 3-Player XOR Games.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2025 J jnl
Plane vs. Plane Low Degree Test.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Silas Richelson
2025 J jnl
The Quest towards Optimal Approximability of CSPs.
ACM SIGLOG News
Amey Bhangale
2024 J jnl
On Approximability of Satisfiable
CoRR
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024 J jnl
On Approximability of Satisfiable
CoRR
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024 A* conf
On Approximability of Satisfiable k-CSPs: IV.
STOC
Amey Bhangale, Subhash Khot, Dor Minzer
2024 J jnl
On Approximability of Satisfiable k-CSPs: V.
CoRR
Amey Bhangale, Subhash Khot, Dor Minzer
2024 J jnl
On Approximability of Satisfiable k-CSPs: V.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot, Dor Minzer
2024 J jnl
On Approximability of Satisfiable k-CSPs: VI.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024 J jnl
On Approximability of Satisfiable k-CSPs: VII.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024 J jnl
Parallel Repetition for 3-Player XOR Games.
CoRR
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2024 A conf
Parallel Repetition of k-Player Projection Games.
APPROX/RANDOM
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2024 J jnl
Reasonable Bounds for Combinatorial Lines of Length Three.
CoRR
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024 J jnl
Reasonable Bounds for Combinatorial Lines of Length Three.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer
2024 J jnl
Rigid Matrices from Rectangular PCPs.
SIAM J. Comput.
Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal
2023 J jnl
Effective Bounds for Restricted $3$-Arithmetic Progressions in $\mathbb{F}_p^n$.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot, Dor Minzer
2023 J jnl
Effective Bounds for Restricted 3-Arithmetic Progressions in F
CoRR
Amey Bhangale, Subhash Khot, Dor Minzer
2023 J jnl
Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs.
Algorithmica
Amey Bhangale, Aleksa Stankovic
2023 J jnl
On Approximability of Satisfiable
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot, Dor Minzer
2023 J jnl
On Approximability of Satisfiable
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot, Dor Minzer
2023 A* conf
On Approximability of Satisfiable k-CSPs: II.
STOC
Amey Bhangale, Subhash Khot, Dor Minzer
2023 A* conf
On Approximability of Satisfiable k-CSPs: III.
STOC
Amey Bhangale, Subhash Khot, Dor Minzer
2023 J jnl
On Approximability of Satisfiable k-CSPs: IV.
CoRR
Amey Bhangale, Subhash Khot, Dor Minzer
2023 J jnl
On Approximability of Satisfiable k-CSPs: IV.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot, Dor Minzer
2023 J jnl
Parallel Repetition of k-Player Projection Games.
CoRR
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2023 J jnl
Parallel Repetition of k-Player Projection Games.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2022 — conf
A Toolbox for Barriers on Interactive Oracle Proofs.
TCC (1)
Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev
2022 J jnl
A Toolbox for Barriers on Interactive Oracle Proofs.
IACR Cryptol. ePrint Arch.
Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev
2022 — conf
Efficient Adaptively-Secure Byzantine Agreement for Long Messages.
ASIACRYPT (1)
Amey Bhangale, Chen-Da Liu-Zhang, Julian Loss, Kartik Nayak
2022 A conf
Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs.
ITCS
Amey Bhangale, Aleksa Stankovic
2022 A conf
Mixing of 3-Term Progressions in Quasirandom Groups.
ITCS
Amey Bhangale, Prahladh Harsha, Sourya Roy
2022 J jnl
On Approximability of Satisfiable
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot, Dor Minzer
2022 A* conf
On approximability of satisfiable
STOC
Amey Bhangale, Subhash Khot, Dor Minzer
2022 J jnl
UG-hardness to NP-hardness by Losing Half.
Theory Comput.
Amey Bhangale, Subhash Khot
2021 J jnl
Efficient Adaptively-Secure Byzantine Agreement for Long Messages.
IACR Cryptol. ePrint Arch.
Amey Bhangale, Chen-Da Liu-Zhang, Julian Loss, Kartik Nayak
2021 J jnl
Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs.
CoRR
Amey Bhangale, Aleksa Stankovic
2021 J jnl
Mixing of 3-term progressions in Quasirandom Groups.
CoRR
Amey Bhangale, Prahladh Harsha, Sourya Roy
2021 J jnl
Mixing of 3-term progressions in Quasirandom Groups.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Prahladh Harsha, Sourya Roy
2021 A* conf
Optimal inapproximability of satisfiable k-LIN over non-abelian groups.
STOC
Amey Bhangale, Subhash Khot
2020 J jnl
A Characterization of Hard-to-Cover CSPs.
Theory Comput.
Amey Bhangale, Prahladh Harsha, Girish Varma
2020 — conf
Hardness of Approximation of (Multi-)LCS over Small Alphabet.
APPROX-RANDOM
Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar
2020 J jnl
Hardness of Approximation of (Multi-)LCS over Small Alphabet.
CoRR
Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar
2020 A* conf
Improved Inapproximability of Rainbow Coloring.
SODA
Per Austrin, Amey Bhangale, Aditya Potukuchi
2020 J jnl
Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups.
CoRR
Amey Bhangale, Subhash Khot
2020 J jnl
Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot
2020 A* conf
Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs.
FOCS
Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal
2020 J jnl
Rigid Matrices From Rectangular PCPs.
CoRR
Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal
2020 J jnl
Rigid Matrices From Rectangular PCPs.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal
2020 A conf
Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut.
CCC
Amey Bhangale, Subhash Khot
2019 J jnl
Simplified inpproximability of hypergraph coloring via t-agreeing families.
CoRR
Per Austrin, Amey Bhangale, Aditya Potukuchi
2019 J jnl
Simplified inpproximability of hypergraph coloring via t-agreeing families.
Electron. Colloquium Comput. Complex.
Per Austrin, Amey Bhangale, Aditya Potukuchi
2019 J jnl
Simultaneous Max-Cut is harder to approximate than Max-Cut.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot
2019 A conf
UG-Hardness to NP-Hardness by Losing Half.
CCC
Amey Bhangale, Subhash Khot
2019 J jnl
UG-hardness to NP-hardness by Losing Half.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot
2018 B conf
A Note on the Joint Entropy of N/2-Wise Independence.
ISIT
Amey Bhangale, Aditya Potukuchi
2018 J jnl
Improved Inapproximability of Rainbow Coloring.
CoRR
Per Austrin, Amey Bhangale, Aditya Potukuchi
2018 A* conf
NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors.
ICALP
Amey Bhangale
2018 J jnl
NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors.
Electron. Colloquium Comput. Complex.
Amey Bhangale
2018 A* conf
Near-optimal approximation algorithm for simultaneous Max-Cut.
SODA
Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari
2018 J jnl
Near-optimal approximation algorithm for simultaneous Max-Cut.
CoRR
Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari
2017 J jnl
A short note on the joint entropy of n/2-wise independence.
CoRR
Amey Bhangale, Aditya Potukuchi
2017 — conf
An Improved Dictatorship Test with Perfect Completeness.
FSTTCS
Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari
2017 J jnl
An Improved Dictatorship Test with Perfect Completeness.
CoRR
Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari
2017 J jnl
An Improved Dictatorship Test with Perfect Completeness.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari
2017 J jnl
Bi-Covering: Covering Edges with Two Small Subsets of Vertices.
SIAM J. Discret. Math.
Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
2017 A conf
Cube vs. Cube Low Degree Test.
ITCS
Amey Bhangale, Irit Dinur, Inbal Livni Navon
2016 A* conf
Bicovering: Covering Edges With Two Small Subsets of Vertices.
ICALP
Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
2016 J jnl
Bicovering: Covering edges with two small subsets of vertices.
Electron. Colloquium Comput. Complex.
Mohammad Taghi Hajiaghayi, Amey Bhangale, Rajiv Gandhi, Rohit Khandekar, Guy Kortsarz
2016 J jnl
Cube vs. Cube Low Degree Test.
CoRR
Amey Bhangale, Irit Dinur, Inbal Livni Navon
2016 J jnl
Cube vs. Cube Low Degree Test.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Irit Dinur, Inbal Livni Navon
2015 A conf
A Characterization of Hard-to-cover CSPs.
CCC
Amey Bhangale, Prahladh Harsha, Girish Varma
2015 J jnl
On Fortification of General Games.
CoRR
Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat
2015 J jnl
On Fortification of General Games.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat
2015 — conf
On Fortification of Projection Games.
APPROX-RANDOM
Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat
2015 — conf
Simultaneous Approximation of Constraint Satisfaction Problems.
ICALP (1)
Amey Bhangale, Swastik Kopparty, Sushant Sachdeva
2015 J jnl
The complexity of computing the minimum rank of a sign pattern matrix.
CoRR
Amey Bhangale, Swastik Kopparty
2014 J jnl
A Characterization of hard-to-cover CSPs.
CoRR
Amey Bhangale, Prahladh Harsha, Girish Varma
2014 J jnl
Simultaneous Approximation of Constraint Satisfaction Problems.
CoRR
Amey Bhangale, Swastik Kopparty, Sushant Sachdeva
2014 J jnl
Simultaneous Approximation of Constraint Satisfaction Problems.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Swastik Kopparty, Sushant Sachdeva