Ranking from Stochastic Pairwise Preferences: Recovering Condorcet Winners and Tournament Solution Sets at the Top. - Arun Rajkumar; Suprovat Ghoshal; Lek-Heng Lim; Shivani Agarwal 001 (ICML, 2015)

On the hardness of learning sparse parities. - Arnab Bhattacharyya 001; Ameet Gadekar; Suprovat Ghoshal; Rishi Saket (Electron. Colloquium Comput. Complex., 2015)

The Dictionary Testing Problem. - Siddharth Barman; Arnab Bhattacharyya 001; Suprovat Ghoshal (CoRR, 2016)

Hardness of learning noisy halfspaces using polynomial thresholds. - Arnab Bhattacharyya 001; Suprovat Ghoshal; Rishi Saket (Electron. Colloquium Comput. Complex., 2017)

Testing Sparsity over Known and Unknown Bases. - Siddharth Barman; Arnab Bhattacharyya 001; Suprovat Ghoshal (ICML, 2018)

Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH. - Arnab Bhattacharyya 001; Suprovat Ghoshal; Karthik C. S. 001; Pasin Manurangsi (Electron. Colloquium Comput. Complex., 2018)

Approximation Algorithms for Partially Colorable Graphs. - Suprovat Ghoshal; Anand Louis; Rahul Raychaudhury (APPROX-RANDOM, 2019)

Parameterized Intractability of Even Set and Shortest Vector Problem. - Arnab Bhattacharyya 001; Édouard Bonnet; László Egri; Suprovat Ghoshal; Karthik C. S. 001; Bingkai Lin; Pasin Manurangsi; Dániel Marx (Electron. Colloquium Comput. Complex., 2019)

Average Bias and Polynomial Sources. - Arnab Bhattacharyya 001; Philips George John; Suprovat Ghoshal; Raghu Meka (Electron. Colloquium Comput. Complex., 2019)

Hardness of Learning DNFs using Halfspaces. - Suprovat Ghoshal; Rishi Saket (Electron. Colloquium Comput. Complex., 2019)

Combinatorial Lower Bounds for 3-Query LDCs. - Arnab Bhattacharyya 001; L. Sunil Chandran; Suprovat Ghoshal (ITCS, 2020)

Approximation Algorithms and Hardness for Strong Unique Games. - Suprovat Ghoshal; Anand Louis (SODA, 2021)

Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits. - Aadirupa Saha; Suprovat Ghoshal (AISTATS, 2022)

The Biased Homogeneous r-Lin Problem. - Suprovat Ghoshal (APPROX/RANDOM, 2022)

Approximating CSPs with Outliers. - Suprovat Ghoshal; Anand Louis (APPROX/RANDOM, 2022)

A characterization of approximability for biased CSPs. - Euiwoong Lee; Suprovat Ghoshal (STOC, 2022)

Tight approximation bounds for maximum multi-coverage. - Siddharth Barman; Omar Fawzi; Suprovat Ghoshal; Emirhan Gürpinar (Math. Program., 2022)

On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs. - Suprovat Ghoshal; Euiwoong Lee (FOCS, 2023)

A PTAS for 𝓁0-Low Rank Approximation: Solving Dense CSPs over Reals. - Vincent Cohen-Addad; Chenglin Fan; Suprovat Ghoshal; Euiwoong Lee; Arnaud de Mesmay; Alantha Newman; Tony Chang Wang (CoRR, 2023)

A PTAS for ℓ0-Low Rank Approximation: Solving Dense CSPs over Reals. - Vincent Cohen-Addad; Chenglin Fan; Suprovat Ghoshal; Euiwoong Lee; Arnaud de Mesmay; Alantha Newman; Tony Chang Wang (SODA, 2024)

New Approximation Bounds for Small-Set Vertex Expansion. - Suprovat Ghoshal; Anand Louis (SODA, 2024)

Constraint Satisfaction Problems with Advice. - Suprovat Ghoshal; Konstantin Makarychev; Yury Makarychev (SODA, 2025)